Boolean valued semantics for infinitary logics

Abstract

It is well known that the completeness theorem for Lω1ω fails with respect to Tarski semantics. Mansfield showed that it holds for L∞∞ if one replaces Tarski semantics with boolean valued semantics. We use forcing to improve his result in order to obtain a stronger form of boolean completeness (but only for L∞ω). Leveraging on our completeness result, we establish the Craig interpolation property and a strong version of the omitting types theorem for L∞ω with respect to boolean valued semantics. We also show that a weak version of these results holds for L∞∞ (if one leverages instead on Mansfield's completeness theorem). Furthermore we bring to light (or in some cases just revive) several connections between the infinitary logic L∞ω and the forcing method in set theory.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…