Boolean valued semantics for infinitary logics
From MaRDI portal
Abstract: It is well known that the completeness theorem for fails with respect to Tarski semantics. Mansfield showed that it holds for 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 ). Leveraging on our completeness result, we establish the Craig interpolation property and a strong version of the omitting types theorem for with respect to boolean valued semantics. We also show that a weak version of these results holds for (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 and the forcing method in set theory.
Cites work
- scientific article; zbMATH DE number 5853298 (Why is no real title available?)
- scientific article; zbMATH DE number 797413 (Why is no real title available?)
- scientific article; zbMATH DE number 3206304 (Why is no real title available?)
- Martin's maximum\(^{++}\) implies Woodin's axiom \((*)\)
- Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
- On the model theory of denumerably long formulas with finite strings of quantifiers
- Set Theory
- Set theory. An introduction to independence proofs
- Subcomplete forcing and \(\mathcal{L}\)-forcing
- The completeness theorem for infinitary logic
Cited in
(3)
This page was built for publication: Boolean valued semantics for infinitary logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6073912)