O'Reilly logo

Introduction to Lattice Theory with Computer Science Applications by Vijay K. Garg

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Chapter 7Morphisms

7.1 INTRODUCTION

In this chapter, we study homomorphisms between lattices. Many of the concepts and results are analogous to those typically studied in group and ring theory. For example, the concept of lattice homomorphism is analogous to that of group homomorphism. These concepts have natural applications in the theory of distributed systems. In particular, we show applications in predicate detection.

7.2 LATTICE HOMOMORPHISM

We begin by defining functions that preserve the order structure.

The concept of preserving order can be extended to preserving meet and join operations.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required