Minimality and completions of PA

DOI10.2307/2695117zbMATH Open0989.03066OpenAlexW2015393409MaRDI QIDQ2758069

J. Knight

Publication date: 14 July 2002

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2695117

zbMATH Keywords

nonstandard modelsScott setsTuring degrees

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) First-order arithmetic and fragments (03F30) Nonstandard models of arithmetic (03H15) Models of arithmetic and set theory (03C62) Other Turing degree structures (03D28)

Cites Work

• Computable structures and the hyperarithmetical hierarchy
• Degrees coded in jumps of orderings
• Hilbert's Tenth Problem is Unsolvable

Related Items (5)

Boolean algebras, Stone spaces, and the iterated Turing jump ⋮ Understanding PPA-completeness ⋮ Minimal proper interval completions ⋮ Minimal split completions ⋮ Understanding PPA-completeness

This page was built for publication: Minimality and completions of PA

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2758069)