A Short Proof of Two Recently Discovered Independence Results Using Recursion Theoretic Methods
From MaRDI portal
Publication:4750638
DOI10.2307/2043364zbMath0512.03028OpenAlexW4231636067WikidataQ56138582 ScholiaQ56138582MaRDI QIDQ4750638
Publication date: 1983
Full work available at URL: https://doi.org/10.2307/2043364
Undecidability and degrees of sets of sentences (03D35) Second- and higher-order arithmetic and fragments (03F35) Hierarchies of computability and definability (03D55)
Related Items (22)
A survey of ordinal interpretations of type ɛ0 for termination of rewriting systems ⋮ How recent work in mathematical logic relates to the foundations of mathematics ⋮ A MATHEMATICAL COMMITMENT WITHOUT COMPUTATIONAL STRENGTH ⋮ An independence result for \((\Pi^ 1_ 1-CA)+BI\) ⋮ Ordinal recursive bounds for Higman's theorem ⋮ Goodstein sequences for prominent ordinals up to the Bachmann-Howard ordinal ⋮ A new proof-theoretic proof of the independence of Kirby-Paris' hydra theorem. ⋮ A characterisation of multiply recursive functions with Higman's lemma. ⋮ Predicatively unprovable termination of the Ackermannian Goodstein process ⋮ A WALK WITH GOODSTEIN ⋮ Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations ⋮ Unnamed Item ⋮ Ordinal complexity of recursive definitions ⋮ Unprovable combinatorial statements ⋮ Die another day ⋮ Independence of Ramsey theorem variants using $\varepsilon _0$ ⋮ An Unprovable Ramsey-Type Theorem ⋮ INTERRELATION BETWEEN WEAK FRAGMENTS OF DOUBLE NEGATION SHIFT AND RELATED PRINCIPLES ⋮ GOODSTEIN SEQUENCES BASED ON A PARAMETRIZED ACKERMANN–PÉTER FUNCTION ⋮ Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results ⋮ Partitioning 𝛼–large sets: Some lower bounds ⋮ New formally undecidable propositions: Non-trivial lower bounds on proof complexity and related theorems
Cites Work
This page was built for publication: A Short Proof of Two Recently Discovered Independence Results Using Recursion Theoretic Methods
