Solovay's theorem cannot be simplified

DOI10.1016/S0168-0072(01)00095-1MaRDI QIDQ5945397zbMATH OpenFDO

Authors Andrew Arana

Publication date 24 January 2002

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0168-0072(01)00095-1

zbMATH Keywords

completions of Peano arithmeticindependence resultsindependent sentencenonstandard models of arithmeticScott setsSolovay family

Mathematics Subject Classification ID

Models of arithmetic and set theory (03C62) Other Turing degree structures (03D28) Nonstandard models of arithmetic (03H15)

Recommendations

• Injecting inconsistencies into models of PA
• Minimality and completions of PA
• Injecting inconsistencies into models of PA
• Two theorems on degrees of models of true arithmetic
• scientific article; zbMATH DE number 1531928

Cites work

• Computable structures and the hyperarithmetical hierarchy
• Degrees of Recursively Saturated Models
• scientific article; zbMATH DE number 3825809 (Why is no real title available?)
• scientific article; zbMATH DE number 51556 (Why is no real title available?)
• scientific article; zbMATH DE number 1226875 (Why is no real title available?)
• scientific article; zbMATH DE number 1531928 (Why is no real title available?)
• scientific article; zbMATH DE number 1405580 (Why is no real title available?)
• scientific article; zbMATH DE number 3316918 (Why is no real title available?)
• scientific article; zbMATH DE number 2236624 (Why is no real title available?)

Cited in

(2)

• Requirement systems
• Arithmetical independence results using higher recursion theory

This page was built for publication: Solovay's theorem cannot be simplified

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