Nonstandard definability

DOI10.1016/0168-0072(89)90064-XzbMath0701.03038MaRDI QIDQ913793

Stuart T. Smith

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

zbMATH Keywords

nonstandard model; first order arithmetic; recursively saturated models; overspill; satisfaction class

Mathematics Subject Classification ID

03H15: Nonstandard models of arithmetic

03C62: Models of arithmetic and set theory

03C40: Interpolation, preservation, definability

03C30: Other model constructions

Related Items

An addition to Rosser's theorem, DISJUNCTIONS WITH STOPPING CONDITIONS, Neutrally expandable models of arithmetic, MODELS OF PT^– WITH INTERNAL INDUCTION FOR TOTAL FORMULAE, MODEL THEORY AND PROOF THEORY OF THE GLOBAL REFLECTION PRINCIPLE, Pathologies in satisfaction classes, 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

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