Switch to: References

Add citations

You must login to add citations.
  1. Proofnets for S5: sequents and circuits for modal logic.Greg Restall - 2007 - In C. Dimitracopoulos, L. Newelski & D. Normann (eds.), Logic Colloquium 2005: Proceedings of the Annual European Summer Meeting of the Association for Symbolic Logic, Held in Athens, Greece, July 28-August 3, 2005. Cambridge: Cambridge University Press. pp. 151-172.
    In this paper I introduce a sequent system for the propositional modal logic S5. Derivations of valid sequents in the system are shown to correspond to proofs in a novel natural deduction system of circuit proofs (reminiscient of proofnets in linear logic, or multiple-conclusion calculi for classical logic). -/- The sequent derivations and proofnets are both simple extensions of sequents and proofnets for classical propositional logic, in which the new machinery—to take account of the modal vocabulary—is directly motivated in terms (...)
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • A perspective on modal sequent logic.Stephen Blamey & Lloyd Humberstone - 1991 - Publications of the Research Institute for Mathematical Sciences 27 (5):763-782.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • A Survey of Nonstandard Sequent Calculi.Andrzej Indrzejczak - 2014 - Studia Logica 102 (6):1295-1322.
    The paper is a brief survey of some sequent calculi which do not follow strictly the shape of sequent calculus introduced by Gentzen. We propose the following rough classification of all SC: Systems which are based on some deviations from the ordinary notion of a sequent are called generalised; remaining ones are called ordinary. Among the latter we distinguish three types according to the proportion between the number of primitive sequents and rules. In particular, in one of these types, called (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Are Uniqueness and Deducibility of Identicals the Same?Alberto Naibo & Mattia Petrolo - 2014 - Theoria 81 (2):143-181.
    A comparison is given between two conditions used to define logical constants: Belnap's uniqueness and Hacking's deducibility of identicals. It is shown that, in spite of some surface similarities, there is a deep difference between them. On the one hand, deducibility of identicals turns out to be a weaker and less demanding condition than uniqueness. On the other hand, deducibility of identicals is shown to be more faithful to the inferentialist perspective, permitting definition of genuinely proof-theoretical concepts. This kind of (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Modal translations in substructural logics.Kosta Došen - 1992 - Journal of Philosophical Logic 21 (3):283 - 336.
    Substructural logics are logics obtained from a sequent formulation of intuitionistic or classical logic by rejecting some structural rules. The substructural logics considered here are linear logic, relevant logic and BCK logic. It is proved that first-order variants of these logics with an intuitionistic negation can be embedded by modal translations into S4-type extensions of these logics with a classical, involutive, negation. Related embeddings via translations like the double-negation translation are also considered. Embeddings into analogues of S4 are obtained with (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Sequent-systems and groupoid models. I.Kosta Došen - 1988 - Studia Logica 47 (4):353 - 385.
    The purpose of this paper is to connect the proof theory and the model theory of a family of propositional logics weaker than Heyting's. This family includes systems analogous to the Lambek calculus of syntactic categories, systems of relevant logic, systems related toBCK algebras, and, finally, Johansson's and Heyting's logic. First, sequent-systems are given for these logics, and cut-elimination results are proved. In these sequent-systems the rules for the logical operations are never changed: all changes are made in the structural (...)
    Download  
     
    Export citation  
     
    Bookmark   37 citations  
  • Molecularity in the Theory of Meaning and the Topic Neutrality of Logic.Bernhard Weiss & Nils Kürbis - 2024 - In Antonio Piccolomini D'Aragona (ed.), Perspectives on Deduction: Contemporary Studies in the Philosophy, History and Formal Theories of Deduction. Springer Verlag. pp. 187-209.
    Without directly addressing the Demarcation Problem for logic—the problem of distinguishing logical vocabulary from others—we focus on distinctive aspects of logical vocabulary in pursuit of a second goal in the philosophy of logic, namely, proposing criteria for the justification of logical rules. Our preferred approach has three components. Two of these are effectively Belnap’s, but with a twist. We agree with Belnap’s response to Prior’s challenge to inferentialist characterisations of the meanings of logical constants. Belnap argued that for a logical (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • The Logicality of Equality.Andrzej Indrzejczak - 2024 - In Thomas Piecha & Kai F. Wehmeier (eds.), Peter Schroeder-Heister on Proof-Theoretic Semantics. Springer. pp. 211-238.
    The status of the equality predicate as a logical constant is problematic. In the paper we look at the problem from the proof-theoretic standpoint and survey several ways of treating equality in formal systems of different sorts. In particular, we focus on the framework of sequent calculus and examine equality in the light of criteria of logicality proposed by Hacking and Došen. Both attempts were formulated in terms of sequent calculus rules, although in the case of Došen it has a (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Peter Schroeder-Heister on Proof-Theoretic Semantics.Thomas Piecha & Kai F. Wehmeier (eds.) - 2024 - Springer.
    This open access book is a superb collection of some fifteen chapters inspired by Schroeder-Heister's groundbreaking work, written by leading experts in the field, plus an extensive autobiography and comments on the various contributions by Schroeder-Heister himself. For several decades, Peter Schroeder-Heister has been a central figure in proof-theoretic semantics, a field of study situated at the interface of logic, theoretical computer science, natural-language semantics, and the philosophy of language. -/- The chapters of which this book is composed discuss the (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Geometric Modal Logic.Brice Halimi - 2023 - Notre Dame Journal of Formal Logic 64 (3):377-406.
    The purpose of this paper is to generalize Kripke semantics for propositional modal logic by geometrizing it, that is, by considering the space underlying the collection of all possible worlds as an important semantic feature in its own right, so as to take the idea of accessibility seriously. The resulting new modal semantics is worked out in a setting coming from Riemannian geometry, where Kripke semantics is shown to correspond to a particular case, namely, the discrete one. Several correspondence results, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Bilateral Inversion Principles.Nils Kürbis - 2022 - Electronic Proceedings in Theoretical Computer Science 358:202–215.
    This paper formulates a bilateral account of harmony that is an alternative to one proposed by Francez. It builds on an account of harmony for unilateral logic proposed by Kürbis and the observation that reading the rules for the connectives of bilateral logic bottom up gives the grounds and consequences of formulas with the opposite speech act. I formulate a process I call 'inversion' which allows the determination of assertive elimination rules from assertive introduction rules, and rejective elimination rules from (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Conservativeness and uniqueness.Peter Schroeder-Heister - 1985 - Theoria 51 (3):159-173.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • Sketch of a Proof-Theoretic Semantics for Necessity.Nils Kürbis - 2020 - In Nicola Olivetti, Rineke Verbrugge & Sara Negri (eds.), Advances in Modal Logic 13. Booklet of Short Papers. Helsinki: pp. 37-43.
    This paper considers proof-theoretic semantics for necessity within Dummett's and Prawitz's framework. Inspired by a system of Pfenning's and Davies's, the language of intuitionist logic is extended by a higher order operator which captures a notion of validity. A notion of relative necessary is defined in terms of it, which expresses a necessary connection between the assumptions and the conclusion of a deduction.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Second-Order Modal Logic.Andrew Parisi - 2017 - Dissertation, University of Connecticut
    This dissertation develops an inferentialist theory of meaning. It takes as a starting point that the sense of a sentence is determined by the rules governing its use. In particular, there are two features of the use of a sentence that jointly determine its sense, the conditions under which it is coherent to assert that sentence and the conditions under which it is coherent to deny that sentence. From this starting point the dissertation develops a theory of quantification as marking (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • On the importance of being analytic. The paradigmatic case of the logic of proofs.Francesca Poggiolesi - 2012 - Logique Et Analyse 55 (219):443-461.
    In the recent literature on proof theory, there seems to be a new raising topic which consists in identifying those properties that characterise a good sequent calculus. The property that has received by far the most attention is the analyticity property. In this paper we propose a new argument in support of the analyticity property. We will do it by means of the example of the logic of proofs, a logic recently introduced by Artemov [1]. Indeed a detailed proof analysis (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • (2 other versions)Valentini’s cut-elimination for provability logic resolved.Rajeev Goré & Revantha Ramanayake - 2012 - Review of Symbolic Logic 5 (2):212-238.
    In 1983, Valentini presented a syntactic proof of cut elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for “Valentini”. The sequents in GLSV were built from sets, as opposed to multisets, thus avoiding an explicit contraction rule. From a syntactic point of view, it is more satisfying and formal to explicitly identify the applications of the contraction rule that are ‘hidden’ in these set based proofs of cut elimination. There is (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • A novel approach to equality.Andrzej Indrzejczak - 2021 - Synthese 199 (1-2):4749-4774.
    A new type of formalization of classical first-order logic with equality is introduced on the basis of the sequent calculus. It serves to justify the claim that equality is a logical constant characterised by well-behaved rules satisfying properties usually regarded as essential. The main feature of this approach is the application of sequents built not only from formulae but also from terms. Two variants of sequent calculus are examined, a structural and a logical one. The former is defined in accordance (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Natural Deduction, Hybrid Systems and Modal Logics.Andrzej Indrzejczak - 2010 - Dordrecht, Netherland: Springer.
    This book provides a detailed exposition of one of the most practical and popular methods of proving theorems in logic, called Natural Deduction. It is presented both historically and systematically. Also some combinations with other known proof methods are explored. The initial part of the book deals with Classical Logic, whereas the rest is concerned with systems for several forms of Modal Logics, one of the most important branches of modern logic, which has wide applicability.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • (1 other version)Cut-elimination and proof-search for bi-intuitionistic logic using nested sequents.Rajeev Goré, Linda Postniece & Alwen Tiu - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 43-66.
    We propose a new sequent calculus for bi intuitionistic logic which sits somewhere between display calculi and traditional sequent calculi by using nested sequents. Our calculus enjoys a simple (purely syntactic) cut elimination proof as do display calculi. But it has an easily derivable variant calculus which is amenable to automated proof search as are (some) traditional sequent calculi. We first present the initial calculus and its cut elimination proof. We then present the derived calculus, and then present a proof (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Modal logic as metalogic.Kosta Došen - 1992 - Journal of Logic, Language and Information 1 (3):173-201.
    The goal of this paper is to show how modal logic may be conceived as recording the derived rules of a logical system in the system itself. This conception of modal logic was propounded by Dana Scott in the early seventies. Here, similar ideas are pursued in a context less classical than Scott's.First a family of propositional logical systems is considered, which is obtained by gradually adding structural rules to a variant of the nonassociative Lambek calculus. In this family one (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Natural deduction for non-classical logics.David Basin, Seán Matthews & Luca Viganò - 1998 - Studia Logica 60 (1):119-160.
    We present a framework for machine implementation of families of non-classical logics with Kripke-style semantics. We decompose a logic into two interacting parts, each a natural deduction system: a base logic of labelled formulae, and a theory of labels characterizing the properties of the Kripke models. By appropriate combinations we capture both partial and complete fragments of large families of non-classical logics such as modal, relevance, and intuitionistic logics. Our approach is modular and supports uniform proofs of soundness, completeness and (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Nested Sequents for Intuitionistic Logics.Melvin Fitting - 2014 - Notre Dame Journal of Formal Logic 55 (1):41-61.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Logicality, Double-Line Rules, and Modalities.Norbert Gratzl & Eugenio Orlandelli - 2019 - Studia Logica 107 (1):85-107.
    This paper deals with the question of the logicality of modal logics from a proof-theoretic perspective. It is argued that if Dos̆en’s analysis of logical constants as punctuation marks is embraced, it is possible to show that all the modalities in the cube of normal modal logics are indeed logical constants. It will be proved that the display calculus for each displayable modality admits a purely structural presentation based on double-line rules which, following Dos̆en’s analysis, allows us to claim that (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • A proof-theoretic investigation of a logic of positions.Stefano Baratella & Andrea Masini - 2003 - Annals of Pure and Applied Logic 123 (1-3):135-162.
    We introduce an extension of natural deduction that is suitable for dealing with modal operators and induction. We provide a proof reduction system and we prove a strong normalization theorem for an intuitionistic calculus. As a consequence we obtain a purely syntactic proof of consistency. We also present a classical calculus and we relate provability in the two calculi by means of an adequate formula translation.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Linear time in hypersequent framework.Andrzej Indrzejczak - 2016 - Bulletin of Symbolic Logic 22 (1):121-144.
    Hypersequent calculus, developed by A. Avron, is one of the most interesting proof systems suitable for nonclassical logics. Although HC has rather simple form, it increases significantly the expressive power of standard sequent calculi. In particular, HC proved to be very useful in the field of proof theory of various nonclassical logics. It may seem surprising that it was not applied to temporal logics so far. In what follows, we discuss different approaches to formalization of logics of linear frames and (...)
    Download  
     
    Export citation  
     
    Bookmark   5 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 Hypersequent Solution to the Inferentialist Problem of Modality.Andrew Parisi - 2022 - Erkenntnis 87 (4):1605-1633.
    The standard inferentialist approaches to modal logic tend to suffer from not being able to uniquely characterize the modal operators, require that introduction and elimination rules be interdefined, or rely on the introduction of possible-world like indexes into the object language itself. In this paper I introduce a hypersequent calculus that is flexible enough to capture many of the standard modal logics and does not suffer from the above problems. It is therefore an ideal candidate to underwrite an inferentialist theory (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations