Geodesic
Construction of Satisfaction Classes for Nonstandard Models
Canadian mathematical bulletin, Tome 24 (1981) no. 3, pp. 283-293

Voir la notice de l'article provenant de la source Cambridge University Press

Given a resplendent model for Peano arithmetic there exists a full satisfaction class over , i.e. an assignment of truth-values, to all closed formulas in the sense of with parameters from , which satisfies the usual semantic rules. The construction is based on the consistency of an appropriate system of -logic which is proved by an analysis of standard approximations of nonstandard formulas. 
Kotlarski, H.; Krajewski, S.; Lachlan, A. H. Construction of Satisfaction Classes for Nonstandard Models. Canadian mathematical bulletin, Tome 24 (1981) no. 3, pp. 283-293. doi: 10.4153/CMB-1981-045-3
@article{10_4153_CMB_1981_045_3,
     author = {Kotlarski, H. and Krajewski, S. and Lachlan, A. H.},
     title = {Construction of {Satisfaction} {Classes} for {Nonstandard} {Models}},
     journal = {Canadian mathematical bulletin},
     pages = {283--293},
     year = {1981},
     volume = {24},
     number = {3},
     doi = {10.4153/CMB-1981-045-3},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1981-045-3/}
}
TY  - JOUR
AU  - Kotlarski, H.
AU  - Krajewski, S.
AU  - Lachlan, A. H.
TI  - Construction of Satisfaction Classes for Nonstandard Models
JO  - Canadian mathematical bulletin
PY  - 1981
SP  - 283
EP  - 293
VL  - 24
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1981-045-3/
DO  - 10.4153/CMB-1981-045-3
ID  - 10_4153_CMB_1981_045_3
ER  - 
%0 Journal Article
%A Kotlarski, H.
%A Krajewski, S.
%A Lachlan, A. H.
%T Construction of Satisfaction Classes for Nonstandard Models
%J Canadian mathematical bulletin
%D 1981
%P 283-293
%V 24
%N 3
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1981-045-3/
%R 10.4153/CMB-1981-045-3
%F 10_4153_CMB_1981_045_3

[1] 1. Barwise, K. J.. Admissible Sets and Structures, Springer, Berlin 1975. Google Scholar

[2] 2. Barwise, K. J. and Schlipf, J.. An introduction to recursively saturated and resplendent models, J. Symb. Logi. 41 (1976), 531-536. Google Scholar

[3] 3. Geiser, J.. Nonstandard logic, J. Symb. Logi. 33 (1977), 236-250. Google Scholar

[4] 4. Kaufmann, M.. A rather classless model, Proc. American Math. Soc. 62 (1962), 330-333. Google Scholar

[5] 5. Krajewski, S.. Non-standard satisfaction classes, in Set theory and Hierarchy theory, Springer Lecture Notes No. 537, 1976, 121-145. Google Scholar

[6] 6. Makkai, M.. Admissible sets and infinitary logic, Handbook of Mathematical Logic, North- Holland, Amsterdam 1977, 233-281. Google Scholar

[7] 7. Moschovakis, Y. N.. Elementary Induction on Abstract Structures, North-Holland, Amsterdam 1974. Google Scholar

[8] 8. Robinson, A.. On languages based on non-standard arithmetic, Nagoya Math. J. 22 (1963), 83-107. Google Scholar

Cité par Sources :