Chains

A chain is a poset C = (C, ≤ ) such that

≤ is a total order: x ≤ y or y ≤ x.

Remark:

Let C and D be chains. A morphism from C to D is a function h : C→D that is a orderpreserving: x ≤ y ⇒ h(x) ≤ h(y).

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

[Size 1]?: 1
[Size 2]?: 1
[Size 3]?: 1
[Size 4]?: 1
[Size 5]?: 1
[Size 6]?: 1

[Well-ordered chains]?
Dense linear orders

Trees?