Pages that link to "Item:Q3966138"
From MaRDI portal
The following pages link to Recursively saturated nonstandard models of arithmetic (Q3966138):
Displayed 17 items.
- Nonstandard definability (Q913793) (← links)
- Automorphisms of recursively saturated models of arithmetic (Q1182432) (← links)
- Fixed points of self-embeddings of models of arithmetic (Q1709680) (← links)
- Automorphisms of countable recursively saturated models of PA: A survey (Q1913626) (← links)
- Set theoretical analogues of the Barwise-Schlipf theorem (Q2159934) (← links)
- Unifying the model theory of first-order and second-order arithmetic via \(\mathrm{WKL}_0^\ast\) (Q2400502) (← links)
- T-EQUIVALENCES FOR POSITIVE SENTENCES (Q3094190) (← links)
- The Complexity of Classification Problems for Models of Arithmetic (Q3163661) (← links)
- Degrees of Recursively Saturated Models (Q3222194) (← links)
- On cofinal extensions of models of arithmetic (Q3322105) (← links)
- A certain class of models of Peano arithmetic (Q3659779) (← links)
- Models of the alternative set theory (Q3689181) (← links)
- Some remarks on initial segments in models of Peano arithmetic (Q3691674) (← links)
- Extendible Sets in Peano Arithmetic (Q3832550) (← links)
- Neutrally expandable models of arithmetic (Q5108857) (← links)
- The Barwise-Schlipf theorem (Q5146566) (← links)
- MODELS OF POSITIVE TRUTH (Q5381034) (← links)