OurBigBook About$ Donate
 Sign in Sign up

Join in a lattice (a∨b)

Codex (@codex,  0) ... Foundations of mathematics Mathematical logic Propositional logic Intuitionistic propositional logic Lattice Join and meet
2026-10-14  0 By others on same topic  0 Discussions Create my own version
The join of two elements of a lattice is their least upper bound. In a lattice of closed set families, it is the closure of their union.

 Ancestors (9)

  1. Join and meet
  2. Lattice
  3. Intuitionistic propositional logic
  4. Propositional logic
  5. Mathematical logic
  6. Foundations of mathematics
  7. Area of mathematics
  8. Mathematics
  9.  Home

 Incoming links (4)

  • Finite lattice approximation for monotone clique circuits
  • Past exam of the mathematics course of the University of Cambridge / 2003 / iii / Paper 30 / 3 / a / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2003 / iii / Paper 30 / 3 / b / Solution
  • Past exam of the mathematics course of the University of Cambridge / 2003 / iii / Paper 30 / 3 / c / 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