Structural connections between a forcing class and its modal logic

DOI10.1007/S11856-015-1185-5MaRDI QIDQ498994zbMATH OpenOpenAlexFDO

Authors Joel David Hamkins, George Leibman, Benedikt Löwe

Publication date 29 September 2015

Published in Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1207.5841

zbMATH Keywords

forcingmodal logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Other aspects of forcing and Boolean-valued models (03E40)

Abstract: The modal logic of forcing arises when one considers a model of set theory in the context of all its forcing extensions, interpreting necessity as "in all forcing extensions" and possibility as "in some forcing extension". In this modal language one may easily express sweeping general forcing principles, such as the assertion that every possibly necessary statement is necessarily possible, which is valid for forcing, or the assertion that every possibly necessary statement is true, which is the maximality principle, a forcing axiom independent of but equiconsistent with ZFC (Stavi-V"a"an"anen, Hamkins). Every definable forcing class similarly gives rise to the corresponding forcing modalities, for which one considers extensions only by forcing notions in that class. In previous work, we proved that if ZFC is consistent, then the ZFC-provably valid principles of the class of all forcing are precisely the assertions of the modal theory S4.2. In this article, we prove that the provably valid principles of collapse forcing, Cohen forcing and other classes are in each case exactly S4.3; the provably valid principles of c.c.c. forcing, proper forcing, and others are each contained within S4.3 and do not contain S4.2; the provably valid principles of countably closed forcing, CH-preserving forcing and others are each exactly S4.2; and the provably valid principles of $omeg{a}_1$-preserving forcing are contained within S4.tBA. All these results arise from general structural connections we have identified between a forcing class and the modal logic of forcing to which it gives rise, including the connection between various control statements, such as buttons, switches and ratchets, and their corresponding forcing validities. These structural connections therefore support a forcing-only analysis of other diverse forcing classes.

Review text

Let \(\varphi(q_0,\ldots,q_n)\) be modal propositional formula. In [Trans. Am. Math. Soc. 360, No. 4, 1793--1817 (2008; Zbl 1139.03039)], \textit{J. D. Hamkins} and \textit{B. Löwe} defined \(\varphi(q_0,\ldots,q_n)\) to be a \textit{valid principle of forcing} if for all sentences \(\psi_i\) in the language of set theory, \(\varphi(\psi_i,\ldots,\psi_n)\) holds when the modal operators \(\square\) and \(\lozenge\) are interpreted as ``in all forcing extensions and ``in some forcing extension, respectively. Further, \(\varphi(q_0,\ldots,q_n)\) is said to be a ZFC-\textit{provable principle of forcing} if ZFC proves all substitution instances \(\varphi(\psi_i,\ldots,\psi_n)\). The main theorem of this earlier work is: If ZFC is consistent, then the ZFC-provable principles of forcing are exactly those in the modal theory \(S4.2\). In the current paper, for \(\Gamma\) a definable forcing class the modal operators \(\square\) and \(\lozenge\) are relativized to \(\Gamma\), i.e., \(\square_{\Gamma} \) and \(\lozenge_{\Gamma}\) are interpreted as ``in all \(\Gamma\) forcing extensions and ``in some \(\Gamma\) forcing extension, respectively. For various \(\Gamma\), the authors seek to identify which modal assertions are valid. Here are some sample results (always assuming that ZFC is consistent). The provably valid principles of collapse forcing and Cohen forcing are exactly \(S4.3\). The provably valid principles of c.c.c forcing and proper forcing are contained in \(S4.3\), but do not contain \(S4.2\). These results and others are achieved through the discovery of ``structural connections between a class of forcing notions and the modal logic of forcing to which it gives rise.

Recommendations

• The modal logic of forcing
• The complexity of the modal predicate logic of “true in every transitive model of ZF”
• The modal logic of inner models
• A simple maximality principle
• Fatal Heyting algebras and forcing persistent sentences

Cites work

• A simple maximality principle
• Closed maximality principles: implications, separations and combinations
• Combined Maximality Principles up to large cardinals
• Fatal Heyting algebras and forcing persistent sentences
• scientific article; zbMATH DE number 1003731 (Why is no real title available?)
• scientific article; zbMATH DE number 755666 (Why is no real title available?)
• scientific article; zbMATH DE number 1827959 (Why is no real title available?)
• Modal logic
• Moving up and down in the generic multiverse
• On forcing without the continuum hypothesis
• On the set-generic multiverse
• Set Theory
• The consistency strength of MP\(_{\text{CCC}}(\mathbb R )\)
• The decidability of the Kreisel-Putnam system
• The modal logic of forcing
• The Necessary Maximality Principle for c. c. c. forcing is equiconsistent with a weakly compact cardinal

Cited in

(19)

• Reflexive-insensitive logics, the boxdot translation, and the modal logic of generic absoluteness
• Set-theoretic geology
• The modal logic of inner models
• Fatal Heyting algebras and forcing persistent sentences
• THE MODAL LOGIC OF -CENTERED FORCING AND RELATED FORCING CLASSES
• THE MODAL LOGIC OF SET-THEORETIC POTENTIALISM AND THE POTENTIALIST MAXIMALITY PRINCIPLES
• On the modal logic of subset and superset: tense logic over Medvedev frames
• The modal logic of forcing
• Choiceless large cardinals and set‐theoretic potentialism
• The modal logic of abelian groups
• VARIETIES OF CLASS-THEORETIC POTENTIALISM
• Mathematical modality: an investigation in higher-order logic
• Modal model theory
• Modal and intermediate logics of spiked Boolean algebras
• The logic of logical necessity
• What is forcing potentialism?
• The modal logic of arithmetic potentialism and the universal algorithm
• The modal logic of abstraction refinement
• On modal logics of model-theoretic relations

This page was built for publication: Structural connections between a forcing class and its modal logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q498994)