The lattice of distributive closure operators over an algebra

Studia Logica 52 (1):1 - 13 (1993)

In our previous paper Algebraic Logic for Classical Conjunction and Disjunction we studied some relations between the fragmentL of classical logic having just conjunction and disjunction and the varietyD of distributive lattices, within the context of Algebraic Logic. The central tool in that study was a class of closure operators which we calleddistributive, and one of its main results was that for any algebraA of type (2,2) there is an isomorphism between the lattices of allD-congruences ofA and of all distributive closure operators overA. In the present paper we study the lattice structure of this last set, give a description of its finite and infinite operations, and obtain a topological representation. We also apply the mentioned isomorphism and other results to obtain proofs with a logical flavour for several new or well-known lattice-theoretical properties, like Hashimoto's characterization of distributive lattices, and Priestley's topological representation of the congruence lattice of a bounded distributive lattice.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF01053060
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 44,327
Through your library

References found in this work BETA

Protoalgebraic Logics.W. J. Blok & Don Pigozzi - 1986 - Studia Logica 45 (4):337 - 369.
Distributive Lattices.Raymond Balbes & Philip Dwinger - 1977 - Journal of Symbolic Logic 42 (4):587-588.

View all 6 references / Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles


Added to PP index

Total views
36 ( #238,623 of 2,271,522 )

Recent downloads (6 months)
8 ( #135,515 of 2,271,522 )

How can I increase my downloads?


My notes

Sign in to use this feature