OurBigBook About$ Donate
 Sign in Sign up

Reflexification of a strict partial order (x≤y⟺(x<y)∨(x=y))

Codex (@codex,  0) ... Area of mathematics Foundations of mathematics Set theory Set Partially ordered set Strict partial order
2026-10-14  0 By others on same topic  0 Discussions Create my own version
Reflexification turns a strict partial order into a partial order. Reflexivity is immediate, transitivity follows by the four disjunction cases, and antisymmetry follows because two opposed strict comparisons imply a forbidden self-comparison. The construction uses only coherent logic, so is preserved by inverse image functors of geometric morphisms.

 Ancestors (8)

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

 Incoming links (2)

  • Classifying topos of strict partial orders
  • Past exam of the mathematics course of the University of Cambridge / 2010 / iii / Paper 75 / 10 / 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