Related

Contents
166 found
Order:
1 — 50 / 166
  1. Computational reverse mathematics and foundational analysis.Benedict Eastaugh - manuscript
    Reverse mathematics studies which subsystems of second order arithmetic are equivalent to key theorems of ordinary, non-set-theoretic mathematics. The main philosophical application of reverse mathematics proposed thus far is foundational analysis, which explores the limits of different foundations for mathematics in a formally precise manner. This paper gives a detailed account of the motivations and methodology of foundational analysis, which have heretofore been largely left implicit in the practice. It then shows how this account can be fruitfully applied in the (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  2. The Power of Naive Truth.Hartry Field - manuscript
    While non-classical theories of truth that take truth to be transparent have some obvious advantages over any classical theory that evidently must take it as non-transparent, several authors have recently argued that there's also a big disadvantage of non-classical theories as compared to their “external” classical counterparts: proof-theoretic strength. While conceding the relevance of this, the paper argues that there is a natural way to beef up extant internal theories so as to remove their proof-theoretic disadvantage. It is suggested that (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   4 citations  
  3. A Decision Procedure for Herbrand Formulas without Skolemization.Timm Lampert - manuscript
    This paper describes a decision procedure for disjunctions of conjunctions of anti-prenex normal forms of pure first-order logic (FOLDNFs) that do not contain V within the scope of quantifiers. The disjuncts of these FOLDNFs are equivalent to prenex normal forms whose quantifier-free parts are conjunctions of atomic and negated atomic formulae (= Herbrand formulae). In contrast to the usual algorithms for Herbrand formulae, neither skolemization nor unification algorithms with function symbols are applied. Instead, a procedure is described that rests on (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  4. 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, we (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  5. On the notion of validity for the bilateral classical logic.Ukyo Suzuki & Yoriyuki Yamagata - manuscript
    This paper considers Rumfitt’s bilateral classical logic (BCL), which is proposed to counter Dummett’s challenge to classical logic. First, agreeing with several authors, we argue that Rumfitt’s notion of harmony, used to justify logical rules by a purely proof theoretical manner, is not sufficient to justify coordination rules in BCL purely proof-theoretically. For the central part of this paper, we propose a notion of proof-theoretical validity similar to Prawitz for BCL and proves that BCL is sound and complete respect to (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  6. Meaning and identity of proofs in a bilateralist setting: A two-sorted typed lambda-calculus for proofs and refutations.Sara Ayhan - forthcoming - Journal of Logic and Computation.
    In this paper I will develop a lambda-term calculus, lambda-2Int, for a bi-intuitionistic logic and discuss its implications for the notions of sense and denotation of derivations in a bilateralist setting. Thus, I will use the Curry-Howard correspondence, which has been well-established between the simply typed lambda-calculus and natural deduction systems for intuitionistic logic, and apply it to a bilateralist proof system displaying two derivability relations, one for proving and one for refuting. The basis will be the natural deduction system (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  7. Categorical Quantification.Constantin C. Brîncuș - forthcoming - Bulletin of Symbolic Logic:1-27.
    Due to Gӧdel’s incompleteness results, the categoricity of a sufficiently rich mathematical theory and the semantic completeness of its underlying logic are two mutually exclusive ideals. For first- and second-order logics we obtain one of them with the cost of losing the other. In addition, in both these logics the rules of deduction for their quantifiers are non-categorical. In this paper I examine two recent arguments –Warren (2020), Murzi and Topey (2021)– for the idea that the natural deduction rules for (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  8. Inferential Quantification and the ω-rule.Constantin C. Brîncuș - forthcoming - In Antonio D’Aragona (ed.), Perspectives on Deduction.
    Logical inferentialism maintains that the formal rules of inference fix the meanings of the logical terms. The categoricity problem points out to the fact that the standard formalizations of classical logic do not uniquely determine the intended meanings of its logical terms, i.e., these formalizations are not categorical. This means that there are different interpretations of the logical terms that are consistent with the relation of logical derivability in a logical calculus. In the case of the quantificational logic, the categoricity (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  9. 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) (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  10. The Truth Table Formulation of Propositional Logic.Tristan Grøtvedt Haze - forthcoming - Teorema: International Journal of Philosophy.
    Developing a suggestion of Wittgenstein, I provide an account of truth tables as formulas of a formal language. I define the syntax and semantics of TPL (the language of Tabular Propositional Logic), and develop its proof theory. Single formulas of TPL, and finite groups of formulas with the same top row and TF matrix (depiction of possible valuations), are able to serve as their own proofs with respect to metalogical properties of interest. The situation is different, however, for groups of (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  11. Against Harmony.Ian Rumfitt - forthcoming - In Bob Hale, Crispin Wright & Alexander Miller (eds.), The Blackwell Companion to the Philosophy of Language. Blackwell.
    Many prominent writers on the philosophy of logic, including Michael Dummett, Dag Prawitz, Neil Tennant, have held that the introduction and elimination rules of a logical connective must be ‘in harmony ’ if the connective is to possess a sense. This Harmony Thesis has been used to justify the choice of logic: in particular, supposed violations of it by the classical rules for negation have been the basis for arguments for switching from classical to intuitionistic logic. The Thesis has also (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   3 citations  
  12. An Epistemic Interpretation of Paraconsistent Weak Kleene Logic.Damian E. Szmuc - forthcoming - Logic and Logical Philosophy:1.
    This paper extends Fitting's epistemic interpretation of some Kleene logics, to also account for Paraconsistent Weak Kleene logic. To achieve this goal, a dualization of Fitting's "cut-down" operator is discussed, rendering a "track-down" operator later used to represent the idea that no consistent opinion can arise from a set including an inconsistent opinion. It is shown that, if some reasonable assumptions are made, the truth-functions of Paraconsistent Weak Kleene coincide with certain operations defined in this track-down fashion. Finally, further reflections (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   10 citations  
  13. Base-extension Semantics for Modal Logic.Eckhardt Timo & Pym David - forthcoming - Logic Journal of the IGPL.
    In proof-theoretic semantics, meaning is based on inference. It may be seen as the mathematical expression of the inferentialist interpretation of logic. Much recent work has focused on base-extension semantics, in which the validity of formulas is given by an inductive definition generated by provability in a ‘base’ of atomic rules. Base-extension semantics for classical and intuitionistic propositional logic have been explored by several authors. In this paper, we develop base-extension semantics for the classical propositional modal systems K, KT , (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  14. 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 proof rules has (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  15. Epistemic Modals in Hypothetical Reasoning.Maria Aloni, Luca Incurvati & Julian J. Schlöder - 2023 - Erkenntnis 88 (8):3551-3581.
    Data involving epistemic modals suggest that some classically valid argument forms, such as _reductio_, are invalid in natural language reasoning as they lead to modal collapses. We adduce further data showing that the classical argument forms governing the existential quantifier are similarly defective, as they lead to a _de re–de dicto_ collapse. We observe a similar problem for disjunction. But if the classical argument forms for negation, disjunction and existential quantification are invalid, what are the correct forms that govern the (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  16. What are acceptable reductions? Perspectives from proof-theoretic semantics and type theory.Sara Ayhan - 2023 - Australasian Journal of Logic 20 (3):412-428.
    It has been argued that reduction procedures are closely connected to the question about identity of proofs and that accepting certain reductions would lead to a trivialization of identity of proofs in the sense that every derivation of the same conclusion would have to be identified. In this paper it will be shown that the question, which reductions we accept in our system, is not only important if we see them as generating a theory of proof identity but is also (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  17. The Non-Categoricity of Logic (II). Multiple-Conclusions and Bilateralist Logics (In Romanian).Constantin C. Brîncuș - 2023 - Probleme de Logică (Problems of Logic) (1):139-162.
    The categoricity problem for a system of logic reveals an asymmetry between the model-theoretic and the proof-theoretic resources of that logic. In particular, it reveals prima facie that the proof-theoretic instruments are insufficient for matching the envisaged model-theory, when the latter is already available. Among the proposed solutions for solving this problem, some make use of new proof-theoretic instruments, some others introduce new model-theoretic constrains on the proof-systems, while others try to use instruments from both sides. On the proof-theoretical side, (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  18. Coordination and Harmony in Bilateral Logic.Pedro del Valle-Inclan & Julian J. Schlöder - 2023 - Mind 132 (525):192-207.
    Ian Rumfitt (2000) developed a bilateralist account of logic in which the meaning of the connectives is given by conditions on asserted and rejected sentences. An additional set of inference rules, the coordination principles, determines the interaction of assertion and rejection. Fernando Ferreira (2008) found this account defective, as Rumfitt must state the coordination principles for arbitrary complex sentences. Rumfitt (2008) has a reply, but we argue that the problem runs deeper than he acknowledges and is in fact related to (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   3 citations  
  19. Supposition: A Problem for Bilateralism.Nils Kürbis - 2023 - Bulletin of the Section of Logic 53 (3):301-327.
    In bilateral logic formulas are signed by + and –, indicating the speech acts assertion and denial. I argue that making an assumption is also speech act. Speech acts cannot be embedded within other speech acts. Hence we cannot make sense of the notion of making an assumption in bilateral logic. Attempts to solve this problem are considered and rejected.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   3 citations  
  20. Synthetic proofs.Salman Panahy - 2023 - Synthese 201 (2):1-25.
    This is a contribution to the idea that some proofs in first-order logic are synthetic. Syntheticity is understood here in its classical geometrical sense. Starting from Jaakko Hintikka’s original idea and Allen Hazen’s insights, this paper develops a method to define the ‘graphical form’ of formulae in monadic and dyadic fraction of first-order logic. Then a synthetic inferential step in Natural Deduction is defined. A proof is defined as synthetic if it includes at least one synthetic inferential step. Finally, it (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  21. An Axiomatic System for Concessive Conditionals.Eric Raidl, Andrea Iacona & Vincenzo Crupi - 2023 - Studia Logica 1:1-21.
    According to the analysis of concessive conditionals suggested by Crupi and Iacona, a concessive conditional \(p{{\,\mathrm{\hookrightarrow }\,}}q\) is adequately formalized as a conjunction of conditionals. This paper presents a sound and complete axiomatic system for concessive conditionals so understood. The soundness and completeness proofs that will be provided rely on a method that has been employed by Raidl, Iacona, and Crupi to prove the soundness and completeness of an analogous system for evidential conditionals.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  22. Evitable iterates of the consistency operator.James Walsh - 2023 - Computability 12 (1):59--69.
    Why are natural theories pre-well-ordered by consistency strength? In previous work, an approach to this question was proposed. This approach was inspired by Martin's Conjecture, one of the most prominent conjectures in recursion theory. Fixing a reasonable subsystem $T$ of arithmetic, the goal was to classify the recursive functions that are monotone with respect to the Lindenbaum algebra of $T$. According to an optimistic conjecture, roughly, every such function must be equivalent to an iterate $\mathsf{Con}_T^\alpha$ of the consistency operator ``in (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  23. Epsilon theorems in intermediate logics.Matthias Baaz & Richard Zach - 2022 - Journal of Symbolic Logic 87 (2):682-720.
    Any intermediate propositional logic can be extended to a calculus with epsilon- and tau-operators and critical formulas. For classical logic, this results in Hilbert’s $\varepsilon $ -calculus. The first and second $\varepsilon $ -theorems for classical logic establish conservativity of the $\varepsilon $ -calculus over its classical base logic. It is well known that the second $\varepsilon $ -theorem fails for the intuitionistic $\varepsilon $ -calculus, as prenexation is impossible. The paper investigates the effect of adding critical $\varepsilon $ - (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  24. The Non-categoricity of Logic (I). The Problem of a Full Formalization (in Romanian).Constantin C. Brîncuș - 2022 - In Probleme de Logică (Problems of Logic). București, România: pp. 137-156.
    A system of logic usually comprises a language for which a model-theory and a proof-theory are defined. The model-theory defines the semantic notion of model-theoretic logical consequence (⊨), while the proof-theory defines the proof- theoretic notion of logical consequence (or logical derivability, ⊢). If the system in question is sound and complete, then the two notions of logical consequence are extensionally equivalent. The concept of full formalization is a more restrictive one and requires in addition the preservation of the standard (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  25. Inferential Constants.Camillo Fiore, Federico Pailos & Mariela Rubin - 2022 - Journal of Philosophical Logic 52 (3):767-796.
    A metainference is usually understood as a pair consisting of a collection of inferences, called premises, and a single inference, called conclusion. In the last few years, much attention has been paid to the study of metainferences—and, in particular, to the question of what are the valid metainferences of a given logic. So far, however, this study has been done in quite a poor language. Our usual sequent calculi have no way to represent, e.g. negations, disjunctions or conjunctions of inferences. (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  26. Metainferences from a Proof-Theoretic Perspective, and a Hierarchy of Validity Predicates.Rea Golan - 2022 - Journal of Philosophical Logic 51 (6):1295–1325.
    I explore, from a proof-theoretic perspective, the hierarchy of classical and paraconsistent logics introduced by Barrio, Pailos and Szmuc in (Journal o f Philosophical Logic,49, 93-120, 2021). First, I provide sequent rules and axioms for all the logics in the hierarchy, for all inferential levels, and establish soundness and completeness results. Second, I show how to extend those systems with a corresponding hierarchy of validity predicates, each one of which is meant to capture “validity” at a different inferential level. Then, (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   6 citations  
  27. 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 various (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  28. Epistemic Multilateral Logic.Luca Incurvati & Julian J. Schlöder - 2022 - Review of Symbolic Logic 15 (2):505-536.
    We present epistemic multilateral logic, a general logical framework for reasoning involving epistemic modality. Standard bilateral systems use propositional formulae marked with signs for assertion and rejection. Epistemic multilateral logic extends standard bilateral systems with a sign for the speech act of weak assertion (Incurvati and Schlöder 2019) and an operator for epistemic modality. We prove that epistemic multilateral logic is sound and complete with respect to the modal logic S5 modulo an appropriate translation. The logical framework developed provides the (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   10 citations  
  29. 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 (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  30. Two-sorted Frege Arithmetic is not Conservative.Stephen Mackereth & Jeremy Avigad - 2022 - Review of Symbolic Logic:1-34.
    Neo-Fregean logicists claim that Hume's Principle (HP) may be taken as an implicit definition of cardinal number, true simply by fiat. A longstanding problem for neo-Fregean logicism is that HP is not deductively conservative over pure axiomatic second-order logic. This seems to preclude HP from being true by fiat. In this paper, we study Richard Kimberly Heck's Two-sorted Frege Arithmetic (2FA), a variation on HP which has been thought to be deductively conservative over second-order logic. We show that it isn't. (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  31. The Logic of the Evidential Conditional.Eric Raidl, Andrea Iacona & Vincenzo Crupi - 2022 - Review of Symbolic Logic 15 (3):758-770.
    In some recent works, Crupi and Iacona have outlined an analysis of ‘if’ based on Chrysippus’ idea that a conditional holds whenever the negation of its consequent is incompatible with its antecedent. This paper presents a sound and complete system of conditional logic that accommodates their analysis. The soundness and completeness proofs that will be provided rely on a general method elaborated by Raidl, which applies to a wide range of systems of conditional logic.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   13 citations  
  32. Towards Tractable Approximations to Many-Valued Logics: the Case of First Degree Entailment.Alejandro Solares-Rojas & Marcello D’Agostino - 2022 - In Igor Sedlár (ed.), The Logica Yearbook 2021. College Publications. pp. 57-76.
    FDE is a logic that captures relevant entailment between implication-free formulae and admits of an intuitive informational interpretation as a 4-valued logic in which “a computer should think”. However, the logic is co-NP complete, and so an idealized model of how an agent can think. We address this issue by shifting to signed formulae where the signs express imprecise values associated with two distinct bipartitions of the set of standard 4 values. Thus, we present a proof system which consists of (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  33. Takeuti's well-ordering proofs revisited.Andrew Arana & Ryota Akiyoshi - 2021 - Mita Philosophy Society 3 (146):83-110.
    Gaisi Takeuti extended Gentzen's work to higher-order case in 1950's–1960's and proved the consistency of impredicative subsystems of analysis. He has been chiefly known as a successor of Hilbert's school, but we pointed out in the previous paper that Takeuti's aimed to investigate the relationships between "minds" by carrying out his proof-theoretic project rather than proving the "reliability" of such impredicative subsystems of analysis. Moreover, as briefly explained there, his philosophical ideas can be traced back to Nishida's philosophy in Kyoto's (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  34. Uniqueness of Logical Connectives in a Bilateralist Setting.Sara Ayhan - 2021 - In Martin Blicha & Igor Sedlár (eds.), The Logica Yearbook 2020. College Publications. pp. 1-16.
    In this paper I will show the problems that are encountered when dealing with uniqueness of connectives in a bilateralist setting within the larger framework of proof-theoretic semantics and suggest a solution. Therefore, the logic 2Int is suitable, for which I introduce a sequent calculus system, displaying - just like the corresponding natural deduction system - a consequence relation for provability as well as one dual to provability. I will propose a modified characterization of uniqueness incorporating such a duality of (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   4 citations  
  35. The Normalization Theorem for the First-Order Classical Natural Deduction with Disjunctive Syllogism.Seungrak Choi - 2021 - Korean Journal of Logic 2 (24):143-168.
    In the present paper, we prove the normalization theorem and the consistency of the first-order classical logic with disjunctive syllogism. First, we propose the natural deduction system SCD for classical propositional logic having rules for conjunction, implication, negation, and disjunction. The rules for disjunctive syllogism are regarded as the rules for disjunction. After we prove the normalization theorem and the consistency of SCD, we extend SCD to the system SPCD for the first-order classical logic with disjunctive syllogism. It can be (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  36. Display to Labeled Proofs and Back Again for Tense Logics.Agata Ciabattoni, Tim Lyon, Revantha Ramanayake & Alwen Tiu - 2021 - ACM Transactions on Computational Logic 22 (3):1-31.
    We introduce translations between display calculus proofs and labeled calculus proofs in the context of tense logics. First, we show that every derivation in the display calculus for the minimal tense logic Kt extended with general path axioms can be effectively transformed into a derivation in the corresponding labeled calculus. Concerning the converse translation, we show that for Kt extended with path axioms, every derivation in the corresponding labeled calculus can be put into a special form that is translatable to (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  37. One-Step Modal Logics, Intuitionistic and Classical, Part 2.Harold T. Hodes - 2021 - Journal of Philosophical Logic 50 (5):873-910.
    Part 1 [Hodes, 2021] “looked under the hood” of the familiar versions of the classical propositional modal logic K and its intuitionistic counterpart. This paper continues that project, addressing some familiar classical strengthenings of K and GL), and their intuitionistic counterparts. Section 9 associates two intuitionistic one-step proof-theoretic systems to each of the just mentioned intuitionistic logics, this by adding for each a new rule to those which generated IK in Part 1. For the systems associated with the intuitionistic counterparts (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  38. 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 presents (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  39. Meta-inferences and Supervaluationism.Luca Incurvati & Julian J. Schlöder - 2021 - Journal of Philosophical Logic 51 (6):1549-1582.
    Many classically valid meta-inferences fail in a standard supervaluationist framework. This allegedly prevents supervaluationism from offering an account of good deductive reasoning. We provide a proof system for supervaluationist logic which includes supervaluationistically acceptable versions of the classical meta-inferences. The proof system emerges naturally by thinking of truth as licensing assertion, falsity as licensing negative assertion and lack of truth-value as licensing rejection and weak assertion. Moreover, the proof system respects well-known criteria for the admissibility of inference rules. Thus, supervaluationists (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   3 citations  
  40. Mixed computation: grammar up and down the Chomsky Hierarchy.Diego Gabriel Krivochen - 2021 - Evolutionary Linguistic Theory 2 (3):215-244.
    Proof-theoretic models of grammar are based on the view that an explicit characterization of a language comes in the form of the recursive enumeration of strings in that language. That recur-sive enumeration is carried out by a procedure which strongly generates a set of structural de-scriptions Σ and weakly generates a set of strings S; a grammar is thus a function that pairs an element of Σ with elements of S. Structural descriptions are obtained by means of Context-Free phrase structure (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  41. Note on 'Normalisation for Bilateral Classical Logic with some Philosophical Remarks'.Nils Kürbis - 2021 - Journal of Applied Logics 7 (8):2259-2261.
    This brief note corrects an error in one of the reduction steps in my paper 'Normalisation for Bilateral Classical Logic with some Philosophical Remarks' published in the Journal of Applied Logics 8/2 (2021): 531-556.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  42. 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 be (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  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 implication. (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  44. 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 deductions (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  45. 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 (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   4 citations  
  46. 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, such as (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   4 citations  
  47. 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 explicitly incorporates the (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   3 citations  
  48. Nested Sequents for Intuitionistic Modal Logics via Structural Refinement.Tim Lyon - 2021 - In Anupam Das & Sara Negri (eds.), Automated Reasoning with Analytic Tableaux and Related Methods: TABLEAUX 2021. pp. 409-427.
    We employ a recently developed methodology -- called "structural refinement" -- to extract nested sequent systems for a sizable class of intuitionistic modal logics from their respective labelled sequent systems. This method can be seen as a means by which labelled sequent systems can be transformed into nested sequent systems through the introduction of propagation rules and the elimination of structural rules, followed by a notational translation. The nested systems we obtain incorporate propagation rules that are parameterized with formal grammars, (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  49. A Note on Paradoxical Propositions from an Inferential Point of View.Ivo Pezlar - 2021 - In Martin Blicha & Igor Sedlár (eds.), The Logica Yearbook 2020. College Publications. pp. 183-199.
    In a recent paper by Tranchini (Topoi, 2019), an introduction rule for the paradoxical proposition ρ∗ that can be simultaneously proven and disproven is discussed. This rule is formalized in Martin-Löf’s constructive type theory (CTT) and supplemented with an inferential explanation in the style of Brouwer-Heyting-Kolmogorov semantics. I will, however, argue that the provided formalization is problematic because what is paradoxical about ρ∗ from the viewpoint of CTT is not its provability, but whether it is a proposition at all.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  50. 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 allow double negation elimination (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
1 — 50 / 166