Solovay's theorem cannot be simplified

DOI10.1016/S0168-0072(01)00095-1zbMath0986.03051MaRDI QIDQ5945397

Andrew Arana

Publication date: 24 January 2002

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

zbMATH Keywords

completions of Peano arithmeticindependence resultsindependent sentencenonstandard models of arithmeticScott setsSolovay family

Mathematics Subject Classification ID

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

Related Items (1)

Arithmetical independence results using higher recursion theory

Cites Work

• Computable structures and the hyperarithmetical hierarchy
• Degrees of Recursively Saturated Models
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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