Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-17T06:53:07.941Z Has data issue: false hasContentIssue false

Scott's interpolation theorem fails for Lω1, ω

Published online by Cambridge University Press:  12 March 2014

Henry Africk*
Affiliation:
New York City Community College, Brooklyn, New York 11201

Extract

In [1] we proved the following interpolation theorem for first-order (finitary) logic:

Theorem (Scott). Let A and B be sentences. There is an -sentence C such that A → C and C → B iff whenever and are -isomorphic structures and satisfies A then satisfies B.

We show here that the Theorem holds for A and B in Lω1, ω only if we permit the interpolant C to be in L(2ω)+, ω, where (2ω)+ is the successor of 2ω.

Our language contains the usual logical symbols and the relation symbols Ri, is i ∈ J. IfI ⊆ J define an I-sentence to be a sentence containing only relations with subscripts in I. If define an -sentence to be a boolean combination of I-sentences with , i.e., a sentence consisting of I-sentences, for various I's in , joined together by ∨, ∧ and ⌝; e.g., ∀xR1(x) ∨ ∀xR2(x)is a{{1}, {2}}-sentence but ∀x(R1(x) ∨ R2(x)) is not. If is a structure let , be the structure obtained by restricting to just the relations with subscripts in I. We say that is -isomorphic to if is isomorphic to for each .

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1974

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable