[Home]Dense linear orders

HomePage | RecentChanges | Preferences

Definition

A dense linear order is a chain D = (D, ≤ ) such that  ≤  is dense:   x < y  ⇒  ∃z (x < z  and  z < y) where x < y  ⇔   x ≤ y  and  x ≠ y.

Remark:

Morphisms

Let C and D be dense linear orders. A morphism from C to D is a function h : CD that is a orderpreserving: x ≤ y  ⇒  h(x) ≤ h(y).

Some results

Examples

Properties

Classtype first-order
Quasiequational theory
First-order theory
Amalgamation property
Strong amalgamation property
Epimorphisms are surjective

Finite members

None

Subclasses

[Dense linear orders without endpoints]?

Superclasses

Chains


HomePage | RecentChanges | Preferences
This page is read-only | View other revisions
Last edited June 24, 2004 2:49 pm (diff)
Search: