Voir la notice de l'article provenant de la source Cambridge University Press
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/}
}
[1] 1. Kotlarski, H., Krajewski, S., and Lachlan, A. H.. Construction of satisfaction classes for nonstandard models, this volume, pp. Google Scholar
[2] 2. Krajewski, S.. Non-standard satisfaction classes. Set Theory and Hierarchy Theory, Lecture Notes in Mathematics vol. 537, Springer, Berlin 1976, pp. 121-145. Google Scholar
[3] 3. MacDowell, R. and Specker, E., Modelle der Arithmetik, Infinitistic Methods, Panstwowe Wydawnictwo Naukowe, Warsaw 1961, pp. 257-263. Google Scholar
[4] 4. Schlipf, J.. Toward model theory through recursive saturation, J. Symb. Logi. 43 (1978), pp. 183-203. Google Scholar
Cité par Sources :