Mathlib Map

Structures · Order

OmegaCompletePartialOrder

An omega-complete partial order is a partial order with a supremum operation on increasing sequences indexed by natural numbers (which we call ωSup). In this sense, it is strictly weaker than join complete semi-lattices as only ω-sized totally ordered sets have a supremum. See the definition on page 114 of [gunter1992].

Defined in
Mathlib.Order.OmegaCompletePartialOrder
Shape
One type argument · adds ωSup, le_ωSup, ωSup_le

Extends1

Extended by2

Forgetful instances

Concrete types that are instances6

  • Part
  • OmegaCompletePartialOrder.ContinuousHom
  • ωCPO.carrier
  • Subtype
  • Prod
  • OrderHom

How is a type an instance?

Loading the hierarchy index…

Assumed by129

Ancestors8