Completeness Theorems, Incompleteness Theorems and Models of Arithmetic
From MaRDI portal
Publication:4168612
DOI10.2307/1997856zbMath0388.03028OpenAlexW4237774508MaRDI QIDQ4168612
Publication date: 1978
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1997856
Nonstandard models of arithmetic (03H15) Categoricity and completeness of theories (03C35) Other model constructions (03C30) Diophantine equations (11D99) Nonstandard arithmetic (number-theoretic aspects) (11U10)
Related Items (11)
The metamathematics of Stable Ramsey’s Theorem for Pairs ⋮ Arithmetic analogues of McAloon's unique Rosser sentences ⋮ Unifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\) ⋮ Overspill and fragments of arithmetic ⋮ The small‐is‐very‐small principle ⋮ P, NP, Co-NP and weak systems of arithmetic ⋮ The inductive strength of Ramsey's theorem for pairs ⋮ On end extensions of models of subsystems of Peano arithmetic ⋮ A list of arithmetical structures complete with respect to the first-order definability ⋮ Connected components of graphs and reverse mathematics ⋮ HIERARCHICAL INCOMPLETENESS RESULTS FOR ARITHMETICALLY DEFINABLE EXTENSIONS OF FRAGMENTS OF ARITHMETIC
This page was built for publication: Completeness Theorems, Incompleteness Theorems and Models of Arithmetic
