A lattice-theoretical fixpoint theorem and its applications.
A Tarski - 1955 - msp.org
A Tarski
1955•msp.orgBy a lattice we understand as usual a system 21=(A9<) formed by a nonempty set A and a
binary relation<; it is assumed that< establishes a partial order in A and that for any two
elements afb EA there is a least upper bound (join) aub and a greatest lower bound (meet)
an b. The relations> L,<, and> are defined in the usual way in terms of<.
binary relation<; it is assumed that< establishes a partial order in A and that for any two
elements afb EA there is a least upper bound (join) aub and a greatest lower bound (meet)
an b. The relations> L,<, and> are defined in the usual way in terms of<.
By a lattice we understand as usual a system 21=(A9<) formed by a nonempty set A and a binary relation<; it is assumed that< establishes a partial order in A and that for any two elements afb EA there is a least upper bound (join) a u b and a greatest lower bound (meet) an b. The relations> L,<, and> are defined in the usual way in terms of<.
Mathematical Sciences Publishers