Switch to: Citations

Add references

You must login to add references.
  1. Paradoxes and Failures of Cut.David Ripley - 2013 - Australasian Journal of Philosophy 91 (1):139 - 164.
    This paper presents and motivates a new philosophical and logical approach to truth and semantic paradox. It begins from an inferentialist, and particularly bilateralist, theory of meaning---one which takes meaning to be constituted by assertibility and deniability conditions---and shows how the usual multiple-conclusion sequent calculus for classical logic can be given an inferentialist motivation, leaving classical model theory as of only derivative importance. The paper then uses this theory of meaning to present and motivate a logical system---ST---that conservatively extends classical (...)
    Download  
     
    Export citation  
     
    Bookmark   162 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   122 citations  
  • Outline of a theory of truth.Saul Kripke - 1975 - Journal of Philosophy 72 (19):690-716.
    A formal theory of truth, alternative to tarski's 'orthodox' theory, based on truth-value gaps, is presented. the theory is proposed as a fairly plausible model for natural language and as one which allows rigorous definitions to be given for various intuitive concepts, such as those of 'grounded' and 'paradoxical' sentences.
    Download  
     
    Export citation  
     
    Bookmark   892 citations  
  • Heterogeneous logic.I. L. Humberstone - 1988 - Erkenntnis 29 (3):395 - 435.
    This paper considers the question: what becomes of the notion of a logic as a way of codifying valid arguments when the customary assumption is dropped that the premisses and conclusions of these arguments are statements from some single language? An elegant treatment of the notion of a logic, when this assumption is in force, is that provided by Dana Scott's theory of consequence relations; this treatment is appropriately generalized in the present paper to the case where we do not (...)
    Download  
     
    Export citation  
     
    Bookmark   25 citations  
  • How a semantics for tonk should be.Andreas Fjellstad - 2015 - Review of Symbolic Logic 8 (3):488-505.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Free assumptions and the liar paradox.Patrick Greenough - 2001 - American Philosophical Quarterly 38 (2):115 - 135.
    A new solution to the liar paradox is developed using the insight that it is illegitimate to even suppose (let alone assert) that a liar sentence has a truth-status (true or not) on the grounds that supposing this sentence to be true/not-true essentially defeats the telos of supposition in a readily identifiable way. On that basis, the paradox is blocked by restricting the Rule of Assumptions in Gentzen-style presentations of the sequent-calculus. The lesson of the liar is that not all (...)
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • The truth is never simple.John P. Burgess - 1986 - Journal of Symbolic Logic 51 (3):663-681.
    The complexity of the set of truths of arithmetic is determined for various theories of truth deriving from Kripke and from Gupta and Herzberger.
    Download  
     
    Export citation  
     
    Bookmark   62 citations  
  • Kripke and the logic of truth.Michael Kremer - 1988 - Journal of Philosophical Logic 17 (3):225 - 278.
    Download  
     
    Export citation  
     
    Bookmark   65 citations  
  • The method of hypersequents in the proof theory of propositional non-classical logics.Arnon Avron - 1977 - In Wilfrid Hodges (ed.), Logic. New York: Penguin Books. pp. 1-32.
    Until not too many years ago, all logics except classical logic (and, perhaps, intuitionistic logic too) were considered to be things esoteric. Today this state of a airs seems to have completely been changed. There is a growing interest in many types of nonclassical logics: modal and temporal logics, substructural logics, paraconsistent logics, non-monotonic logics { the list is long. The diversity of systems that have been proposed and studied is so great that a need is felt by many researchers (...)
    Download  
     
    Export citation  
     
    Bookmark   59 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   104 citations  
  • Structural Reflexivity and the Paradoxes of Self-Reference.Rohan French - 2016 - Ergo: An Open Access Journal of Philosophy 3.
    Download  
     
    Export citation  
     
    Bookmark   61 citations  
  • A cut-free simple sequent calculus for modal logic S5.Francesca Poggiolesi - 2008 - Review of Symbolic Logic 1 (1):3-15.
    In this paper, we present a simple sequent calculus for the modal propositional logic S5. We prove that this sequent calculus is theoremwise equivalent to the Hilbert-style system S5, that it is contraction-free and cut-free, and finally that it is decidable. All results are proved in a purely syntactic way.
    Download  
     
    Export citation  
     
    Bookmark   23 citations  
  • A cut-free sequent system for two-dimensional modal logic, and why it matters.Greg Restall - 2012 - Annals of Pure and Applied Logic 163 (11):1611-1623.
    The two-dimensional modal logic of Davies and Humberstone [3] is an important aid to our understanding the relationship between actuality, necessity and a priori knowability. I show how a cut-free hypersequent calculus for 2D modal logic not only captures the logic precisely, but may be used to address issues in the epistemology and metaphysics of our modal concepts. I will explain how the use of our concepts motivates the inference rules of the sequent calculus, and then show that the completeness (...)
    Download  
     
    Export citation  
     
    Bookmark   26 citations