Journal of Formalized Mathematics
Volume 1, 1989
University of Bialystok
Copyright (c) 1989
Association of Mizar Users
Introduction to Lattice Theory

Stanislaw Zukowski

Warsaw University, Bialystok

Supported by RPBP.III24.C1.
Summary.

A lattice is defined as an algebra on a nonempty set with binary operations
join and meet which are commutative and associative, and satisfy
the absorption identities.
The following kinds of lattices are considered:
distributive,
modular,
bounded (with zero and unit elements),
complemented,
and Boolean (with complement).
The article includes also theorems which immediately follow from definitions.
The terminology and notation used in this paper have been
introduced in the following articles
[2]
[3]
[1]
Contents (PDF format)
Bibliography
 [1]
Czeslaw Bylinski.
Binary operations.
Journal of Formalized Mathematics,
1, 1989.
 [2]
Czeslaw Bylinski.
Some basic properties of sets.
Journal of Formalized Mathematics,
1, 1989.
 [3]
Zinaida Trybulec.
Properties of subsets.
Journal of Formalized Mathematics,
1, 1989.
Received April 14, 1989
[
Download a postscript version,
MML identifier index,
Mizar home page]