Switch to: References

Add citations

You must login to add citations.
  1. Neo-Logicism and Its Logic.Panu Raatikainen - 2020 - History and Philosophy of Logic 41 (1):82-95.
    The rather unrestrained use of second-order logic in the neo-logicist program is critically examined. It is argued in some detail that it brings with it genuine set-theoretical existence assumptions and that the mathematical power that Hume’s Principle seems to provide, in the derivation of Frege’s Theorem, comes largely from the ‘logic’ assumed rather than from Hume’s Principle. It is shown that Hume’s Principle is in reality not stronger than the very weak Robinson Arithmetic Q. Consequently, only a few rudimentary facts (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Anything Goes.David Ripley - 2015 - Topoi 34 (1):25-36.
    This paper consider Prior's connective Tonk from a particular bilateralist perspective. I show that there is a natural perspective from which we can see Tonk and its ilk as perfectly well-defined pieces of vocabulary; there is no need for restrictions to bar things like Tonk.
    Download  
     
    Export citation  
     
    Bookmark   26 citations  
  • Computing interpolants in implicational logics.Makoto Kanazawa - 2006 - Annals of Pure and Applied Logic 142 (1):125-201.
    I present a new syntactical method for proving the Interpolation Theorem for the implicational fragment of intuitionistic logic and its substructural subsystems. This method, like Prawitz’s, works on natural deductions rather than sequent derivations, and, unlike existing methods, always finds a ‘strongest’ interpolant under a certain restricted but reasonable notion of what counts as an ‘interpolant’.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Does the deduction theorem fail for modal logic?Raul Hakli & Sara Negri - 2012 - Synthese 187 (3):849-867.
    Various sources in the literature claim that the deduction theorem does not hold for normal modal or epistemic logic, whereas others present versions of the deduction theorem for several normal modal systems. It is shown here that the apparent problem arises from an objectionable notion of derivability from assumptions in an axiomatic system. When a traditional Hilbert-type system of axiomatic logic is generalized into a system for derivations from assumptions, the necessitation rule has to be modified in a way that (...)
    Download  
     
    Export citation  
     
    Bookmark   32 citations  
  • Proof Theory for Modal Logic.Sara Negri - 2011 - Philosophy Compass 6 (8):523-538.
    The axiomatic presentation of modal systems and the standard formulations of natural deduction and sequent calculus for modal logic are reviewed, together with the difficulties that emerge with these approaches. Generalizations of standard proof systems are then presented. These include, among others, display calculi, hypersequents, and labelled systems, with the latter surveyed from a closer perspective.
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • Reasoning About Collectively Accepted Group Beliefs.Raul Hakli & Sara Negri - 2011 - Journal of Philosophical Logic 40 (4):531-555.
    A proof-theoretical treatment of collectively accepted group beliefs is presented through a multi-agent sequent system for an axiomatization of the logic of acceptance. The system is based on a labelled sequent calculus for propositional multi-agent epistemic logic with labels that correspond to possible worlds and a notation for internalized accessibility relations between worlds. The system is contraction- and cut-free. Extensions of the basic system are considered, in particular with rules that allow the possibility of operative members or legislators. Completeness with (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • A Buchholz Derivation System for the Ordinal Analysis of KP + Π₃-Reflection.Markus Michelbrink - 2006 - Journal of Symbolic Logic 71 (4):1237 - 1283.
    In this paper we introduce a notation system for the infinitary derivations occurring in the ordinal analysis of KP + Π₃-Reflection due to Michael Rathjen. This allows a finitary ordinal analysis of KP + Π₃-Reflection. The method used is an extension of techniques developed by Wilfried Buchholz, namely operator controlled notation systems for RS∞-derivations. Similarly to Buchholz we obtain a characterisation of the provably recursive functions of KP + Π₃-Reflection as <-recursive functions where < is the ordering on Rathjen's ordinal (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Axiomatizing Kripke’s Theory of Truth.Volker Halbach & Leon Horsten - 2006 - Journal of Symbolic Logic 71 (2):677 - 712.
    We investigate axiomatizations of Kripke's theory of truth based on the Strong Kleene evaluation scheme for treating sentences lacking a truth value. Feferman's axiomatization KF formulated in classical logic is an indirect approach, because it is not sound with respect to Kripke's semantics in the straightforward sense: only the sentences that can be proved to be true in KF are valid in Kripke's partial models. Reinhardt proposed to focus just on the sentences that can be proved to be true in (...)
    Download  
     
    Export citation  
     
    Bookmark   76 citations  
  • Proof theory in philosophy of mathematics.Andrew Arana - 2010 - Philosophy Compass 5 (4):336-347.
    A variety of projects in proof theory of relevance to the philosophy of mathematics are surveyed, including Gödel's incompleteness theorems, conservation results, independence results, ordinal analysis, predicativity, reverse mathematics, speed-up results, and provability logics.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Some weak fragments of {${\rm HA}$} and certain closure properties.Morteza Moniri & Mojtaba Moniri - 2002 - Journal of Symbolic Logic 67 (1):91-103.
    We show that Intuitionistic Open Induction iop is not closed under the rule DNS(∃ - 1 ). This is established by constructing a Kripke model of iop + $\neg L_y(2y > x)$ , where $L_y(2y > x)$ is universally quantified on x. On the other hand, we prove that iop is equivalent with the intuitionistic theory axiomatized by PA - plus the scheme of weak ¬¬LNP for open formulas, where universal quantification on the parameters precedes double negation. We also show (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Truth in a Logic of Formal Inconsistency: How classical can it get?Lavinia Picollo - 2020 - Logic Journal of the IGPL 28 (5):771-806.
    Weakening classical logic is one of the most popular ways of dealing with semantic paradoxes. Their advocates often claim that such weakening does not affect non-semantic reasoning. Recently, however, Halbach and Horsten have shown that this is actually not the case for Kripke’s fixed-point theory based on the Strong Kleene evaluation scheme. Feferman’s axiomatization $\textsf{KF}$ in classical logic is much stronger than its paracomplete counterpart $\textsf{PKF}$, not only in terms of semantic but also in arithmetical content. This paper compares the (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Absorbing the structural rules in the sequent calculus with additional atomic rules.Franco Parlamento & Flavio Previale - 2020 - Archive for Mathematical Logic 59 (3-4):389-408.
    We show that if the structural rules are admissible over a set \ of atomic rules, then they are admissible in the sequent calculus obtained by adding the rules in \ to the multisuccedent minimal and intuitionistic \ calculi as well as to the classical one. Two applications to pure logic and to the sequent calculus with equality are presented.
    Download  
     
    Export citation  
     
    Bookmark  
  • Generalisation of proof simulation procedures for Frege systems by M.L. Bonet and S.R. Buss.Daniil Kozhemiachenko - 2018 - Journal of Applied Non-Classical Logics 28 (4):389-413.
    ABSTRACTIn this paper, we present a generalisation of proof simulation procedures for Frege systems by Bonet and Buss to some logics for which the deduction theorem does not hold. In particular, we study the case of finite-valued Łukasiewicz logics. To this end, we provide proof systems and which augment Avron's Frege system HŁuk with nested and general versions of the disjunction elimination rule, respectively. For these systems, we provide upper bounds on speed-ups w.r.t. both the number of steps in proofs (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Aristotle, Logic, and QUARC.Jonas Raab - 2018 - History and Philosophy of Logic 39 (4):305-340.
    The goal of this paper is to present a new reconstruction of Aristotle's assertoric logic as he develops it in Prior Analytics, A1-7. This reconstruction will be much closer to Aristotle's original...
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • (1 other version)Reinhard Kahle and Michael Rathjen : Gentzen’s Centenary. The Quest for Consistency.David Binder - 2018 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 49 (3):475-479.
    Download  
     
    Export citation  
     
    Bookmark  
  • Representing conjunctive deductions by disjunctive deductions.Kosta Došen & Zoran Petrić - 2017 - Review of Symbolic Logic 10 (1):145-157.
    Download  
     
    Export citation  
     
    Bookmark  
  • Choosing Your Nonmonotonic Logic: A Shopper’s Guide.Ulf Hlobil - 2018 - In Pavel Arazim & Tomas Lavicka (eds.), The Logica Yearbook 2017. College Publications. pp. 109-123.
    The paper presents an exhaustive menu of nonmonotonic logics. The options are individuated in terms of the principles they reject. I locate, e.g., cumulative logics and relevance logics on this menu. I highlight some frequently neglected options, and I argue that these neglected options are particularly attractive for inferentialists.
    Download  
     
    Export citation  
     
    Bookmark  
  • Judgement aggregation in non-classical logics.Daniele Porello - 2017 - Journal of Applied Non-Classical Logics 27 (1-2):106-139.
    This work contributes to the theory of judgement aggregation by discussing a number of significant non-classical logics. After adapting the standard framework of judgement aggregation to cope with non-classical logics, we discuss in particular results for the case of Intuitionistic Logic, the Lambek calculus, Linear Logic and Relevant Logics. The motivation for studying judgement aggregation in non-classical logics is that they offer a number of modelling choices to represent agents’ reasoning in aggregation problems. By studying judgement aggregation in logics that (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Conditional Heresies.Fabrizio Cariani & Simon Goldstein - 2018 - Philosophy and Phenomenological Research (2):251-282.
    Philosophy and Phenomenological Research, EarlyView.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Naïve validity.Julien Murzi & Lorenzo Rossi - 2017 - Synthese 199 (Suppl 3):819-841.
    Beall and Murzi :143–165, 2013) introduce an object-linguistic predicate for naïve validity, governed by intuitive principles that are inconsistent with the classical structural rules. As a consequence, they suggest that revisionary approaches to semantic paradox must be substructural. In response to Beall and Murzi, Field :1–19, 2017) has argued that naïve validity principles do not admit of a coherent reading and that, for this reason, a non-classical solution to the semantic paradoxes need not be substructural. The aim of this paper (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • A Simple Sequent Calculus for Angell’s Logic of Analytic Containment.Rohan French - 2017 - Studia Logica 105 (5):971-994.
    We give a simple sequent calculus presentation of R.B. Angell’s logic of analytic containment, recently championed by Kit Fine as a plausible logic of partial content.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Subformula and separation properties in natural deduction via small Kripke models: Subformula and separation properties.Peter Milne - 2010 - Review of Symbolic Logic 3 (2):175-227.
    Various natural deduction formulations of classical, minimal, intuitionist, and intermediate propositional and first-order logics are presented and investigated with respect to satisfaction of the separation and subformula properties. The technique employed is, for the most part, semantic, based on general versions of the Lindenbaum and Lindenbaum–Henkin constructions. Careful attention is paid to which properties of theories result in the presence of which rules of inference, and to restrictions on the sets of formulas to which the rules may be employed, restrictions (...)
    Download  
     
    Export citation  
     
    Bookmark   10 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  
  • Completeness via correspondence for extensions of the logic of paradox.Barteld Kooi & Allard Tamminga - 2012 - Review of Symbolic Logic 5 (4):720-730.
    Taking our inspiration from modal correspondence theory, we present the idea of correspondence analysis for many-valued logics. As a benchmark case, we study truth-functional extensions of the Logic of Paradox (LP). First, we characterize each of the possible truth table entries for unary and binary operators that could be added to LP by an inference scheme. Second, we define a class of natural deduction systems on the basis of these characterizing inference schemes and a natural deduction system for LP. Third, (...)
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • The Stories of Logic and Information.Johan van Benthem, Maricarmen Martinez, David Israel & John Perry - unknown
    Information is a notion of wide use and great intuitive appeal, and hence, not surprisingly, different formal paradigms claim part of it, from Shannon channel theory to Kolmogorov complexity. Information is also a widely used term in logic, but a similar diversity repeats itself: there are several competing logical accounts of this notion, ranging from semantic to syntactic. In this chapter, we will discuss three major logical accounts of information.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • The logic of justification.Sergei Artemov - 2008 - Review of Symbolic Logic 1 (4):477-513.
    We describe a general logical framework, Justification Logic, for reasoning about epistemic justification. Justification Logic is based on classical propositional logic augmented by justification assertions t: F that read t is a justification for F. Justification Logic absorbs basic principles originating from both mainstream epistemology and the mathematical theory of proofs. It contributes to the studies of the well-known Justified True Belief vs. Knowledge problem. We state a general Correspondence Theorem showing that behind each epistemic modal logic, there is a (...)
    Download  
     
    Export citation  
     
    Bookmark   87 citations  
  • (1 other version)Admissibility of structural rules for contraction-free systems of intuitionistic logic.Roy Dyckhoff & Sara Negri - 2000 - Journal of Symbolic Logic 65 (4):1499-1518.
    We give a direct proof of admissibility of cut and contraction for the contraction-free sequent calculus G4ip for intuitionistic propositional logic and for a corresponding multi-succedent calculus: this proof extends easily in the presence of quantifiers, in contrast to other, indirect, proofs. i.e., those which use induction on sequent weight or appeal to admissibility of rules in other calculi.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Explicit provability and constructive semantics.Sergei N. Artemov - 2001 - Bulletin of Symbolic Logic 7 (1):1-36.
    In 1933 Godel introduced a calculus of provability (also known as modal logic S4) and left open the question of its exact intended semantics. In this paper we give a solution to this problem. We find the logic LP of propositions and proofs and show that Godel's provability calculus is nothing but the forgetful projection of LP. This also achieves Godel's objective of defining intuitionistic propositional logic Int via classical proofs and provides a Brouwer-Heyting-Kolmogorov style provability semantics for Int which (...)
    Download  
     
    Export citation  
     
    Bookmark   116 citations  
  • An ecumenical notion of entailment.Elaine Pimentel, Luiz Carlos Pereira & Valeria de Paiva - 2019 - Synthese 198 (S22):5391-5413.
    Much has been said about intuitionistic and classical logical systems since Gentzen’s seminal work. Recently, Prawitz and others have been discussing how to put together Gentzen’s systems for classical and intuitionistic logic in a single unified system. We call Prawitz’ proposal the Ecumenical System, following the terminology introduced by Pereira and Rodriguez. In this work we present an Ecumenical sequent calculus, as opposed to the original natural deduction version, and state some proof theoretical properties of the system. We reason that (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Infinitary Contraction‐Free Revenge.Andreas Fjellstad - 2018 - Thought: A Journal of Philosophy 7 (3):179-189.
    How robust is a contraction-free approach to the semantic paradoxes? This paper aims to show some limitations with the approach based on multiplicative rules by presenting and discussing the significance of a revenge paradox using a predicate representing an alethic modality defined with infinitary rules.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • A Multimodal Pragmatic Treatment of the Knowability Paradox.Massimiliano Carrara, Daniele Chiffi & Davide Sergio - 2017 - In Gillman Payette & Rafał Urbaniak (eds.), Applications of Formal Philosophy: The Road Less Travelled. Cham, Switzerland: Springer International Publishing AG. pp. 195-209.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Contraction, Infinitary Quantifiers, and Omega Paradoxes.Bruno Da Ré & Lucas Rosenblatt - 2018 - Journal of Philosophical Logic 47 (4):611-629.
    Our main goal is to investigate whether the infinitary rules for the quantifiers endorsed by Elia Zardini in a recent paper are plausible. First, we will argue that they are problematic in several ways, especially due to their infinitary features. Secondly, we will show that even if these worries are somehow dealt with, there is another serious issue with them. They produce a truth-theoretic paradox that does not involve the structural rules of contraction.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • On Formally Measuring and Eliminating Extraneous Notions in Proofs.Andrew Arana - 2009 - Philosophia Mathematica 17 (2):189-207.
    Many mathematicians and philosophers of mathematics believe some proofs contain elements extraneous to what is being proved. In this paper I discuss extraneousness generally, and then consider a specific proposal for measuring extraneousness syntactically. This specific proposal uses Gentzen's cut-elimination theorem. I argue that the proposal fails, and that we should be skeptical about the usefulness of syntactic extraneousness measures.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Natural Deduction Calculi and Sequent Calculi for Counterfactual Logics.Francesca Poggiolesi - 2016 - Studia Logica 104 (5):1003-1036.
    In this paper we present labelled sequent calculi and labelled natural deduction calculi for the counterfactual logics CK + {ID, MP}. As for the sequent calculi we prove, in a semantic manner, that the cut-rule is admissible. As for the natural deduction calculi we prove, in a purely syntactic way, the normalization theorem. Finally, we demonstrate that both calculi are sound and complete with respect to Nute semantics [12] and that the natural deduction calculi can be effectively transformed into the (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Intuitionistic hybrid logic.Torben Braüner & Valeria de Paiva - 2006 - Journal of Applied Logic 4 (3):231-255.
    Hybrid logics are a principled generalization of both modal logics and description logics, a standard formalism for knowledge representation. In this paper we give the first constructive version of hybrid logic, thereby showing that it is possible to hybridize constructive modal logics. Alternative systems are discussed, but we fix on a reasonable and well-motivated version of intuitionistic hybrid logic and prove essential proof-theoretical results for a natural deduction formulation of it. Our natural deduction system is also extended with additional inference (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Glivenko sequent classes in the light of structural proof theory.Sara Negri - 2016 - Archive for Mathematical Logic 55 (3-4):461-473.
    In 1968, Orevkov presented proofs of conservativity of classical over intuitionistic and minimal predicate logic with equality for seven classes of sequents, what are known as Glivenko classes. The proofs of these results, important in the literature on the constructive content of classical theories, have remained somehow cryptic. In this paper, direct proofs for more general extensions are given for each class by exploiting the structural properties of G3 sequent calculi; for five of the seven classes the results are strengthened (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Incomplete Symbols — Definite Descriptions Revisited.Norbert Gratzl - 2015 - Journal of Philosophical Logic 44 (5):489-506.
    We investigate incomplete symbols, i.e. definite descriptions with scope-operators. Russell famously introduced definite descriptions by contextual definitions; in this article definite descriptions are introduced by rules in a specific calculus that is very well suited for proof-theoretic investigations. That is to say, the phrase ‘incomplete symbols’ is formally interpreted as to the existence of an elimination procedure. The last section offers semantical tools for interpreting the phrase ‘no meaning in isolation’ in a formal way.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • (1 other version)Cut Elimination in the Presence of Axioms.Sara Negri & Jan Von Plato - 1998 - Bulletin of Symbolic Logic 4 (4):418-435.
    A way is found to add axioms to sequent calculi that maintains the eliminability of cut, through the representation of axioms as rules of inference of a suitable form. By this method, the structural analysis of proofs is extended from pure logic to free-variable theories, covering all classical theories, and a wide class of constructive theories. All results are proved for systems in which also the rules of weakening and contraction can be eliminated. Applications include a system of predicate logic (...)
    Download  
     
    Export citation  
     
    Bookmark   51 citations  
  • Atomic polymorphism.Fernando Ferreira & Gilda Ferreira - 2013 - Journal of Symbolic Logic 78 (1):260-274.
    It has been known for six years that the restriction of Girard's polymorphic system $\text{\bfseries\upshape F}$ to atomic universal instantiations interprets the full fragment of the intuitionistic propositional calculus. We firstly observe that Tait's method of “convertibility” applies quite naturally to the proof of strong normalization of the restricted Girard system. We then show that each $\beta$-reduction step of the full intuitionistic propositional calculus translates into one or more $\beta\eta$-reduction steps in the restricted Girard system. As a consequence, we obtain (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Deciding regular grammar logics with converse through first-order logic.Stéphane Demri & Hans De Nivelle - 2005 - Journal of Logic, Language and Information 14 (3):289-329.
    We provide a simple translation of the satisfiability problem for regular grammar logics with converse into GF2, which is the intersection of the guarded fragment and the 2-variable fragment of first-order logic. The translation is theoretically interesting because it translates modal logics with certain frame conditions into first-order logic, without explicitly expressing the frame conditions. It is practically relevant because it makes it possible to use a decision procedure for the guarded fragment in order to decide regular grammar logics with (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • The axiom of choice and combinatory logic.Andrea Cantini - 2003 - Journal of Symbolic Logic 68 (4):1091-1108.
    We combine a variety of constructive methods (including forcing, realizability, asymmetric interpretation), to obtain consistency results concerning combinatory logic with extensionality and (forms of) the axiom of choice.
    Download  
     
    Export citation  
     
    Bookmark  
  • Grounding principles for (relevant) implication.Francesca Poggiolesi - 2020 - Synthese 198 (8):7351-7376.
    Most of the logics of grounding that have so far been proposed contain grounding axioms, or grounding rules, for the connectives of conjunction, disjunction and negation, but little attention has been dedicated to the implication connective. The present paper aims at repairing this situation by proposing adequate grounding principles for relevant implication. Because of the interaction between negation and implication, new grounding principles concerning negation will also arise.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • A dialogical route to logical pluralism.Rohan French - 2019 - Synthese 198 (Suppl 20):4969-4989.
    This paper argues that adopting a particular dialogical account of logical consequence quite directly gives rise to an interesting form of logical pluralism, the form of pluralism in question arising out of the requirement that deductive proofs be explanatory.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Strong Normalization via Natural Ordinal.Daniel Durante Pereira Alves - 1999 - Dissertation,
    The main objective of this PhD Thesis is to present a method of obtaining strong normalization via natural ordinal, which is applicable to natural deduction systems and typed lambda calculus. The method includes (a) the definition of a numerical assignment that associates each derivation (or lambda term) to a natural number and (b) the proof that this assignment decreases with reductions of maximal formulas (or redex). Besides, because the numerical assignment used coincide with the length of a specific sequence of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • A cut-free sequent calculus for the logic od subset spaces.Birgit Elbl - 2016 - In Lev Beklemishev, Stéphane Demri & András Máté (eds.), Advances in Modal Logic, Volume 11. CSLI Publications. pp. 268-287.
    Download  
     
    Export citation  
     
    Bookmark  
  • Proof theory and constructive mathematics.Anne S. Troelstra - 1977 - In Jon Barwise (ed.), Handbook of mathematical logic. New York: North-Holland. pp. 973--1052.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Socratic Trees.Dorota Leszczyńska-Jasion, Mariusz Urbański & Andrzej Wiśniewski - 2013 - Studia Logica 101 (5):959-986.
    The method of Socratic proofs (SP-method) simulates the solving of logical problem by pure questioning. An outcome of an application of the SP-method is a sequence of questions, called a Socratic transformation. Our aim is to give a method of translation of Socratic transformations into trees. We address this issue both conceptually and by providing certain algorithms. We show that the trees which correspond to successful Socratic transformations—that is, to Socratic proofs—may be regarded, after a slight modification, as Gentzen-style proofs. (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Validity Concepts in Proof-theoretic Semantics.Peter Schroeder-Heister - 2006 - Synthese 148 (3):525-571.
    The standard approach to what I call “proof-theoretic semantics”, which is mainly due to Dummett and Prawitz, attempts to give a semantics of proofs by defining what counts as a valid proof. After a discussion of the general aims of proof-theoretic semantics, this paper investigates in detail various notions of proof-theoretic validity and offers certain improvements of the definitions given by Prawitz. Particular emphasis is placed on the relationship between semantic validity concepts and validity concepts used in normalization theory. It (...)
    Download  
     
    Export citation  
     
    Bookmark   59 citations  
  • Proof Complexity and Textual Cohesion.Eli Dresner - 2015 - Journal of Logic, Language and Information 24 (1):53-64.
    In the first section of this paper I define a set of measures for proof complexity, which combine measures in terms of length and space. In the second section these measures are generalized to the broader category of formal texts. In the third section of the paper I outline several applications of the proposed theory.
    Download  
     
    Export citation  
     
    Bookmark  
  • A decidable theory of type assignment.William R. Stirton - 2013 - Archive for Mathematical Logic 52 (5-6):631-658.
    This article investigates a theory of type assignment (assigning types to lambda terms) called ETA which is intermediate in strength between the simple theory of type assignment and strong polymorphic theories like Girard’s F (Proofs and types. Cambridge University Press, Cambridge, 1989). It is like the simple theory and unlike F in that the typability and type-checking problems are solvable with respect to ETA. This is proved in the article along with three other main results: (1) all primitive recursive functionals (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation