Nonstandard definability
From MaRDI portal
Publication:913793
DOI10.1016/0168-0072(89)90064-XzbMATH Open0701.03038OpenAlexW4213077106MaRDI QIDQ913793FDOQ913793
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
Other model constructions (03C30) Interpolation, preservation, definability (03C40) Models of arithmetic and set theory (03C62) Nonstandard models of arithmetic (03H15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Full Satisfaction Classes and Recursive Saturation
- Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
- An introduction to recursively saturated and resplendent models
- Construction of Satisfaction Classes for Nonstandard Models
- Peano models with many generic classes
- A Rather Classless Model
- Closure properties of countable non-standard integers
- Saturation and simple extensions of models of Peano arithmetic
- Nonstandard characterizations of recursive saturation and resplendency
- Extendible Sets in Peano Arithmetic
- Recursively saturated nonstandard models of arithmetic
Cited In (15)
- DISJUNCTIONS WITH STOPPING CONDITIONS
- Compositional truth with propositional tautologies and quantifier-free correctness
- Varieties of truth definitions
- Neutrally expandable models of arithmetic
- Title not available (Why is that?)
- An addition to Rosser's theorem
- MODEL THEORY AND PROOF THEORY OF THE GLOBAL REFLECTION PRINCIPLE
- Local collection and end-extensions of models of compositional truth
- Pathologies in satisfaction classes
- MODELS OF PT– WITH INTERNAL INDUCTION FOR TOTAL FORMULAE
- Full satisfaction classes, definability, and automorphisms
- A definable nonstandard enlargement
- Saturation properties for compositional truth with propositional correctness
- Models of weak theories of truth
- Condensable models of set theory
Recommendations
- Title not available (Why is that?) 👍 👎
- Definability and interpolation in non-classical logics 👍 👎
- A definable nonstandard enlargement 👍 👎
- Non-Deterministic Inductive Definitions and Fullness 👍 👎
- Undefinability of truth and nonstandard models 👍 👎
- Nonstandard models that are definable in models of Peano Arithmetic 👍 👎
- Nonstandard set theory 👍 👎
- The non-definability notion and first order logic 👍 👎
- Nonstandard set theory in \(\in\)-language 👍 👎
- Nonstandardness and the bounded functional interpretation 👍 👎
This page was built for publication: Nonstandard definability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q913793)
