Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T02:33:46.707Z Has data issue: false hasContentIssue false

L(Q)-preservation theorems

Published online by Cambridge University Press:  12 March 2014

Jörg Flum*
Affiliation:
Mathematisches Institut der Albert-Ludwigs-Universität, 78 Freiburg, Germany

Extract

Much effort has been spent to prove that the reduced product operation preserves, and sometimes even strengthens the L-equivalence of structures, where L is some infinitary language. A similar result is suggested by the following well-known fact:

Assume D is a nonprincipal ultrafilter on ω and, for n Є ω, Cn is a set. If the ultra-product ΠωCn/D is infinite, it has a cardinality ≥ Hence, by Łos' theorem, (i) if and φ(x) is a first-order formula, then iff where Q is the unary quantifier “there are many.”

We shall prove some generalizations of (i). In particular, we show

(ii) if D is a nonprincipal ultrafilter over I = ω, and then where L(Q) is the language obtained from the first-order language by adding the quantifier Q.

(ii) remains true, if D is an ω-regular or an atomless filter over a set I.

Lipner [7] proved that if is regular, then the L(Q)-equivalence is preserved under direct products. We show that the assumption “ is regular” is necessary.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1975

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