Non-elementary classes of representable posets

DOI10.1090/PROC/13636MaRDI QIDQ5354466zbMATH OpenOpenAlexFDO

Authors Robert Egrot

Publication date 4 September 2017

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

axiomatizationposetrepresentationultrapower

Mathematics Subject Classification ID

Ultraproducts and related constructions (03C20) Logical aspects of lattices and related structures (03G10) Algebraic aspects of posets (06A11)

Abstract: A poset is $(omega,C)$-representable if it can be embedded into a field of sets in such a way that all existing joins, and all existing emph{finite} meets are preserved. We show that the class of $(omega,C)$-representable posets cannot be axiomatized in first order logic using the standard language of posets. We generalize this result to $$-representable posets for certain values of $alpha$ and $$.

Recommendations

• Representable posets
• scientific article; zbMATH DE number 2139646
• On representations with nonsingularity conditions for a certain class of posets
• REPRESENTATION OF POSETS
• scientific article; zbMATH DE number 3929217
• Representations of primitive posets
• scientific article; zbMATH DE number 1257182
• Varieties corresponding to classes of complemented posets

Cites work

• A Representation Theory for Prime and Implicative Semilattices
• Applications of the Theory of Boolean Rings to General Topology
• Boolean Rings with Isomorphisms Preserving Suprema and Infima
• Characterizations for Prime Semilattices
• Completely representable lattices
• Model theory.
• No finite axiomatizations for posets embeddable into distributive lattices
• On Prime Semilattices
• On the definition of distributive semilattices
• On the representation of α-complete lattices
• Representable posets
• The class of prime semilattices is not finitely axiomatizable

Cited in

(7)

• Invariants for classes of indecomposable representations of finite posets
• No finite axiomatizations for posets embeddable into distributive lattices
• Representable posets
• scientific article; zbMATH DE number 2139646 (Why is no real title available?)
• Recursive axiomatizations for representable posets
• Recursive axiomatisations from separation properties
• The Class of Representable Ordered Monoids has a Recursively Enumerable, Universal Axiomatisation but it is Not Finitely Axiomatisable

This page was built for publication: Non-elementary classes of representable posets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5354466)