Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Stone's representation theorem for Boolean algebras

Known as: Boolean space, Stone's representation theorem, M. H. Stone's representation theorem 
In mathematics, Stone's representation theorem for Boolean algebras states that every Boolean algebra is isomorphic to a field of sets. The theorem… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
We prove a number of dualities between posets and (pseudo)bases of open sets in locally compact Hausdorff spaces. In particular… Expand
  • table 1
Is this relevant?
2016
2016
The study of Boolean algebras, has had a big impact on a variety of fields in mathematics. From functional analysis to other… Expand
Is this relevant?
2011
2011
The Stone Representation Theorem for Boolean Algebras, first proved by M. H. Stone in 1936 ([4]), states that every Boolean… Expand
Is this relevant?
2006
2006
In this paper we show that the Stone representation theorem for Boolean algebras can be generalized to combinatory algebras. In… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We prove a representation theorem for Boolean contact algebras which implies that the axioms for the region connection calculus… Expand
Is this relevant?
1999
1999
We use combinatorial methods and permutation groups to classify homogeneous boolean functions. The property of symmetry of a… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
We present a new representation for Boolean functions called Partitioned ROBDDs. In this representation we divide the Boolean… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
  • J. Gu
  • IEEE Trans. Knowl. Data Eng.
  • 1994
  • Corpus ID: 24083255
The satisfiability (SAT) problem is a fundamental problem in mathematical logic, inference, automated reasoning, VLSI engineering… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We propose a refinement of Kripke modal logic, and in particular of PDL (propostional dynamic logic) 
Is this relevant?
Highly Cited
1988
Highly Cited
1988
The Stone representation theorem for Boolean algebras gives us a finite set of equations axiomatizing the class of Boolean set… Expand
Is this relevant?