Introduction to Lattice Theory

  • Ratnesh Kumar
  • Vijay K. Garg
Part of the The Springer International Series in Engineering and Computer Science book series (SECS, volume 300)


In this chapter we introduce the notion of lattices and obtain techniques for obtaining extremal solutions of inequations involving operations over lattices. Our motivation for studying these concepts and techniques stems from our interest in solving a system of inequations involving operations over the lattice of languages. Results presented in this chapter have a “primal” and a “dual” version. We only prove the primal version, as the dual version can be proved analogously.


Lattice Theory Complete Lattice Iterative Computation Extremal Solution Conjunctive Function 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliographic Remarks

  1. For a general introduction to the subject oflattice theory we refer the readers to Davey-Priestley [DP90]. One of the early results on existence of fixed points of a monotone function is due to Knaster-Tarski [Tar55]. Lassez-Nguyen-Sonenberg [LNS82] provide a nice historical account of this and other fixed point theorems. Our treatment of inequations is influenced by Dijkstra-Scholten [DS90]; in particular, the terms conjugate and converse of a function have been borrowed from there. The existence and computation of extremal solutions of a system of inequations over lattices is reported in Kumar-Garg [KG94b].Google Scholar

Copyright information

© Springer Science+Business Media New York 1995

Authors and Affiliations

  • Ratnesh Kumar
    • 1
  • Vijay K. Garg
    • 2
  1. 1.Department of Electrical EngineeringUniversity of KentuckyLexingtonUSA
  2. 2.Department of Electrical and Computer EngineeringUniversity of Texas at AustinAustinUSA

Personalised recommendations