Undefinability of truth and nonstandard models
From MaRDI portal
Publication:598273
DOI10.1016/j.apal.2003.10.011zbMath1063.03021MaRDI QIDQ598273
Publication date: 6 August 2004
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2003.10.011
03F30: First-order arithmetic and fragments
03H15: Nonstandard models of arithmetic
03C62: Models of arithmetic and set theory
11U10: Nonstandard arithmetic (number-theoretic aspects)
12L15: Nonstandard arithmetic and field theory
Related Items
On the ‘definability of definable’ problem of Alfred Tarski, Part II, The incompleteness theorems after 70 years
Cites Work
- Unnamed Item
- Full satisfaction classes: A survey
- Minimal satisfaction classes with an application to rigid models of Peano arithmetic
- Classical recursion theory. Vol. II
- Four problems concerning recursively saturated models of arithmetic
- A certain class of models of Peano arithmetic
- Forcing and Models of Arithmetic
- A Rather Classless Model
- Other Proofs of Old Results
- Discernible elements in models for Peano arithmetic
- Some applications of the notions of forcing and generic sets
- On Languages Which are Based on Non-Standard Arithmetic