Full Satisfaction Classes and Recursive Saturation
Canadian mathematical bulletin, Tome 24 (1981) no. 3, pp. 295-297
Voir la notice de l'article provenant de la source Cambridge
It is shown that a nonstandard model of Peano arithmetic which has a full satisfaction class is necessarily recursively saturated.
Lachlan, A. H. Full Satisfaction Classes and Recursive Saturation. Canadian mathematical bulletin, Tome 24 (1981) no. 3, pp. 295-297. doi: 10.4153/CMB-1981-046-0
@article{10_4153_CMB_1981_046_0,
author = {Lachlan, A. H.},
title = {Full {Satisfaction} {Classes} and {Recursive} {Saturation}},
journal = {Canadian mathematical bulletin},
pages = {295--297},
year = {1981},
volume = {24},
number = {3},
doi = {10.4153/CMB-1981-046-0},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1981-046-0/}
}
Cité par Sources :