Construction of Satisfaction Classes for Nonstandard Models

Abstract

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.