Switch to: Citations

Add references

You must login to add references.
  1. Two Flavors of Curry’s Paradox.Jc Beall & Julien Murzi - 2013 - Journal of Philosophy 110 (3):143-165.
    In this paper, we distinguish two versions of Curry's paradox: c-Curry, the standard conditional-Curry paradox, and v-Curry, a validity-involving version of Curry's paradox that isn’t automatically solved by solving c-curry. A unified treatment of curry paradox thus calls for a unified treatment of both c-Curry and v-Curry. If, as is often thought, c-Curry paradox is to be solved via non-classical logic, then v-Curry may require a lesson about the structure—indeed, the substructure—of the validity relation itself.
    Download  
     
    Export citation  
     
    Bookmark   74 citations  
  • Capturing Naive Validity in the Cut-Free Approach.Eduardo Barrio, Lucas Rosenblatt & Diego Tajer - 2016 - Synthese 199 (Suppl 3):707-723.
    Rejecting the Cut rule has been proposed as a strategy to avoid both the usual semantic paradoxes and the so-called v-Curry paradox. In this paper we consider if a Cut-free theory is capable of accurately representing its own notion of validity. We claim that the standard rules governing the validity predicate are too weak for this purpose and we show that although it is possible to strengthen these rules, the most obvious way of doing so brings with it a serious (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Paradox Without Self-Reference.Stephen Yablo - 1993 - Analysis 53 (4):251.
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark   167 citations  
  • The Logic of Paradox.Graham Priest - 1979 - Journal of Philosophical Logic 8 (1):219 - 241.
    Download  
     
    Export citation  
     
    Bookmark   347 citations  
  • In Contradiction: A Study of the Transconsistent.Graham Priest - 1987 - Dordrecht, Netherland: Oxford University Press.
    In Contradiction advocates and defends the view that there are true contradictions, a view that flies in the face of orthodoxy in Western philosophy since Aristotle. The book has been at the center of the controversies surrounding dialetheism ever since its first publication in 1987. This second edition of the book substantially expands upon the original in various ways, and also contains the author’s reflections on developments over the last two decades. Further aspects of dialetheism are discussed in the companion (...)
    Download  
     
    Export citation  
     
    Bookmark   375 citations  
  • Spandrels of Truth.J. C. Beall - 2009 - Oxford, England: Oxford University Press.
    In Spandrels of Truth, Beall concisely presents and defends a modest, so-called dialetheic theory of transparent truth.
    Download  
     
    Export citation  
     
    Bookmark   124 citations  
  • Multiple-Conclusion Lp and Default Classicality.Jc Beall - 2011 - Review of Symbolic Logic 4 (2):326-336.
    Philosophical applications of familiar paracomplete and paraconsistent logics often rely on an idea of . With respect to the paraconsistent logic LP (the dual of Strong Kleene or K3), such is standardly cashed out via an LP-based nonmonotonic logic due to Priest (1991, 2006a). In this paper, I offer an alternative approach via a monotonic multiple-conclusion version of LP.
    Download  
     
    Export citation  
     
    Bookmark   43 citations  
  • Spandrels of Truth.Jc Beall - 2010 - Bulletin of Symbolic Logic 16 (2):284-286.
    Download  
     
    Export citation  
     
    Bookmark   136 citations  
  • An Alternative Approach for Quasi-Truth.Marcelo E. Coniglio & Luiz H. Da Cruz Silvestrini - 2014 - Logic Journal of the IGPL 22 (2):387-410.
    In 1986, Mikenberg et al. introduced the semantic notion of quasi-truth defined by means of partial structures. In such structures, the predicates are seen as triples of pairwise disjoint sets: the set of tuples which satisfies, does not satisfy and can satisfy or not the predicate, respectively. The syntactical counterpart of the logic of partial truth is a rather complicated first-order modal logic. In the present article, the notion of predicates as triples is recursively extended, in a natural way, to (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Conservatively Extending Classical Logic with Transparent Truth.David Ripley - 2012 - Review of Symbolic Logic 5 (2):354-378.
    This paper shows how to conservatively extend classical logic with a transparent truth predicate, in the face of the paradoxes that arise as a consequence. All classical inferences are preserved, and indeed extended to the full (truth—involving) vocabulary. However, not all classical metainferences are preserved; in particular, the resulting logical system is nontransitive. Some limits on this nontransitivity are adumbrated, and two proof systems are presented and shown to be sound and complete. (One proof system allows for Cut—elimination, but the (...)
    Download  
     
    Export citation  
     
    Bookmark   80 citations  
  • In Contradiction, A Study of the Transconsistent.Joel M. Smith - 1991 - Noûs 25 (3):380-383.
    Download  
     
    Export citation  
     
    Bookmark   93 citations  
  • Proof Analysis in Modal Logic.Sara Negri - 2005 - Journal of Philosophical Logic 34 (5-6):507-544.
    A general method for generating contraction- and cut-free sequent calculi for a large family of normal modal logics is presented. The method covers all modal logics characterized by Kripke frames determined by universal or geometric properties and it can be extended to treat also Gödel-Löb provability logic. The calculi provide direct decision methods through terminating proof search. Syntactic proofs of modal undefinability results are obtained in the form of conservativity theorems.
    Download  
     
    Export citation  
     
    Bookmark   83 citations  
  • Fixed Points for Consequence Relations.Toby Meadows - unknown
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • On Dialethism.Laura Goodship - 1996 - Australasian Journal of Philosophy 74 (1):153 – 161.
    Download  
     
    Export citation  
     
    Bookmark   23 citations  
  • Computability and Logic.G. S. Boolos & R. C. Jeffrey - 1977 - British Journal for the Philosophy of Science 28 (1):95-95.
    Download  
     
    Export citation  
     
    Bookmark   100 citations  
  • Non-Deterministic Semantics for Logics with a Consistency Operator.Arnon Avron - unknown
    In order to handle inconsistent knowledge bases in a reasonable way, one needs a logic which allows nontrivial inconsistent theories. Logics of this sort are called paraconsistent. One of the oldest and best known approaches to the problem of designing useful paraconsistent logics is da Costa’s approach, which seeks to allow the use of classical logic whenever it is safe to do so, but behaves completely differently when contradictions are involved. Da Costa’s approach has led to the family of logics (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark   16 citations