scientific article

zbMath0442.03042MaRDI QIDQ3884109

Jeffrey Bruce Paris, Laurence Kirby

Publication date: 1978

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

end extensionsinduction axiomcollection axiomfirst order Peano arithmetic

Mathematics Subject Classification ID

Nonstandard models of arithmetic (03H15)

Related Items

Factorization of polynomials and \(\Sigma ^ 0_ 1\) induction ⋮ The prime number theorem and fragments of PA ⋮ Binary models generated by their tally part ⋮ A Conservation Result Concerning Bounded Theories and the Collection Axiom ⋮ Iterated trees and fragments of arithmetic ⋮ Models of arithmetic and categories with finiteness conditions ⋮ Reverse mathematical bounds for the termination theorem ⋮ The proof-theoretic strength of Ramsey's theorem for pairs and two colors ⋮ Hindman's theorem for sums along the full binary tree, \(\Sigma^0_2\)-induction and the pigeonhole principle for trees ⋮ The metamathematics of Stable Ramsey’s Theorem for Pairs ⋮ \(\Sigma_ 2\) induction and infinite injury priority arguments. II. Tame \(\Sigma_ 2\) coding and the jump operator ⋮ The theory of \(\kappa\)-like models of arithmetic ⋮ Unifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\) ⋮ Transfinite induction within Peano arithmetic ⋮ On Extensions of Models of Strong Fragments of Arithmetic ⋮ On the strength of Ramsey's theorem for trees ⋮ End extending models of set theory via power admissible covers ⋮ Bounded finite set theory ⋮ König's lemma, weak König's lemma, and the decidable fan theorem ⋮ Primitive recursive reverse mathematics ⋮ ANOTHER LOOK AT THE SECOND INCOMPLETENESS THEOREM ⋮ Weak and strong versions of effective transfinite recursion ⋮ End extensions of models of fragments of \(\mathrm{PA}\) ⋮ Tanaka's theorem revisited ⋮ \(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs ⋮ Fixed points of self-embeddings of models of arithmetic ⋮ Inductive full satisfaction classes ⋮ Algebraic combinatorics in bounded induction ⋮ \(\Delta_{2}\) degrees without \(\Sigma_{1}\) induction ⋮ On axiom schemes for \(T\)-provably \(\Delta_1\) formulas ⋮ A sharpened version of McAloon's theorem on initial segments of models of \(I\Delta_ 0\) ⋮ Peano arithmetic as axiomatization of the time frame in logics of programs and in dynamic logics ⋮ \(\Sigma_2\) induction and infinite injury priority arguments. III: Prompt sets, minimal pairs and Shoenfield's conjecture ⋮ Sub-arithmetical ultrapowers: A survey ⋮ Diophantine induction ⋮ R.e. Prime powers and total rigidity ⋮ Chain conditions in computable rings ⋮ On some formalized conservation results in arithmetic ⋮ The degree of a \(\Sigma_ n\) cut ⋮ The atomic model theorem and type omitting ⋮ Fragments of arithmetic ⋮ Hyperhypersimple sets and \(\Delta _ 2\) systems ⋮ Schmerl decompositions in first order arithmetic ⋮ On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness ⋮ Ultrafilters and types on models of arithmetic