Accessible Independence Results for Peano Arithmetic
From MaRDI portal
Publication:3966112
DOI10.1112/blms/14.4.285zbMath0501.03017WikidataQ29302821 ScholiaQ29302821MaRDI QIDQ3966112
Jeffrey Bruce Paris, Laurence Kirby
Publication date: 1982
Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/blms/14.4.285
03F30: First-order arithmetic and fragments
03H15: Nonstandard models of arithmetic
03C62: Models of arithmetic and set theory
Related Items
A modified sentence unprovable in PA, Completeness and categoricity: Frege, gödel and model theory, 2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '02, Ranked partial structures, Extensions of arithmetic for proving termination of computations, Logical dreams, A Short Proof of Two Recently Discovered Independence Results Using Recursion Theoretic Methods, On Transfinite Knuth-Bendix Orders, Goodstein sequences for prominent ordinals up to the Bachmann-Howard ordinal, On Gödel incompleteness and finite combinatorics, Independence results in formal topology, Degrees of relative provability, The Hydra battle and Cichon's principle, Some nonstandard Ramsey like applications, Some uses of dilators in combinatorial problems. III: Independence results by means of decreasing F-sequences (F weakly finite dilator), Too naturalist and not naturalist enough: Reply to Horsten, Phase transitions for Gödel incompleteness, How recent work in mathematical logic relates to the foundations of mathematics, An independence result for \((\Pi^ 1_ 1-CA)+BI\), Termination of rewriting, Note on a proof of the extended Kirby-Paris theorem on labelled finite trees, Ordinal recursive bounds for Higman's theorem, What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory, Unprovable combinatorial statements, Set theory -- from Cantor's heaven to the first theory among equals, Reverse mathematics and its meaning, A new proof-theoretic proof of the independence of Kirby-Paris' hydra theorem., Total termination of term rewriting, The first-order syntax of variadic functions, Die another day, A comparison of well-known ordinal notation systems for \(\varepsilon _{0}\), On understanding understanding, Another Use of Set Theory, Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees, An Unprovable Ramsey-Type Theorem
