Satisfaction is not absolute
Abstract
We prove that the satisfaction relation N[ a] of first-order logic is not absolute between models of set theory having the structure N and the formulas all in common. Two models of set theory can have the same natural numbers, for example, and the same standard model of arithmetic ,+,·,0,1,, yet disagree on their theories of arithmetic truth; two models of set theory can have the same natural numbers and the same arithmetic truths, yet disagree on their truths-about-truth, at any desired level of the iterated truth-predicate hierarchy; two models of set theory can have the same natural numbers and the same reals, yet disagree on projective truth; two models of set theory can have the same Hω2,∈ or the same rank-initial segment Vδ,∈, yet disagree on which assertions are true in these structures. On the basis of these mathematical results, we argue that a philosophical commitment to the determinateness of the theory of truth for a structure cannot be seen as a consequence solely of the determinateness of the structure in which that truth resides. The determinate nature of arithmetic truth, for example, is not a consequence of the determinate nature of the arithmetic structure N=\0,1,2,…\ itself, but rather, we argue, is an additional higher-order commitment requiring its own analysis and justification.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.