Results for 'Cut-elimination proof'

994 found
Order:
  1. Cut elimination for systems of transparent truth with restricted initial sequents.Carlo Nicolai - manuscript
    The paper studies a cluster of systems for fully disquotational truth based on the restriction of initial sequents. Unlike well-known alternative approaches, such systems display both a simple and intuitive model theory and remarkable proof-theoretic properties. We start by showing that, due to a strong form of invertibility of the truth rules, cut is eliminable in the systems via a standard strategy supplemented by a suitable measure of the number of applications of truth rules to formulas in derivations. Next, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  2. Elimination of Cuts in First-order Finite-valued Logics.Matthias Baaz, Christian G. Fermüller & Richard Zach - 1993 - Journal of Information Processing and Cybernetics EIK 29 (6):333-355.
    A uniform construction for sequent calculi for finite-valued first-order logics with distribution quantifiers is exhibited. Completeness, cut-elimination and midsequent theorems are established. As an application, an analog of Herbrand’s theorem for the four-valued knowledge-representation logic of Belnap and Ginsberg is presented. It is indicated how this theorem can be used for reasoning about knowledge bases with incomplete and inconsistent information.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  3. A cut-free sequent calculus for the bi-intuitionistic logic 2Int.Sara Ayhan - manuscript
    The purpose of this paper is to introduce a bi-intuitionistic sequent calculus and to give proofs of admissibility for its structural rules. The calculus I will present, called SC2Int, is a sequent calculus for the bi-intuitionistic logic 2Int, which Wansing presents in [2016a]. There he also gives a natural deduction system for this logic, N2Int, to which SC2Int is equivalent in terms of what is derivable. What is important is that these calculi represent a kind of bilateralist reasoning, since they (...)
    Download  
     
    Export citation  
     
    Bookmark  
  4. Proof Theory and Semantics for a Theory of Definite Descriptions.Nils Kürbis - 2021 - In Anupam Das & Sara Negri (eds.), TABLEAUX 2021, LNAI 12842.
    This paper presents a sequent calculus and a dual domain semantics for a theory of definite descriptions in which these expressions are formalised in the context of complete sentences by a binary quantifier I. I forms a formula from two formulas. Ix[F, G] means ‘The F is G’. This approach has the advantage of incorporating scope distinctions directly into the notation. Cut elimination is proved for a system of classical positive free logic with I and it is shown to (...)
    Download  
     
    Export citation  
     
    Bookmark  
  5. A Cut-Free Sequent Calculus for Defeasible Erotetic Inferences.Jared Millson - 2019 - Studia Logica (6):1-34.
    In recent years, the e ffort to formalize erotetic inferences (i.e., inferences to and from questions) has become a central concern for those working in erotetic logic. However, few have sought to formulate a proof theory for these inferences. To fill this lacuna, we construct a calculus for (classes of) sequents that are sound and complete for two species of erotetic inferences studied by Inferential Erotetic Logic (IEL): erotetic evocation and regular erotetic implication. While an attempt has been made (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  6. Takeuti's proof theory in the context of the Kyoto School.Andrew Arana - 2019 - Jahrbuch Für Philosophie Das Tetsugaku-Ronso 46:1-17.
    Gaisi Takeuti (1926–2017) is one of the most distinguished logicians in proof theory after Hilbert and Gentzen. He extensively extended Hilbert's program in the sense that he formulated Gentzen's sequent calculus, conjectured that cut-elimination holds for it (Takeuti's conjecture), and obtained several stunning results in the 1950–60s towards the solution of his conjecture. Though he has been known chiefly as a great mathematician, he wrote many papers in English and Japanese where he expressed his philosophical thoughts. In particular, (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  7. Hypersequents and the proof theory of intuitionistic fuzzy logic.Matthias Baaz & Richard Zach - 2000 - In Clote Peter G. & Schwichtenberg Helmut (eds.), Computer Science Logic. 14th International Workshop, CSL 2000. Springer. pp. 187– 201.
    Takeuti and Titani have introduced and investigated a logic they called intuitionistic fuzzy logic. This logic is characterized as the first-order Gödel logic based on the truth value set [0,1]. The logic is known to be axiomatizable, but no deduction system amenable to proof-theoretic, and hence, computational treatment, has been known. Such a system is presented here, based on previous work on hypersequent calculi for propositional Gödel logics by Avron. It is shown that the system is sound and complete, (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  8. A Binary Quantifier for Definite Descriptions for Cut Free Free Logics.Nils Kürbis - 2021 - Studia Logica 110 (1):219-239.
    This paper presents rules in sequent calculus for a binary quantifier I to formalise definite descriptions: Ix[F, G] means ‘The F is G’. The rules are suitable to be added to a system of positive free logic. The paper extends the proof of a cut elimination theorem for this system by Indrzejczak by proving the cases for the rules of I. There are also brief comparisons of the present approach to the more common one that formalises definite descriptions (...)
    Download  
     
    Export citation  
     
    Bookmark  
  9. Algorithmic Structuring of Cut-free Proofs.Matthias Baaz & Richard Zach - 1993 - In Börger Egon, Kleine Büning Hans, Jäger Gerhard, Martini Simone & Richter Michael M. (eds.), Computer Science Logic. CSL’92, San Miniato, Italy. Selected Papers. Springer. pp. 29–42.
    The problem of algorithmic structuring of proofs in the sequent calculi LK and LKB ( LK where blocks of quantifiers can be introduced in one step) is investigated, where a distinction is made between linear proofs and proofs in tree form. In this framework, structuring coincides with the introduction of cuts into a proof. The algorithmic solvability of this problem can be reduced to the question of k-l-compressibility: "Given a proof of length k , and l ≤ k (...)
    Download  
     
    Export citation  
     
    Bookmark  
  10. The Basics of Display Calculi.Tim Lyon, Christian Ittner, Timo Eckhardt & Norbert Gratzl - 2017 - Kriterion - Journal of Philosophy 31 (2):55-100.
    The aim of this paper is to introduce and explain display calculi for a variety of logics. We provide a survey of key results concerning such calculi, though we focus mainly on the global cut elimination theorem. Propositional, first-order, and modal display calculi are considered and their properties detailed.
    Download  
     
    Export citation  
     
    Bookmark  
  11. 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— (...), but the other does not.). (shrink)
    Download  
     
    Export citation  
     
    Bookmark   118 citations  
  12. Eliminating the ordinals from proofs. An analysis of transfinite recursion.Edoardo Rivello - 2014 - In Proceedings of the conference "Philosophy, Mathematics, Linguistics. Aspects of Interaction", St. Petersburg, April 21-25, 2014. pp. 174-184.
    Transfinite ordinal numbers enter mathematical practice mainly via the method of definition by transfinite recursion. Outside of axiomatic set theory, there is a significant mathematical tradition in works recasting proofs by transfinite recursion in other terms, mostly with the intention of eliminating the ordinals from the proofs. Leaving aside the different motivations which lead each specific case, we investigate the mathematics of this action of proof transforming and we address the problem of formalising the philosophical notion of elimination (...)
    Download  
     
    Export citation  
     
    Bookmark  
  13. The Epsilon Calculus and Herbrand Complexity.Georg Moser & Richard Zach - 2006 - Studia Logica 82 (1):133-155.
    Hilbert's ε-calculus is based on an extension of the language of predicate logic by a term-forming operator εx. Two fundamental results about the ε-calculus, the first and second epsilon theorem, play a rôle similar to that which the cut-elimination theorem plays in sequent calculus. In particular, Herbrand's Theorem is a consequence of the epsilon theorems. The paper investigates the epsilon theorems and the complexity of the elimination procedure underlying their proof, as well as the length of Herbrand (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  14. A resource-sensitive logic of agency.Daniele Porello & Nicolas Troquard - 2014 - In Ios Press (ed.), Proceedings of the 21st European Conference on Artificial Intelligence (ECAI'14), Prague, Czech Republic. 2014. pp. 723-728.
    We study a fragment of Intuitionistic Linear Logic combined with non-normal modal operators. Focusing on the minimal modal logic, we provide a Gentzen-style sequent calculus as well as a semantics in terms of Kripke resource models. We show that the proof theory is sound and complete with respect to the class of minimal Kripke resource models. We also show that the sequent calculus allows cut elimination. We put the logical framework to use by instantiating it as a logic (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  15. Non-normal modalities in variants of linear logic.D. Porello & N. Troquard - 2015 - Journal of Applied Non-Classical Logics 25 (3):229-255.
    This article presents modal versions of resource-conscious logics. We concentrate on extensions of variants of linear logic with one minimal non-normal modality. In earlier work, where we investigated agency in multi-agent systems, we have shown that the results scale up to logics with multiple non-minimal modalities. Here, we start with the language of propositional intuitionistic linear logic without the additive disjunction, to which we add a modality. We provide an interpretation of this language on a class of Kripke resource models (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  16. Why Can't Geometers Cut Themselves on the Acutely Angled Objects of Their Proofs? Aristotle on Shape as an Impure Power.Brad Berman - 2017 - Méthexis 29 (1):89-106.
    For Aristotle, the shape of a physical body is perceptible per se (DA II.6, 418a8-9). As I read his position, shape is thus a causal power, as a physical body can affect our sense organs simply in virtue of possessing it. But this invites a challenge. If shape is an intrinsically powerful property, and indeed an intrinsically perceptible one, then why are the objects of geometrical reasoning, as such, inert and imperceptible? I here address Aristotle’s answer to that problem, focusing (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  17. Gentzen’s “cut rule” and quantum measurement in terms of Hilbert arithmetic. Metaphor and understanding modeled formally.Vasil Penchev - 2022 - Logic and Philosophy of Mathematics eJournal 14 (14):1-37.
    Hilbert arithmetic in a wide sense, including Hilbert arithmetic in a narrow sense consisting by two dual and anti-isometric Peano arithmetics, on the one hand, and the qubit Hilbert space (originating for the standard separable complex Hilbert space of quantum mechanics), on the other hand, allows for an arithmetic version of Gentzen’s cut elimination and quantum measurement to be described uniformy as two processes occurring accordingly in those two branches. A philosophical reflection also justifying that unity by quantum neo-Pythagoreanism (...)
    Download  
     
    Export citation  
     
    Bookmark  
  18. On the Correspondence between Nested Calculi and Semantic Systems for Intuitionistic Logics.Tim Lyon - 2021 - Journal of Logic and Computation 31 (1):213-265.
    This paper studies the relationship between labelled and nested calculi for propositional intuitionistic logic, first-order intuitionistic logic with non-constant domains and first-order intuitionistic logic with constant domains. It is shown that Fitting’s nested calculi naturally arise from their corresponding labelled calculi—for each of the aforementioned logics—via the elimination of structural rules in labelled derivations. The translational correspondence between the two types of systems is leveraged to show that the nested calculi inherit proof-theoretic properties from their associated labelled calculi, (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  19. Eliminating Undecidability and Incompleteness in Formal Systems.P. Olcott - manuscript
    To eliminate incompleteness, undecidability and inconsistency from formal systems we only need to convert the formal proofs to theorem consequences of symbolic logic to conform to the sound deductive inference model. -/- Within the sound deductive inference model there is a (connected sequence of valid deductions from true premises to a true conclusion) thus unlike the formal proofs of symbolic logic provability cannot diverge from truth.
    Download  
     
    Export citation  
     
    Bookmark  
  20. Criminal Proof: Fixed or Flexible?Lewis Ross - 2023 - Philosophical Quarterly (4):1-23.
    Should we use the same standard of proof to adjudicate guilt for murder and petty theft? Why not tailor the standard of proof to the crime? These relatively neglected questions cut to the heart of central issues in the philosophy of law. This paper scrutinises whether we ought to use the same standard for all criminal cases, in contrast with a flexible approach that uses different standards for different crimes. I reject consequentialist arguments for a radically flexible standard (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  21. Proof-Theoretic Semantics and Inquisitive Logic.Will Stafford - 2021 - Journal of Philosophical Logic 50 (5):1199-1229.
    Prawitz conjectured that proof-theoretic validity offers a semantics for intuitionistic logic. This conjecture has recently been proven false by Piecha and Schroeder-Heister. This article resolves one of the questions left open by this recent result by showing the extensional alignment of proof-theoretic validity and general inquisitive logic. General inquisitive logic is a generalisation of inquisitive semantics, a uniform semantics for questions and assertions. The paper further defines a notion of quasi-proof-theoretic validity by restricting proof-theoretic validity to (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  22. Cut-conditions on sets of multiple-alternative inferences.Harold T. Hodes - 2022 - Mathematical Logic Quarterly 68 (1):95 - 106.
    I prove that the Boolean Prime Ideal Theorem is equivalent, under some weak set-theoretic assumptions, to what I will call the Cut-for-Formulas to Cut-for-Sets Theorem: for a set F and a binary relation |- on Power(F), if |- is finitary, monotonic, and satisfies cut for formulas, then it also satisfies cut for sets. I deduce the CF/CS Theorem from the Ultrafilter Theorem twice; each proof uses a different order-theoretic variant of the Tukey- Teichmüller Lemma. I then discuss relationships between (...)
    Download  
     
    Export citation  
     
    Bookmark  
  23. Criminal Proof: Fixed or Flexible?Lewis Ross - 2023 - The Philosophical Quarterly.
    Should we use the same standard of proof to adjudicate guilt for murder and petty theft? Why not tailor the standard of proof to the crime? These relatively neglected questions cut to the heart of central issues in the philosophy of law. This paper scrutinises whether we ought to use the same standard for all criminal cases, in contrast with a flexible approach that uses different standards for different crimes. I reject consequentialist arguments for a radically flexible standard (...)
    Download  
     
    Export citation  
     
    Bookmark  
  24. Stoic Sequent Logic and Proof Theory.Susanne Bobzien - 2019 - History and Philosophy of Logic 40 (3):234-265.
    This paper contends that Stoic logic (i.e. Stoic analysis) deserves more attention from contemporary logicians. It sets out how, compared with contemporary propositional calculi, Stoic analysis is closest to methods of backward proof search for Gentzen-inspired substructural sequent logics, as they have been developed in logic programming and structural proof theory, and produces its proof search calculus in tree form. It shows how multiple similarities to Gentzen sequent systems combine with intriguing dissimilarities that may enrich contemporary discussion. (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  25.  55
    Fusion, fission, and Ackermann’s truth constant in relevant logics: A proof-theoretic investigation.Fabio De Martin Polo - forthcoming - In Andrew Tedder, Shawn Standefer & Igor Sedlar (eds.), New Directions in Relevant Logic. Springer.
    The aim of this paper is to provide a proof-theoretic characterization of relevant logics including fusion and fission connectives, as well as Ackermann’s truth constant. We achieve this by employing the well-established methodology of labelled sequent calculi. After having introduced several systems, we will conduct a detailed proof-theoretic analysis, show a cut-admissibility theorem, and establish soundness and completeness. The paper ends with a discussion that contextualizes our current work within the broader landscape of the proof theory of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  26. Automating Agential Reasoning: Proof-Calculi and Syntactic Decidability for STIT Logics.Tim Lyon & Kees van Berkel - 2019 - In M. Baldoni, M. Dastani, B. Liao, Y. Sakurai & R. Zalila Wenkstern (eds.), PRIMA 2019: Principles and Practice of Multi-Agent Systems. Springer. pp. 202-218.
    This work provides proof-search algorithms and automated counter-model extraction for a class of STIT logics. With this, we answer an open problem concerning syntactic decision procedures and cut-free calculi for STIT logics. A new class of cut-free complete labelled sequent calculi G3LdmL^m_n, for multi-agent STIT with at most n-many choices, is introduced. We refine the calculi G3LdmL^m_n through the use of propagation rules and demonstrate the admissibility of their structural rules, resulting in auxiliary calculi Ldm^m_nL. In the single-agent case, (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  27.  69
    Topics in the Proof Theory of Non-classical Logics. Philosophy and Applications.Fabio De Martin Polo - 2023 - Dissertation, Ruhr-Universität Bochum
    Chapter 1 constitutes an introduction to Gentzen calculi from two perspectives, logical and philosophical. It introduces the notion of generalisations of Gentzen sequent calculus and the discussion on properties that characterize good inferential systems. Among the variety of Gentzen-style sequent calculi, I divide them in two groups: syntactic and semantic generalisations. In the context of such a discussion, the inferentialist philosophy of the meaning of logical constants is introduced, and some potential objections – mainly concerning the choice of working with (...)
    Download  
     
    Export citation  
     
    Bookmark  
  28. Plato’s Metaphysical Development before Middle Period Dialogues.Mohammad Bagher Ghomi - manuscript
    Regarding the relation of Plato’s early and middle period dialogues, scholars have been divided to two opposing groups: unitarists and developmentalists. While developmentalists try to prove that there are some noticeable and even fundamental differences between Plato’s early and middle period dialogues, the unitarists assert that there is no essential difference in there. The main goal of this article is to suggest that some of Plato’s ontological as well as epistemological principles change, both radically and fundamentally, between the early and (...)
    Download  
     
    Export citation  
     
    Bookmark  
  29. Non-reflexive Nonsense: Proof-Theory for Paracomplete Weak Kleene Logic.Bruno Da Ré, Damian Szmuc & María Inés Corbalán - forthcoming - Studia Logica:1-17.
    Our aim is to provide a sequent calculus whose external consequence relation coincides with the three-valued paracomplete logic `of nonsense' introduced by Dmitry Bochvar and, independently, presented as the weak Kleene logic K3W by Stephen C. Kleene. The main features of this calculus are (i) that it is non-reflexive, i.e., Identity is not included as an explicit rule (although a restricted form of it with premises is derivable); (ii) that it includes rules where no variable-inclusion conditions are attached; and (iii) (...)
    Download  
     
    Export citation  
     
    Bookmark  
  30. Normalisation and subformula property for a system of intuitionistic logic with general introduction and elimination rules.Nils Kürbis - 2021 - Synthese 199 (5-6):14223-14248.
    This paper studies a formalisation of intuitionistic logic by Negri and von Plato which has general introduction and elimination rules. The philosophical importance of the system is expounded. Definitions of ‘maximal formula’, ‘segment’ and ‘maximal segment’ suitable to the system are formulated and corresponding reduction procedures for maximal formulas and permutative reduction procedures for maximal segments given. Alternatives to the main method used are also considered. It is shown that deductions in the system convert into normal form and that (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  31. A General Schema for Bilateral Proof Rules.Ryan Simonelli - 2024 - Journal of Philosophical Logic:1-34.
    Bilateral proof systems, which provide rules for both affirming and denying sentences, have been prominent in the development of proof-theoretic semantics for classical logic in recent years. However, such systems provide a substantial amount of freedom in the formulation of the rules, and, as a result, a number of different sets of rules have been put forward as definitive of the meanings of the classical connectives. In this paper, I argue that a single general schema for bilateral (...) rules has a reasonable claim to inferentially articulating the core meaning of all of the classical connectives. I propose this schema in the context of a bilateral sequent calculus in which each connective is given exactly two rules: a rule for affirmation and a rule for denial. Positive and negative rules for all of the classical connectives are given by a single rule schema, harmony between these positive and negative rules is established at the schematic level by a pair of elimination theorems, and the truth-conditions for all of the classical connectives are read off at once from the schema itself. (shrink)
    Download  
     
    Export citation  
     
    Bookmark  
  32. Prove it! The Burden of Proof Game in Science vs. Pseudoscience Disputes.Massimo Pigliucci & Maarten Boudry - 2014 - Philosophia 42 (2):487-502.
    The concept of burden of proof is used in a wide range of discourses, from philosophy to law, science, skepticism, and even in everyday reasoning. This paper provides an analysis of the proper deployment of burden of proof, focusing in particular on skeptical discussions of pseudoscience and the paranormal, where burden of proof assignments are most poignant and relatively clear-cut. We argue that burden of proof is often misapplied or used as a mere rhetorical gambit, with (...)
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  33. Evolutionary Psychology: The Burdens of Proof.Elisabeth A. Lloyd - 1999 - Biology and Philosophy 14 (2):211-233.
    I discuss two types of evidential problems with the most widely touted experiments in evolutionary psychology, those performed by Leda Cosmides and interpreted by Cosmides and John Tooby. First, and despite Cosmides and Tooby's claims to the contrary, these experiments don't fulfil the standards of evidence of evolutionary biology. Second Cosmides and Tooby claim to have performed a crucial experiment, and to have eliminated rival approaches. Though they claim that their results are consistent with their theory but contradictory to the (...)
    Download  
     
    Export citation  
     
    Bookmark   42 citations  
  34. A Note on Harmony.Nissim Francez & Roy Dyckhoff - 2012 - Journal of Philosophical Logic 41 (3):613-628.
    In the proof-theoretic semantics approach to meaning, harmony , requiring a balance between introduction-rules (I-rules) and elimination rules (E-rules) within a meaning conferring natural-deduction proof-system, is a central notion. In this paper, we consider two notions of harmony that were proposed in the literature: 1. GE-harmony , requiring a certain form of the E-rules, given the form of the I-rules. 2. Local intrinsic harmony : imposes the existence of certain transformations of derivations, known as reduction and expansion (...)
    Download  
     
    Export citation  
     
    Bookmark   33 citations  
  35. On Deriving Nested Calculi for Intuitionistic Logics from Semantic Systems.Tim Lyon - 2020 - In Sergei Artemov & Anil Nerode (eds.), Logical Foundations of Computer Science. Cham: pp. 177-194.
    This paper shows how to derive nested calculi from labelled calculi for propositional intuitionistic logic and first-order intuitionistic logic with constant domains, thus connecting the general results for labelled calculi with the more refined formalism of nested sequents. The extraction of nested calculi from labelled calculi obtains via considerations pertaining to the elimination of structural rules in labelled derivations. Each aspect of the extraction process is motivated and detailed, showing that each nested calculus inherits favorable proof-theoretic properties from (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  36. Refining Labelled Systems for Modal and Constructive Logics with Applications.Tim Lyon - 2021 - Dissertation, Technischen Universität Wien
    This thesis introduces the "method of structural refinement", which serves as a means of transforming the relational semantics of a modal and/or constructive logic into an 'economical' proof system by connecting two proof-theoretic paradigms: labelled and nested sequent calculi. The formalism of labelled sequents has been successful in that cut-free calculi in possession of desirable proof-theoretic properties can be automatically generated for large classes of logics. Despite these qualities, labelled systems make use of a complicated syntax that (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  37. Legal evidence and knowledge.Georgi Gardiner - 2019 - In Maria Lasonen-Aarnio & Clayton Littlejohn (eds.), The Routledge Handbook of the Philosophy of Evidence. Routledge.
    This essay is an accessible introduction to the proof paradox in legal epistemology. -/- In 1902 the Supreme Judicial Court of Maine filed an influential legal verdict. The judge claimed that in order to find a defendant culpable, the plaintiff “must adduce evidence other than a majority of chances”. The judge thereby claimed that bare statistical evidence does not suffice for legal proof. -/- In this essay I first motivate the claim that bare statistical evidence does not suffice (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  38. Proofnets for S5: sequents and circuits for modal logic.Greg Restall - 2007 - In C. Dimitracopoulos, L. Newelski & D. Normann (eds.), Logic Colloquium 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  
  39. Syntactic Interpolation for Tense Logics and Bi-Intuitionistic Logic via Nested Sequents.Tim Lyon, Alwen Tiu, Rajeev Gore & Ranald Clouston - 2020 - In Maribel Fernandez & Anca Muscholl (eds.), 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Dagstuhl, Germany: pp. 1-16.
    We provide a direct method for proving Craig interpolation for a range of modal and intuitionistic logics, including those containing a "converse" modality. We demonstrate this method for classical tense logic, its extensions with path axioms, and for bi-intuitionistic logic. These logics do not have straightforward formalisations in the traditional Gentzen-style sequent calculus, but have all been shown to have cut-free nested sequent calculi. The proof of the interpolation theorem uses these calculi and is purely syntactic, without resorting to (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  40. Normalisation for Bilateral Classical Logic with some Philosophical Remarks.Nils Kürbis - 2021 - Journal of Applied Logics 2 (8):531-556.
    Bilateralists hold that the meanings of the connectives are determined by rules of inference for their use in deductive reasoning with asserted and denied formulas. This paper presents two bilateral connectives comparable to Prior's tonk, for which, unlike for tonk, there are reduction steps for the removal of maximal formulas arising from introducing and eliminating formulas with those connectives as main operators. Adding either of them to bilateral classical logic results in an incoherent system. One way around this problem is (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  41. One-step Modal Logics, Intuitionistic and Classical, Part 1.Harold T. Hodes - 2021 - Journal of Philosophical Logic 50 (5):837-872.
    This paper and its sequel “look under the hood” of the usual sorts of proof-theoretic systems for certain well-known intuitionistic and classical propositional modal logics. Section 1 is preliminary. Of most importance: a marked formula will be the result of prefixing a formula in a propositional modal language with a step-marker, for this paper either 0 or 1. Think of 1 as indicating the taking of “one step away from 0.” Deductions will be constructed using marked formulas. Section 2 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  42. Topics in Philosophical Logic.Jon Erling Litland - 2012 - Dissertation, Harvard
    In “Proof-Theoretic Justification of Logic”, building on work by Dummett and Prawitz, I show how to construct use-based meaning-theories for the logical constants. The assertability-conditional meaning-theory takes the meaning of the logical constants to be given by their introduction rules; the consequence-conditional meaning-theory takes the meaning of the logical constants to be given by their elimination rules. I then consider the question: given a set of introduction rules \, what are the strongest elimination rules that are validated (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  43. Normalisation and subformula property for a system of classical logic with Tarski’s rule.Nils Kürbis - 2021 - Archive for Mathematical Logic 61 (1):105-129.
    This paper considers a formalisation of classical logic using general introduction rules and general elimination rules. It proposes a definition of ‘maximal formula’, ‘segment’ and ‘maximal segment’ suitable to the system, and gives reduction procedures for them. It is then shown that deductions in the system convert into normal form, i.e. deductions that contain neither maximal formulas nor maximal segments, and that deductions in normal form satisfy the subformula property. Tarski’s Rule is treated as a general introduction rule for (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  44. The enduring scandal of deduction: is propositional logic really uninformative?Marcello D'Agostino & Luciano Floridi - 2009 - Synthese 167 (2):271-315.
    Deductive inference is usually regarded as being “tautological” or “analytical”: the information conveyed by the conclusion is contained in the information conveyed by the premises. This idea, however, clashes with the undecidability of first-order logic and with the (likely) intractability of Boolean logic. In this article, we address the problem both from the semantic and the proof-theoretical point of view. We propose a hierarchy of propositional logics that are all tractable (i.e. decidable in polynomial time), although by means of (...)
    Download  
     
    Export citation  
     
    Bookmark   26 citations  
  45. Gorgiasza meontologia vs. nihilizm.Seweryn Blandzi - 2012 - Argument: Biannual Philosophical Journal 2 (2):245 - 264.
    Meontology of Gorgias vs. Nihilism. The purpose of this paper is to challenge Gorgias’ image of a “nihilist existentialist”. The original thesis ouden estin, too frequently rendered as „nothing exists”, thus reducing the verb “to be” to denote “bare” existence, and ouden to denote “nothingness”. On close inspection, it turns out that, in Gorgias, neither do we have a negation of reality nor an affirmative treatment of the word “nothingness”.Therefore, ouden” should not be understood as a negation of all reality (...)
    Download  
     
    Export citation  
     
    Bookmark  
  46. Castle’s Choice: Manipulation, Subversion, and Autonomy.Robert Allen - manuscript
    Causal Determinism (CD) entails that all of a person’s choices and actions are nomically related to events in the distant past, the approximate, but lawful, consequences of those occurrences. Assuming that history cannot be undone nor those (natural) relations altered, that whatever results from what is inescapable is itself inescapable, and the contrariety of inevitability and freedom, it follows that we are completely devoid of liberty: our choices are not freely made; our actions are not freely performed. Instead of disputing (...)
    Download  
     
    Export citation  
     
    Bookmark  
  47.  46
    Modular labelled calculi for relevant logics.Fabio De Martin Polo - 2023 - Australasian Journal of Logic 20 (1):47-87.
    In this article, we perform a detailed proof theoretic investigation of a wide number of relevant logics by employing the well-established methodology of labelled sequent calculi to build our intended systems. At the semantic level, we will characterise relevant logics by employing reduced Routley-Meyer models, namely, relational structures with a ternary relation between worlds along with a unique distinct element considered as the real (or actual) world. This paper realizes the idea of building a variety of modular labelled calculi (...)
    Download  
     
    Export citation  
     
    Bookmark  
  48. What is the correct logic of necessity, actuality and apriority?Peter Fritz - 2014 - Review of Symbolic Logic 7 (3):385-414.
    This paper is concerned with a propositional modal logic with operators for necessity, actuality and apriority. The logic is characterized by a class of relational structures defined according to ideas of epistemic two-dimensional semantics, and can therefore be seen as formalizing the relations between necessity, actuality and apriority according to epistemic two-dimensional semantics. We can ask whether this logic is correct, in the sense that its theorems are all and only the informally valid formulas. This paper gives outlines of two (...)
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  49. The Ties that Undermine.John Beverley - 2015 - Bioethics 30 (5):304-311.
    Do biological relations ground responsibilities between biological fathers and their offspring? Few think biological relations ground either necessary or sufficient conditions for responsibility. Nevertheless, many think biological relations ground responsibility at least partially. Various scenarios, such as cases concerning the responsibilities of sperm donors, have been used to argue in favor of biological relations as partially grounding responsibilities. In this article, I seek to undermine the temptation to explain sperm donor scenarios via biological relations by appealing to an overlooked feature (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  50. Quantified Propositional Gödel Logics.Matthias Baaz, Agata Ciabattoni & Richard Zach - 2000 - In Andrei Voronkov & Michel Parigot (eds.), Logic for Programming and Automated Reasoning. 7th International Conference, LPAR 2000. Berlin: Springer. pp. 240-256.
    It is shown that Gqp↑, the quantified propositional Gödel logic based on the truth-value set V↑ = {1 - 1/n : n≥1}∪{1}, is decidable. This result is obtained by reduction to Büchi's theory S1S. An alternative proof based on elimination of quantifiers is also given, which yields both an axiomatization and a characterization of Gqp↑ as the intersection of all finite-valued quantified propositional Gödel logics.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
1 — 50 / 994