Representable posets
From MaRDI portal
Abstract: A poset is representable if it can be embedded in a field of sets in such a way that existing finite meets and joins become intersections and unions respectively (we say finite meets and joins are preserved). More generally, for cardinals and a poset is said to be -representable if an embedding into a field of sets exists that preserves meets of sets smaller than and joins of sets smaller than . We show using an ultraproduct/ultraroot argument that when the class of -representable posets is elementary, but does not have a finite axiomatization in the case where either or . We also show that the classes of posets with representations preserving either countable or all meets and joins are pseudoelementary.
Recommendations
Cites work
- 0-Distributive and P-Uniform Semilattices
- A Representation Theory for Prime and Implicative Semilattices
- Boolean Rings with Isomorphisms Preserving Suprema and Infima
- Characterizations for Prime Semilattices
- Completely representable lattices
- Every two elementarily equivalent models have isomorphic ultrapowers
- Model theory.
- On Definitions of Cuts and Completion of Partially Ordered Sets
- On Prime Semilattices
- On the definition of distributive semilattices
- REPRESENTATION OF POSETS
- Relation algebras by games
- Weakly distributive semilattices
Cited in
(12)- scientific article; zbMATH DE number 2139646 (Why is no real title available?)
- scientific article; zbMATH DE number 1453817 (Why is no real title available?)
- Sub-representation of posets
- scientific article; zbMATH DE number 722451 (Why is no real title available?)
- Closure operators, frames and neatest representations
- Non-elementary classes of representable posets
- Representations of bipartite completed posets
- Distributive and completely distributive lattice extensions of ordered sets
- Recursive axiomatisations from separation properties
- scientific article; zbMATH DE number 1226895 (Why is no real title available?)
- No finite axiomatizations for posets embeddable into distributive lattices
- Recursive axiomatizations for representable posets
This page was built for publication: Representable posets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q301370)