Dedekind's Transposition Principle for lattices of equivalence relations

2013/01/28 by William DeMeo, DeMeo, William
Computer Science · Mathematics · #Advanced Algebra and Logic #Advanced Topology and Set Theory #Combinatorics #Combinatorics (math.CO) #Complete lattice #Congruence relation #Dedekind cut #Discrete mathematics #Equivalence (formal languages) #Equivalence relation #FOS: Mathematics #Geometry #Lattice (music) #Lemma (botany) #Mathematics #Physics #Pure mathematics #Quantum mechanics #Rings and Algebras (math.RA) #Rough Sets and Fuzzy Logic #Transposition (logic) #Universality (dynamical systems) #math.CO #math.RA

paper · pdf · doi:10.48550/arxiv.1301.6788

3 pages; comments welcome

arxiv created 2013/01/28 · openalex publication_date 2013/01/28 · arxiv updated 2013/01/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/04

Abstract

We prove a version of Dedekind's Transposition Principle that holds in lattices of equivalence relations.

Citations

• Ueber die von drei Moduln erzeugte Dualgruppe

Related

• G. Czédli's tolerance factor lattice construction, and weak ordered relations
• Some remarks on lattices of equivalences
• Semi-decidable equivalence relations obtained by composition and lattice join of decidable equivalence relations
• Embedding coproducts of partition lattices
• Equivalence Classes of Permutations under Various Relations Generated by\n Constrained Transpositions