A model theoretic proof of Feferman's preservation theorem (Q1059066): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:26, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A model theoretic proof of Feferman's preservation theorem |
scientific article |
Statements
A model theoretic proof of Feferman's preservation theorem (English)
0 references
1984
0 references
Generalizing the definition of end extension to an arbitrary binary relation, one obtains the notion of faithful extension. Using proof- theoretical methods, Feferman characterized the set of formulas preserved under faithful extensions. Feferman's theorem was subsequently proved by Stern and Guichard using model-theoretic forcing and consistency properties, respectively. The author provides one more model-theoretic proof, using recursive saturation.
0 references
recursively saturated model
0 references
end extension
0 references
faithful extension
0 references
recursive saturation
0 references
