Hostname: page-component-77c89778f8-cnmwb Total loading time: 0 Render date: 2024-07-17T12:06:56.689Z Has data issue: false hasContentIssue false
  • English
  • Français

Construction of Satisfaction Classes for Nonstandard Models

Published online by Cambridge University Press:  20 November 2018

H. Kotlarski ,
S. Krajewski  and
A. H. Lachlan
H. Kotlarski
Affiliation:
Simon Fraser University Burnaby2, B.C. V5A 1S6
S. Krajewski
Affiliation:
Simon Fraser University Burnaby2, B.C. V5A 1S6
A. H. Lachlan
Affiliation:
Simon Fraser University Burnaby2, B.C. V5A 1S6
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 24 , Issue 3 , 01 September 1981 , pp. 283 - 293
Copyright
Copyright © Canadian Mathematical Society 1981

References

1. Barwise, K. J.. Admissible Sets and Structures, Springer, Berlin 1975.Google Scholar
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. Geiser, J.. Nonstandard logic, J. Symb. Logi. 33 (1977), 236-250.Google Scholar
4. Kaufmann, M.. A rather classless model, Proc. American Math. Soc. 62 (1962), 330-333.Google Scholar
5. Krajewski, S.. Non-standard satisfaction classes, in Set theory and Hierarchy theory, Springer Lecture Notes No. 537, 1976, 121-145.Google Scholar
6. Makkai, M.. Admissible sets and infinitary logic, Handbook of Mathematical Logic, North- Holland, Amsterdam 1977, 233-281.Google Scholar
7. Moschovakis, Y. N.. Elementary Induction on Abstract Structures, North-Holland, Amsterdam 1974.Google Scholar
8. Robinson, A.. On languages based on non-standard arithmetic, Nagoya Math. J. 22 (1963), 83-107.Google Scholar