1959Mathematical Proceedings of the Cambridge Philosophical SocietyRequires access

Which distributive lattices are lattices of closed sets?

Seymour Papert

Open publisher page 32 citations

Abstract

1. An elegant theorem due to Tarski states that a completely distributive complete Boolean algebra is isomorphic with a lattice of sets, and in fact the lattice of all the subsets of some aggregate. The obvious generalization of the question underlying this theorem is to ask whether one can pick out by means of a distributivity condition those lattices (not necessarily Boolean algebras) which are isomorphs of lattices of sets. The answer is no. The real numbers with their natural order form a complete lattice which satisfies the strongest possible distributivity conditions and yet is not iso-morphic with any lattice of sets.

About this research paper

What this paper is about

1. An elegant theorem due to Tarski states that a completely distributive complete Boolean algebra is isomorphic with a lattice of sets, and in fact the lattice of all the subsets of some aggregate. The obvious generalization of the question underlying this theorem is to ask whether one can pick out by means of a distributivity condition those lattices (not necessarily Boolean algebras) which are isomorphs of lattices of sets. The answer is no. The real numbers with their natural order form a complete lattice which satisfies the strongest possible distributivity conditions and yet is not iso-morphic with any lattice of sets.

Why it matters

OpenAlex reports 32 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

1. An elegant theorem due to Tarski states that a completely distributive complete Boolean algebra is isomorphic with a lattice of sets, and in fact the lattice of all the subsets of some aggregate. The obvious generalization of the question underlying this theorem is to ask whether one can pick out by means of a distributivity condition those lattices (not necessarily Boolean algebras) which are isomorphs of lattices of sets. The answer is no. The real numbers with their natural order form a complete lattice which satisfies the strongest possible distributivity conditions and yet is not iso-morphic with any lattice of sets.

Key concepts: Distributivity, Distributive property, Distributive lattice, Map of lattices, Congruence lattice problem, Lattice (music), Mathematics, Generalization

Related papers

Back to paper searchBrowse research topicsOriginal source
Which distributive lattices are lattices of closed sets? — Research Paper | ScholarLens