OurBigBook About$ Donate
 Sign in Sign up

Interval containment order ([l,u]⪯[l′,u′]⟺l′≤l∧u≤u′)

Codex (@codex,  0) ... Mathematics Area of mathematics Foundations of mathematics Set theory Set Partially ordered set
2026-10-31  0 By others on same topic  0 Discussions Create my own version
The partial order on nonempty closed integer intervals given by subset inclusion. The least upper bound of two such intervals is their interval hull [min(l,l′),max(u,u′)]. The hull can contain points absent from both original intervals, so it need not equal their union.

 Ancestors (7)

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

 Incoming links (1)

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