Accessible Independence Results for Peano Arithmetic
From MaRDI portal
Publication:3966112
DOI10.1112/blms/14.4.285zbMath0501.03017OpenAlexW2081739832WikidataQ29302821 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
First-order arithmetic and fragments (03F30) Nonstandard models of arithmetic (03H15) Models of arithmetic and set theory (03C62)
Related Items (73)
A survey of ordinal interpretations of type ɛ0 for termination of rewriting systems ⋮ Zeno, Hercules, and the Hydra ⋮ How recent work in mathematical logic relates to the foundations of mathematics ⋮ Trees, ordinals and termination ⋮ A comparison of well-known ordinal notation systems for \(\varepsilon _{0}\) ⋮ Logical dreams ⋮ Open problems in rewriting ⋮ Problems in rewriting III ⋮ An independence result for \((\Pi^ 1_ 1-CA)+BI\) ⋮ Termination of rewriting ⋮ Nichtbeweisbarkeit von gewissen kombinatorischen Eigenschaften endlicher Bäume;Unprovability of certain combinatorial properties of finite trees ⋮ On some slowly terminating term rewriting systems ⋮ Note on a proof of the extended Kirby-Paris theorem on labelled finite trees ⋮ Total termination of term rewriting ⋮ Dominating the Erdős-Moser theorem in reverse mathematics ⋮ Unnamed Item ⋮ Ordinal recursive bounds for Higman's theorem ⋮ A Short Proof of Two Recently Discovered Independence Results Using Recursion Theoretic Methods ⋮ The first-order syntax of variadic functions ⋮ Goodstein sequences for prominent ordinals up to the Bachmann-Howard ordinal ⋮ A modified sentence unprovable in PA ⋮ A new proof-theoretic proof of the independence of Kirby-Paris' hydra theorem. ⋮ The Π21$\Pi ^1_2$ consequences of a theory ⋮ Predicatively unprovable termination of the Ackermannian Goodstein process ⋮ A WALK WITH GOODSTEIN ⋮ Unnamed Item ⋮ Some uses of dilators in combinatorial problems. III: Independence results by means of decreasing F-sequences (F weakly finite dilator) ⋮ Independence results in formal topology ⋮ On understanding understanding ⋮ Classical System of Martin-Löf’s Inductive Definitions Is Not Equivalent to Cyclic Proof System ⋮ Upper bounds on positional Paris-Harrington games ⋮ Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017 ⋮ Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations ⋮ What's so special about Kruskal's theorem and the ordinal \(\Gamma{}_ 0\)? A survey of some results in proof theory ⋮ Complexity among the finitely generated subgroups of Thompson's group ⋮ Ackermann and Goodstein go functorial ⋮ Unnamed Item ⋮ Completeness and categoricity: Frege, gödel and model theory ⋮ Too naturalist and not naturalist enough: Reply to Horsten ⋮ Ranked partial structures ⋮ Unprovable combinatorial statements ⋮ Degrees of relative provability ⋮ The scope of Gödel's first incompleteness theorem ⋮ Die another day ⋮ On Gödel incompleteness and finite combinatorics ⋮ Independence of Ramsey theorem variants using $\varepsilon _0$ ⋮ An Unprovable Ramsey-Type Theorem ⋮ On Transfinite Knuth-Bendix Orders ⋮ INTERRELATION BETWEEN WEAK FRAGMENTS OF DOUBLE NEGATION SHIFT AND RELATED PRINCIPLES ⋮ Unnamed Item ⋮ 2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '02 ⋮ Laver's results and low-dimensional topology ⋮ The Hydra battle and Cichon's principle ⋮ CURRENT RESEARCH ON GÖDEL’S INCOMPLETENESS THEOREMS ⋮ GOODSTEIN SEQUENCES BASED ON A PARAMETRIZED ACKERMANN–PÉTER FUNCTION ⋮ Pure \(\Sigma_2\)-elementarity beyond the core ⋮ Phase transitions for Gödel incompleteness ⋮ Unnamed Item ⋮ Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent ⋮ A metasemantic challenge for mathematical determinacy ⋮ $$P\mathop{ =}\limits^{?}NP$$ ⋮ Set theory -- from Cantor's heaven to the first theory among equals ⋮ Extensions of arithmetic for proving termination of computations ⋮ Unnamed Item ⋮ INDUCTIVE COMPLEXITY MEASURES FOR MATHEMATICAL PROBLEMS ⋮ Another Use of Set Theory ⋮ Gödel, Gentzen, Goodstein: the magic sound of a G-string ⋮ Some nonstandard Ramsey like applications ⋮ A Glimpse of $$ \sum_{3} $$-elementarity ⋮ Reverse mathematics and its meaning ⋮ Ackermannian Goodstein sequences of intermediate growth ⋮ On the structure of the degrees of relative provability ⋮ An ordinal calculus for proving termination in term rewriting
This page was built for publication: Accessible Independence Results for Peano Arithmetic
