Boolean-valued models
Generated by GPT-5-miniExpansion Funnel Raw 53 → Dedup 0 → NER 0 → Enqueued 0
| Boolean-valued models | |
|---|---|
| Name | Boolean-valued models |
| Field | Mathematical logic |
| Introduced | 1960s |
| Founder | Paul Cohen, Dana Scott, Robert Solovay |
| Notable applications | Independence results, forcing, models of Zermelo–Fraenkel set theory, Boolean ultrapowers |
| Related concepts | Boolean algebra, forcing notion, complete Boolean algebra, ultrafilter |
Boolean-valued models are semantic structures in mathematical logic that assign truth values from a complete Boolean algebra rather than the two truth values of classical Aristotlen propositional logic. Developed in the wake of Paul Cohen's work on the Continuum hypothesis and independence, they provide an algebraic framework connecting models of Zermelo–Fraenkel set theory with notions from abstract algebra and topology. Boolean-valued models generalize ultrapower and forcing constructions and have been used by researchers such as Dana Scott, Robert Solovay, and Kenneth Kunen to obtain refined independence and consistency results.
Introduction
The concept arose during efforts to analyze independence phenomena like the Continuum hypothesis and the Axiom of Choice. Early contributors include Paul Cohen, Dana Scott, and Robert Solovay, who linked forcing from Harvard University and Princeton University traditions to algebraic semantics. Boolean-valued models replace classical two-valued semantics with truth values drawn from a complete Boolean algebra often built from a forcing notion; this idea intersects historical threads from George Boole's algebra, John von Neumann's work on set theory, and later formal developments by logicians at institutions such as University of California, Berkeley and MIT.
Construction of Boolean-valued Models
A Boolean-valued model is built by assigning to each atomic formula a value in a complete Boolean algebra B associated with a forcing notion, frequently a complete Boolean algebra of regular open sets in a topological space like Cantor space or Baire space. Foundationally, constructions follow patterns introduced by Dana Scott and formalized by Robert Solovay and John Bell (mathematician), using recursive definitions of B-valued names (sometimes called B-names) analogous to the von Neumann universe V. Given a complete Boolean algebra B, one forms the class of B-names and defines evaluation so that each formula φ has a Boolean value ||φ||_B in B; truth in a Boolean-valued model corresponds to the top element 1_B. Ultrafilters on B, particularly {\it V}-generic ultrafilters associated to forcing conditions studied by Paul Cohen and refined by Saharon Shelah, yield classical two-valued models via Boolean ultrapower or Boolean-valued collapse techniques.
Relation to Forcing and Independence Proofs
Boolean-valued models provide an algebraic rendering of forcing as introduced by Paul Cohen in the 1960s. Forcing notions often produce complete Boolean algebras whose regular open algebra captures the forcing partial order; this connection was elucidated in work by Dana Scott, Robert Solovay, and later by Kenneth Kunen and Thomas Jech. Independence proofs about statements such as the Continuum hypothesis, the Axiom of Choice, and combinatorial principles like Martin's axiom are commonly phrased using Boolean-valued semantics: one constructs a Boolean-valued model where a target sentence attains a Boolean value below 1_B, then extracts a classical model using a V-generic ultrafilter reflecting the desired independence phenomenon. Results by Paul Erdős, Kurt Gödel, and Solomon Feferman shaped broader understanding of relative consistency that Boolean-valued models make explicit.
Properties and Examples
Classical examples include Boolean-valued models built from complete Boolean algebras associated with forcing notions such as Cohen forcing, Random forcing, and Prikry forcing developed by Kurt Gödel successors including Jack Silver and W. Hugh Woodin. Specific constructions yield models where cardinal arithmetic statements or combinatorial principles differ from their values in the ground model, paralleling constructions by Robert Solovay for measurable cardinals and by Paul Cohen for cardinal collapse. Technical properties studied by Kenneth Kunen, Thomas Jech, and Jech include the mixing lemma, fullness, and the relation between Boolean-valued satisfaction and classical satisfaction after forcing with V-generic ultrafilters. Boolean ultrapowers and Boolean ultrapower embeddings, connected to work by Eliott Mendelson and later by Kanamori, provide further concrete examples linking large cardinal hypotheses with Boolean-valued semantics.
Applications in Set Theory and Logic
Boolean-valued models serve as tools in independence proofs, the study of large cardinals such as Measurable cardinals and Woodin cardinals, and the analysis of the Axiom of Choice. Researchers at institutions like Institute for Advanced Study and CNRS used these models to examine definability, absoluteness, and reflection principles; contributors include W. Hugh Woodin, Saharon Shelah, and Menachem Magidor. Boolean-valued techniques interface with descriptive set theory results by Donald A. Martin and Yuri L. Ershov, and with determinacy investigations connected to Solovay and Wadge hierarchy studies. They also inform model-theoretic constructions such as Boolean ultrapowers that mirror classical Łoś's theorem behavior in two-valued ultrapower contexts studied by Alfred Tarski successors.
Category-theoretic and Topos Perspectives
Category-theoretic reformulations connect Boolean-valued models with internal logic of topoi, a program influenced by William Lawvere and F. William Lawvere's collaborators, and with sheaf-theoretic models studied by Saunders Mac Lane and Ieke Moerdijk. Boolean-valued semantics can be seen as internal models in a topos of sheaves over a Stone space dual to a Boolean algebra; this viewpoint ties to duality results of Marshall Stone and to investigations by Johnstone on locales and frames. Connections to categorical logic, geometric morphisms, and internal locales have been developed by researchers at University of Cambridge and Institut des Hautes Études Scientifiques, linking Boolean-valued techniques with broader topos-theoretic frameworks used by Alexander Grothendieck descendants investigating logical and geometric cohesion.