Switch to: References

Citations of:

Proof Theory for Modal Logic

Philosophy Compass 6 (8):523-538 (2011)

Add citations

You must login to add citations.
  1. Translations Between Gentzen–Prawitz and Jaśkowski–Fitch Natural Deduction Proofs.Shawn Standefer - 2019 - Studia Logica 107 (6):1103-1134.
    Two common forms of natural deduction proof systems are found in the Gentzen–Prawitz and Jaśkowski–Fitch systems. In this paper, I provide translations between proofs in these systems, pointing out the ways in which the translations highlight the structural rules implicit in the systems. These translations work for classical, intuitionistic, and minimal logic. I then provide translations for classical S4 proofs.
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  • The Intensional Side of Algebraic-Topological Representation Theorems.Sara Negri - 2017 - Synthese 198 (Suppl 5):1121-1143.
    Stone representation theorems are a central ingredient in the metatheory of philosophical logics and are used to establish modal embedding results in a general but indirect and non-constructive way. Their use in logical embeddings will be reviewed and it will be shown how they can be circumvented in favour of direct and constructive arguments through the methods of analytic proof theory, and how the intensional part of the representation results can be recovered from the syntactic proof of those embeddings. Analytic (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Proof Analysis in Intermediate Logics.Roy Dyckhoff & Sara Negri - 2012 - Archive for Mathematical Logic 51 (1-2):71-92.
    Using labelled formulae, a cut-free sequent calculus for intuitionistic propositional logic is presented, together with an easy cut-admissibility proof; both extend to cover, in a uniform fashion, all intermediate logics characterised by frames satisfying conditions expressible by one or more geometric implications. Each of these logics is embedded by the Gödel–McKinsey–Tarski translation into an extension of S4. Faithfulness of the embedding is proved in a simple and general way by constructive proof-theoretic methods, without appeal to semantics other than in the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   22 citations  
  • Axiomatic and Dual Systems for Constructive Necessity, a Formally Verified Equivalence.Lourdes del Carmen González-Huesca, Favio E. Miranda-Perea & P. Selene Linares-Arévalo - 2019 - Journal of Applied Non-Classical Logics 29 (3):255-287.
    We present a proof of the equivalence between two deductive systems for constructive necessity, namely an axiomatic characterisation inspired by Hakli and Negri's system of derivations from assumptions for modal logic , a Hilbert-style formalism designed to ensure the validity of the deduction theorem, and the judgmental reconstruction given by Pfenning and Davies by means of a natural deduction approach that makes a distinction between valid and true formulae, constructively. Both systems and the proof of their equivalence are formally verified (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Capturing Naive Validity in the Cut-Free Approach.Eduardo Barrio, Lucas Rosenblatt & Diego Tajer - forthcoming - Synthese:1-17.
    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 (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  • Vagueness: Subvaluationism.Pablo Cobreros - 2013 - Philosophy Compass 8 (5):472-485.
    Supervaluationism is a well known theory of vagueness. Subvaluationism is a less well known theory of vagueness. But these theories cannot be taken apart, for they are in a relation of duality that can be made precise. This paper provides an introduction to the subvaluationist theory of vagueness in connection to its dual, supervaluationism. A survey on the supervaluationist theory can be found in the Compass paper of Keefe (2008); our presentation of the theory in this paper will be short (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   11 citations  
  • Lyndon Interpolation Theorem of Instantial Neighborhood Logic – Constructively Via a Sequent Calculus.Junhua Yu - 2020 - Annals of Pure and Applied Logic 171 (1):102721.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Omega-Inconsistency Without Cuts and Nonstandard Models.Andreas Fjellstad - 2016 - Australasian Journal of Logic 13 (5).
    This paper concerns the relationship between transitivity of entailment, omega-inconsistency and nonstandard models of arithmetic. First, it provides a cut-free sequent calculus for non-transitive logic of truth STT based on Robinson Arithmetic and shows that this logic is omega-inconsistent. It then identifies the conditions in McGee for an omega-inconsistent logic as quantified standard deontic logic, presents a cut-free labelled sequent calculus for quantified standard deontic logic based on Robinson Arithmetic where the deontic modality is treated as a predicate, proves omega-inconsistency (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  • A Cut-Free Sequent Calculus for the Logic Od Subset Spaces.Birgit Elbl - 2016 - In Lev Beklemishev, Stéphane Demri & András Máté (eds.), Advances in Modal Logic, Volume 11. CSLI Publications. pp. 268-287.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  • Another Plan for Negation.Nissim Francez - 2019 - Australasian Journal of Logic 16 (5):159.
    The paper presents a plan for negation, proposing a paradigm shift from the Australian plan for negation, leading to a family of contra-classical logics. The two main ideas are the following: Instead of shifting points of evaluation, shift the evaluated formula. Introduce an incompatibility set for every atomic formula, extended to any compound formula, and impose the condition on valuations that a formula evaluates to true iff all the formulas in its incompatibility set evaluate to false. Thus, atomic sentences are (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Recent Advances in Proof Systems for Modal Logic.Sara Negri - 2014 - In Rajeev Goré, Barteld Kooi & Agi Kurucz (eds.), Advances in Modal Logic, Volume 10. CSLI Publications. pp. 421-422.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  • On a Generality Condition in Proof‐Theoretic Semantics.Bogdan Dicher - 2017 - Theoria 83 (4):394-418.
    In the recent literature on proof-theoretic semantics, there is mention of a generality condition on defining rules. According to this condition, the schematic formulation of the defining rules must be maximally general, in the sense that no restrictions should be placed on the contexts of these rules. In particular, context variables must always be present in the schematic rules and they should range over arbitrary collections of formulae. I argue against imposing such a condition, by showing that it has undesirable (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Tolerance and Higher-Order Vagueness.Peter Pagin - 2017 - Synthese 194 (10):3727-3760.
    The idea of higher-order vagueness is usually associated with conceptions of vagueness that focus on the existence of borderline cases. What sense can be made of it within a conception of vagueness that focuses on tolerance instead? A proposal is offered here. It involves understanding ‘definitely’ not as a sentence operator but as a predicate modifier, and more precisely as an intensifier, that is, an operator that shifts the predicate extension along a scale. This idea is combined with the author’s (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Proofs and Countermodels in Non-Classical Logics.Sara Negri - 2014 - Logica Universalis 8 (1):25-60.
    Proofs and countermodels are the two sides of completeness proofs, but, in general, failure to find one does not automatically give the other. The limitation is encountered also for decidable non-classical logics in traditional completeness proofs based on Henkin’s method of maximal consistent sets of formulas. A method is presented that makes it possible to establish completeness in a direct way: For any given sequent either a proof in the given logical system or a countermodel in the corresponding frame class (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   13 citations