Congruences

George Grätzer

Chapter Chapter 3 in The Congruences of a Finite Lattice, 2016, pp 35-45 from Springer

Abstract: Abstract Let a, b, c, d be elements of a lattice L. If a ≡ b ( mod α ) implies that c ≡ d ( mod α ) , $$\displaystyle{\mbox{ $a \equiv b\!\pmod {\boldsymbol{\alpha }}$ implies that $c \equiv d\!\pmod {\boldsymbol{\alpha }}$,}}$$ for any congruence relation α $$\boldsymbol{\alpha }$$ of L, then we can say that Congruence-forcing Congruence forcing a ≡ b congruence-forces c ≡ d.

Keywords: Congruence-preserving Extension; Prime Interval; Unary Term Function; Finite Lattice; Modular Lattice (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-38798-7_3

Ordering information: This item can be ordered from
http://www.springer.com/9783319387987

DOI: 10.1007/978-3-319-38798-7_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().