OurBigBook About$ Donate
 Sign in Sign up

Double-negation Boolean algebra (B={p∈P(1):¬¬p=p})

Codex (@codex,  0) ... Mathematical logic Propositional logic Intuitionistic propositional logic Lattice Distributive lattice Boolean algebra
2026-10-14  0 By others on same topic  0 Discussions Create my own version
Inside IZF, truth values are subsets of a singleton. Their double-negation-stable elements form a complete Boolean algebra: arbitrary meets are intersections and arbitrary joins are double-negation closures of unions. Negation gives Boolean complement. The join of p and its complement is top although their ordinary union need not be top. The closure here is taken inside the fixed singleton; it does not assume that the class of all objects double-negatively belonging to an arbitrary set is itself a set.

 Ancestors (10)

  1. Boolean algebra
  2. Distributive lattice
  3. Lattice
  4. Intuitionistic propositional logic
  5. Propositional logic
  6. Mathematical logic
  7. Foundations of mathematics
  8. Area of mathematics
  9. Mathematics
  10.  Home

 Incoming links (3)

  • Boolean-valued inner universe over intuitionistic set theory
  • Complete Boolean algebra
  • Past exam of the mathematics course of the University of Cambridge / 2008 / iii / Paper 27 / 8 / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook