scispace - formally typeset
Open AccessBook

Set Theory: Boolean-Valued Models and Independence Proofs

John L. Bell
TLDR
In this paper, the authors present a list of problems with Boolean and Heyting algebra-valued models: first steps, forcing and some independent proofs, group actions on V(B) and the Independence of the Axiom of Choice, generic Ultrafilters and Transitive Models of ZFC.
Abstract
Foreword Preface List of Problems 0 Boolean and Heyting Algebras: The Essentials 1 Boolean-Valued Models: First Steps 2 Forcing and Some Independece Proofs 3 Group Actions on V(B) and the Independence of the Axiom of Choice 4 Generic Ultrafilters and Transitive Models of ZFC 5 Cardinal Collapsing, Boolean Isomorphism and Applications to the Theory of Boolean Algebras 6 Iterated Boolean Extensions, Martin's Axiom and Souslin's Hypothesis 7 Boolean-Valued Analysis 8 Intuitionistic Set Theory and Heyting-Algebra-Valued Models Appendix Boolean- and Heyting-Algebra-Valued Models as Categories Historical Notes Bibliography Index of Symbols Index of Terms

read more

Citations
More filters
Journal ArticleDOI

Transfinite cardinals in paraconsistent set theory

TL;DR: To underwrite cardinal arithmetic, the axiom of choice is proved and a new proof of Cantor’s theorem is provided, as well as a method for demonstrating the existence of large cardinals by way of a reflection theorem.
Journal ArticleDOI

The algebra of conditional sets and the concepts of conditional topology and compactness

TL;DR: In this article, the concepts of a conditional set, a conditional inclusion relation and a conditional Cartesian product are introduced, and the resulting conditional set theory is sufficiently rich in order to construct a conditional topology, conditional real and functional analysis indicating the possibility of a mathematical discourse based on conditional sets.
Book ChapterDOI

Logic for Artificial Intelligence: A Rasiowa–Pawlak School Perspective

TL;DR: A great importance in the studies of the Rasiowa–Pawlak school is assigned to the search for optimal tools for reasoning about complex vague concepts, construction of knowledge representation systems, reasoning about knowledge as well as for the application of logics in learning, communication, perception, planning, action, cooperation, and competition.
Journal ArticleDOI

Generalized algebra-valued models of set theory

TL;DR: A model of a paraconsistent logic that validates all axioms of the negation-free fragment of Zermelo-Fraenkel set theory is shown.
Posted Content

A beginner's guide to forcing

Timothy Y. Chow
- 01 Jan 2008 - 
TL;DR: In this article, an expository paper aimed at the reader without much background in set theory or logic, gives an overview of Cohen's proof (via forcing) of the independence of the continuum hypothesis.