A Horn sentence in coalition lattices
Given a finite partially ordered set \(P\), for subsets or, in other words, coalitions \(X,Y\) of \(P\) let \(X \leq Y\) mean that there exists an injection \(\varphi:X \to Y\) such that \(x\leq\varphi (x)\) for all \(x\in X\). The set \({\mathcal L} (P)\) of all subsets of \(P\) equipped with this relation is a partially ordered set. When \({\mathcal L} (P)\) is a lattice, it is called a coalition lattice [cf. the author and \textit{Gy. Pollák}, ``When do coalitions form a lattice?, Acta Sci. Math. 60, 197-206 (1995; Zbl 0829.06003)]. A recursive construction of coalition lattices is given. Using this construction, which can be of separate interest, it is shown that not every lattice is embeddable in coalition lattices.
- Sums of lattices and a relational category
- A Horn sentence for involution lattices of quasiorders
- A note on representation of lattices by weak congruences
- scientific article; zbMATH DE number 4033809 (Why is no real title available?)
- scientific article; zbMATH DE number 812579 (Why is no real title available?)
- scientific article; zbMATH DE number 859902 (Why is no real title available?)
- Doubling tolerances and coalition lattices
This page was built for publication: A Horn sentence in coalition lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1921963)
