Switch to: Citations

Add references

You must login to add references.
  1. Models of transfinite provability logic.David Fernández-Duque & Joost J. Joosten - 2013 - Journal of Symbolic Logic 78 (2):543-561.
    For any ordinal $\Lambda$, we can define a polymodal logic $\mathsf{GLP}_\Lambda$, with a modality $[\xi]$ for each $\xi < \Lambda$. These represent provability predicates of increasing strength. Although $\mathsf{GLP}_\Lambda$ has no Kripke models, Ignatiev showed that indeed one can construct a Kripke model of the variable-free fragment with natural number modalities, denoted $\mathsf{GLP}^0_\omega$. Later, Icard defined a topological model for $\mathsf{GLP}^0_\omega$ which is very closely related to Ignatiev's. In this paper we show how to extend these constructions for arbitrary $\Lambda$. (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Fragments of Arithmetic and true sentences.Andrés Cordón-Franco, Alejandro Fernández-Margarit & F. Félix Lara-Martín - 2005 - Mathematical Logic Quarterly 51 (3):313-328.
    By a theorem of R. Kaye, J. Paris and C. Dimitracopoulos, the class of the Πn+1-sentences true in the standard model is the only consistent Πn+1-theory which extends the scheme of induction for parameter free Πn+1-formulas. Motivated by this result, we present a systematic study of extensions of bounded quantifier complexity of fragments of first-order Peano Arithmetic. Here, we improve that result and show that this property describes a general phenomenon valid for parameter free schemes. As a consequence, we obtain (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • On Provability Logics with Linearly Ordered Modalities.Lev D. Beklemishev, David Fernández-Duque & Joost J. Joosten - 2014 - Studia Logica 102 (3):541-566.
    We introduce the logics GLP Λ, a generalization of Japaridze’s polymodal provability logic GLP ω where Λ is any linearly ordered set representing a hierarchy of provability operators of increasing strength. We shall provide a reduction of these logics to GLP ω yielding among other things a finitary proof of the normal form theorem for the variable-free fragment of GLP Λ and the decidability of GLP Λ for recursive orderings Λ. Further, we give a restricted axiomatization of the variable-free fragment (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Finitism.W. W. Tait - 1981 - Journal of Philosophy 78 (9):524-546.
    Download  
     
    Export citation  
     
    Bookmark   118 citations  
  • Systems of predicative analysis.Solomon Feferman - 1964 - Journal of Symbolic Logic 29 (1):1-30.
    This paper is divided into two parts. Part I provides a resumé of the evolution of the notion of predicativity. Part II describes our own work on the subject.Part I§1. Conceptions of sets.Statements about sets lie at the heart of most modern attempts to systematize all (or, at least, all known) mathematics. Technical and philosophical discussions concerning such systematizations and the underlying conceptions have thus occupied a considerable portion of the literature on the foundations of mathematics.
    Download  
     
    Export citation  
     
    Bookmark   118 citations  
  • Factorization of polynomials and °1 induction.S. G. Simpson - 1986 - Annals of Pure and Applied Logic 31:289.
    Download  
     
    Export citation  
     
    Bookmark   36 citations  
  • The polytopologies of transfinite provability logic.David Fernández-Duque - 2014 - Archive for Mathematical Logic 53 (3-4):385-431.
    Provability logics are modal or polymodal systems designed for modeling the behavior of Gödel’s provability predicate and its natural extensions. If Λ is any ordinal, the Gödel-Löb calculus GLPΛ contains one modality [λ] for each λ < Λ, representing provability predicates of increasing strength. GLPω has no non-trivial Kripke frames, but it is sound and complete for its topological semantics, as was shown by Icard for the variable-free fragment and more recently by Beklemishev and Gabelaia for the full logic. In (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Provability algebras and proof-theoretic ordinals, I.Lev D. Beklemishev - 2004 - Annals of Pure and Applied Logic 128 (1-3):103-123.
    We suggest an algebraic approach to proof-theoretic analysis based on the notion of graded provability algebra, that is, Lindenbaum boolean algebra of a theory enriched by additional operators which allow for the structure to capture proof-theoretic information. We use this method to analyze Peano arithmetic and show how an ordinal notation system up to 0 can be recovered from the corresponding algebra in a canonical way. This method also establishes links between proof-theoretic ordinal analysis and the work which has been (...)
    Download  
     
    Export citation  
     
    Bookmark   29 citations  
  • Church's thesis, continuity, and set theory.M. Beeson & A. Ščedrov - 1984 - Journal of Symbolic Logic 49 (2):630-643.
    Under the assumption that all "rules" are recursive (ECT) the statement $\operatorname{Cont}(N^N,N)$ that all functions from N N to N are continuous becomes equivalent to a statement KLS in the language of arithmetic about "effective operations". Our main result is that KLS is underivable in intuitionistic Zermelo-Fraenkel set theory + ECT. Similar results apply for functions from R to R and from 2 N to N. Such results were known for weaker theories, e.g. HA and HAS. We extend not only (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • (1 other version)Induction rules, reflection principles, and provably recursive functions.Lev D. Beklemishev - 1997 - Annals of Pure and Applied Logic 85 (3):193-242.
    A well-known result states that, over basic Kalmar elementary arithmetic EA, the induction schema for ∑n formulas is equivalent to the uniform reflection principle for ∑n + 1 formulas . We show that fragments of arithmetic axiomatized by various forms of induction rules admit a precise axiomatization in terms of reflection principles as well. Thus, the closure of EA under the induction rule for ∑n formulas is equivalent to ω times iterated ∑n reflection principle. Moreover, for k < ω, k (...)
    Download  
     
    Export citation  
     
    Bookmark   31 citations  
  • On strong provability predicates and the associated modal logics.Konstantin N. Ignatiev - 1993 - Journal of Symbolic Logic 58 (1):249-290.
    PA is Peano Arithmetic. Pr(x) is the usual Σ1-formula representing provability in PA. A strong provability predicate is a formula which has the same properties as Pr(·) but is not Σ1. An example: Q is ω-provable if PA + ¬ Q is ω-inconsistent (Boolos [4]). In [5] Dzhaparidze introduced a joint provability logic for iterated ω-provability and obtained its arithmetical completeness. In this paper we prove some further modal properties of Dzhaparidze's logic, e.g., the fixed point property and the Craig (...)
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • (2 other versions)Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems.G. Kreisel & A. Lévy - 1968 - Mathematical Logic Quarterly 14 (7-12):97-142.
    Download  
     
    Export citation  
     
    Bookmark   69 citations  
  • The optimality of induction as an axiomatization of arithmetic.Daniel Leivant - 1983 - Journal of Symbolic Logic 48 (1):182-184.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • (2 other versions)Reflection Principles and Their Use for Establishing the Complexity of Axiomatic Systems.Georg Kreisel & Azriel Lévy - 1968 - Zeitschrift für Mathematische Logic Und Grundlagen der Mathematik 14 (1):97--142.
    Download  
     
    Export citation  
     
    Bookmark   61 citations  
  • The Logic of Provability.Philip Scowcroft - 1995 - Philosophical Review 104 (4):627.
    This is a book that every enthusiast for Gödel’s proofs of his incompleteness theorems will want to own. It gives an up-to-date account of connections between systems of modal logic and results on provability in formal systems for arithmetic, analysis, and set theory.
    Download  
     
    Export citation  
     
    Bookmark   41 citations  
  • (1 other version)Systems of predicative analysis, II: Representations of ordinals.Solomon Feferman - 1968 - Journal of Symbolic Logic 33 (2):193-220.
    Download  
     
    Export citation  
     
    Bookmark   25 citations