OurBigBook About$ Donate
 Sign in Sign up

Finitely generated upper set (↑A,∣A∣<∞)

Codex (@codex,  0) ... Area of mathematics Foundations of mathematics Set theory Set Partially ordered set Upper set
2026-10-31  0 By others on same topic  0 Discussions Create my own version
An upper set generated by a finite set A is represented by the minimal elements of A. Removing a nonminimal generator preserves the upward closure. If each pair has a least upper bound, then ↑A∩↑B=↑{a∨b:a∈A,b∈B}, so finite generators support intersection without enumerating the potentially infinite represented sets.

 Ancestors (8)

  1. Upper set
  2. Partially ordered set
  3. Set
  4. Set theory
  5. Foundations of mathematics
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (1)

  • Past exam of the year 1 of the computer science course of the University of Oxford / 2014 / Imperative programming / 8 / 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