DOI: 10.1112/jlms.70654 ISSN: 0024-6107

The Boolean compactness theorem for L∞∞

Juan M. Santiago Suárez, Matteo Viale

Abstract

We show that, contrary to the commonly held view, there is a natural and optimal compactness theorem for which generalizes the usual compactness theorem for first‐order logic. The key to this result is the switch from Tarski semantics to Boolean‐valued semantics. On the way to prove it, we also show that the latter is a (the?) natural semantics both for and for .

More from our Archive