A note on satisfaction classes
Satisfaction classes \(S_ 1\), \(S_ 2\) on a model M are called elementarily equivalent (isomorphic) if the structures \((M,S_ 1)\), \((M,S_ 2)\) are elementarily equivalent (isomorphic). It is shown that for every countable, recursively saturated model of arithmetic M there are continuum many pairwise non elementarily equivalent inductive satisfaction classes on M, also for every inductive satisfaction class S on M there are continuum many pairwise nonisomorphic satisfaction classes on M which are elementary equivalent to S. An application to constructions of many nonisormorphic pairs of recursively saturated models of arithmetic is given.
- Full satisfaction classes: A survey
- On cofinal submodels and elementary interstices
- Full satisfaction classes, definability, and automorphisms
- Satisfaction classes via cut elimination
- A note on the variety of satisfaction classes
- scientific article; zbMATH DE number 3933064 (Why is no real title available?)
- Models with the ω-property
- Elementary cuts in saturated models of Peano arithmetic
- GAME APPROXIMATIONS OF SATISFACTION CLASSES MODELS
- Satisfaction relations for proper classes: applications in logic and set theory
- Abstract satisfaction
- Inductive full satisfaction classes
This page was built for publication: A note on satisfaction classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2266714)
