Theory of Complete Lattices

  • Norman M. Martin
  • Stephen Pollard
Chapter
Part of the Mathematics and Its Applications book series (MAIA, volume 369)

Abstract

A lattice is a partially ordered set in which any two elements have a greatest lower and least upper bound. A lattice is complete if and only if each set of lattice elements has a greatest lower and least upper bound. If <S,C> is a C-closure space, then <C,⊂> is a complete lattice in which ∩W is the greatest lower and Cl(UW) is the least upper bound of each subset W of C. It is convenient to let ‘ W’ and ‘(AB)’ designate Cl(∪ W) and Cl(A∪B), respectively. ( is the operation of closed union.) In this chapter, we use wellknown properties of lattices to derive some theorems about closure spaces.

Keywords

Complete Lattice Finite Subset Closure Space Finite Cover Proof Apply 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 1996

Authors and Affiliations

  • Norman M. Martin
    • 1
  • Stephen Pollard
    • 2
  1. 1.University of TexasAustinUSA
  2. 2.Truman State UniversityKirksvilleUSA

Personalised recommendations