Full satisfaction classes: A survey (Q1182694): Difference between revisions

Via arithmetization of the language of PA, if \(M\) is a model of PA, a full satisfaction class \(S\) for \(M\) (shortly FSC) is a notion of truth for sentences in the sense of \(M\) --- including nonstandard ones. Hence \(S\subseteq\text{Sent}^ M\) and \(S\) satisfies the usual Tarski conditions, for instance \((\neg\varphi)\in S\) iff \(\varphi\not\in S\), and \(\exists x\varphi\in S\) iff for some \(m\), \(\varphi(S^ m(0))\in S\). The paper surveys --- without proofs --- the main results regarding this notion (existence or non-existence of FSC; number of FSC's for a given \(M\)) and related notions (e.g. about the theory PA(\(S\)) = PA + ``\(S\) is an FSC'').