Undefinability of truth and nonstandard models
DOI10.1016/J.APAL.2003.10.011zbMATH Open1063.03021OpenAlexW2007908701MaRDI QIDQ598273FDOQ598273
Authors: Roman Kossak 
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
Recommendations
First-order arithmetic and fragments (03F30) Models of arithmetic and set theory (03C62) Nonstandard models of arithmetic (03H15) Nonstandard arithmetic (number-theoretic aspects) (11U10) Nonstandard arithmetic and field theory (12L15)
Cites Work
- Some applications of the notions of forcing and generic sets
- Classical recursion theory. Vol. II
- Full satisfaction classes: A survey
- Minimal satisfaction classes with an application to rigid models of Peano arithmetic
- Four problems concerning recursively saturated models of arithmetic
- A certain class of models of Peano arithmetic
- Title not available (Why is that?)
- Forcing and Models of Arithmetic
- A Rather Classless Model
- Other Proofs of Old Results
- Discernible elements in models for Peano arithmetic
- On Languages Which are Based on Non-Standard Arithmetic
Cited In (8)
- Title not available (Why is that?)
- The concept of truth in a finite universe
- The incompleteness theorems after 70 years
- On the ‘definability of definable’ problem of Alfred Tarski, Part II
- Nonstandard definability
- Undecidability in Anti-Realism
- Undefinability vs. definability of satisfaction and truth
- Modeling unicorns and dead cats: applying Bressan's \(\mathrm{ML}^\nu\) to the necessary properties of non-existent objects
This page was built for publication: Undefinability of truth and nonstandard models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q598273)
