Cancelling Congruences of Lattices, While Keeping Their Numbers of\n Filters and Ideals

2017/10/27 by Claudia Mureșan, Mureşan, Claudia
Computer Science · Decision Sciences · #03E02 #03E10 #06B10 #06C15 #Advanced Algebra and Logic #FOS: Mathematics #Fuzzy and Soft Set Theory #Multi-Criteria Decision Making #Rings and Algebras (math.RA) #Rough Sets and Fuzzy Logic

paper · pdf · doi:10.48550/arxiv.1710.10183

openalex publication_date 2017/10/27 · openalex created_date 2021/04/13 · openalex updated_date 2026/07/28

Abstract

In this paper, we study the congruences, prime filters and prime ideals of\nhorizontal sums of bounded lattices, then, through a construction based on\nhorizontal sums and without enforcing the Continuum Hypothesis, we are\nmodifying an example from citeeucard into a solution to the problem we have\nproposed in the same article: finding a lattice with the cardinalities of the\nsets of filters, ideals and congruences pairwise distinct.\n

Related

• Balanced d-lattices are complemented
• The Congruences of a Finite Lattice, A "Proof-by-Picture" Approach, third edition
• Congruences and prime-perspectivities in finite lattices
• Congruences in slim, planar, semimodular lattices: The Swing Lemma
• Filters and congruences in sectionally pseudocomplemented lattices and\n posets