Chains, antichains, and complements in infinite partition lattices

DOI10.1007/s00012-018-0514-zMaRDI QIDQ1652872

Pavel Růžička, Jean-Yves Moyen, Jakob Grue Simonsen, James Emil Avery

Publication date: 16 July 2018

Published in: Algebra Universalis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1501.05284

zbMATH Keywords

ordinal; tree; antichain; chain; cardinal; equivalence lattice; complement; order theory; partition lattice

Mathematics Subject Classification ID

06C15: Complemented lattices, orthocomplemented lattices and posets

06B05: Structure theory of lattices

03E05: Other combinatorial set theory

Related Items

The restricted partition lattices, Subrecursive equivalence relations and (non-)closure under lattice operations, Learning to agree over large state spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On non-forking spectra
• Counting complements in the partition lattice, and hypertrees
• The size of the largest antichain in the partition lattice
• Jónsson's contributions to lattice theory
• Ordered sets
• Size of the largest antichain in a partition poset
• Lattice generation of small equivalences of a countable set
• \((1+1+2)\)-generated equivalence lattices
• Theory of equivalence relations
• ON THE NUMBER OF DEDEKIND CUTS AND TWO-CARDINAL MODELS OF DEPENDENT THEORIES
• Almost-disjoint sets the dense set problem and the partition calculus
• Powers of regular cardinals
• Aronszajn trees and the independence of the transfer property