Nonstandard definability (Q913793): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q455764 |
Changed an Item |
||
Property / reviewed by | |||
Property / reviewed by: Peter Clote / rank | |||
Normal rank |
Revision as of 02:33, 15 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Nonstandard definability |
scientific article |
Statements
Nonstandard definability (English)
0 references
1989
0 references
Let S be a satisfaction class for the model M of first order arithmetic. The paper under review studies properties of S-definable subsets of M - those subsets which are definable possibly by a non-standard formula, where ``truth'' is interpreted relative to the satisfaction class S. The author shows that the S-definable subsets of M always include a class which defines satisfaction for standard formulas. It follows that there exist recursively saturated models having no full satisfaction classes. The author uses non-standard extensions of overspill and of recursive saturation to show various results concerning S-definability - for instance, it is shown that if \(A\subseteq M\), then the expansion (M,A) is recursively saturated iff there is a full satisfaction class S for M such that A is S-definable.
0 references
nonstandard model
0 references
satisfaction class
0 references
first order arithmetic
0 references
recursively saturated models
0 references
overspill
0 references