scientific article
From MaRDI portal
Publication:3682484
zbMath0567.03029MaRDI QIDQ3682484
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
proof theorydefinable subsetsinductionmodels of arithmeticRamsey's theoremsubsystems of Peano arithmeticformalization of recursion theoretic methods
First-order arithmetic and fragments (03F30) Nonstandard models of arithmetic (03H15) Models of arithmetic and set theory (03C62) Hierarchies of computability and definability (03D55)
Related Items (8)
The proof-theoretic strength of Ramsey's theorem for pairs and two colors ⋮ Unifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\) ⋮ On Extensions of Models of Strong Fragments of Arithmetic ⋮ A note on standard systems and ultrafilters ⋮ On some formalized conservation results in arithmetic ⋮ Intrinsic reasoning about functional programs. II: Unipolar induction and primitive-recursion ⋮ Schmerl decompositions in first order arithmetic ⋮ Subsets of models of arithmetic
This page was built for publication:
