Nonstandard definability
From MaRDI portal
Publication:913793
DOI10.1016/0168-0072(89)90064-XzbMath0701.03038OpenAlexW4213077106MaRDI QIDQ913793
Publication date: 1989
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-0072(89)90064-x
Nonstandard models of arithmetic (03H15) Models of arithmetic and set theory (03C62) Interpolation, preservation, definability (03C40) Other model constructions (03C30)
Related Items (13)
Condensable models of set theory ⋮ Full satisfaction classes, definability, and automorphisms ⋮ Models of weak theories of truth ⋮ Local collection and end-extensions of models of compositional truth ⋮ MODEL THEORY AND PROOF THEORY OF THE GLOBAL REFLECTION PRINCIPLE ⋮ Neutrally expandable models of arithmetic ⋮ Compositional truth with propositional tautologies and quantifier-free correctness ⋮ Pathologies in satisfaction classes ⋮ An addition to Rosser's theorem ⋮ Varieties of truth definitions ⋮ MODELS OF PT– WITH INTERNAL INDUCTION FOR TOTAL FORMULAE ⋮ Saturation properties for compositional truth with propositional correctness ⋮ DISJUNCTIONS WITH STOPPING CONDITIONS
Cites Work
- Unnamed Item
- Unnamed Item
- Saturation and simple extensions of models of Peano arithmetic
- Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
- Peano models with many generic classes
- Nonstandard characterizations of recursive saturation and resplendency
- Extendible Sets in Peano Arithmetic
- Closure properties of countable non-standard integers
- Construction of Satisfaction Classes for Nonstandard Models
- Full Satisfaction Classes and Recursive Saturation
- Recursively saturated nonstandard models of arithmetic
- An introduction to recursively saturated and resplendent models
- A Rather Classless Model
This page was built for publication: Nonstandard definability
