Representable posets

DOI10.1016/J.JAL.2016.03.003zbMATH Open1436.06004arXiv1603.04972OpenAlexW2913276123MaRDI QIDQ301370FDOQ301370

Authors: Robert Egrot 

Publication date: 30 June 2016

Published in: Journal of Applied Logic (Search for Journal in Brave)

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 $alpha$ and $$ a poset is said to be $$-representable if an embedding into a field of sets exists that preserves meets of sets smaller than $alpha$ 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 $alpha$ or $$. We also show that the classes of posets with representations preserving either countable or all meets and joins are pseudoelementary.

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

Recommendations

• Non-elementary classes of representable posets
• scientific article; zbMATH DE number 2139646
• Sub-representation of posets
• On the representation of partially ordered sets
• Completely representable lattices

zbMATH Keywords

partially ordered setaxiomatizationposetrepresentationelementary class

Mathematics Subject Classification ID

Partial orders, general (06A06) Combinatorics of partially ordered sets (06A07) Representation theory of lattices (06B15) Ultraproducts and related constructions (03C20)

Cites Work

• Model theory.
• Relation algebras by games
• Every two elementarily equivalent models have isomorphic ultrapowers
• On the definition of distributive semilattices
• Characterizations for Prime Semilattices
• On Prime Semilattices
• 0-Distributive and P-Uniform Semilattices
• Completely representable lattices
• REPRESENTATION OF POSETS
• On Definitions of Cuts and Completion of Partially Ordered Sets
• A Representation Theory for Prime and Implicative Semilattices
• Boolean Rings with Isomorphisms Preserving Suprema and Infima
• Weakly distributive semilattices

Cited In (12)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Sub-representation of posets
• Non-elementary classes of representable posets
• Closure operators, frames and neatest representations
• Representations of bipartite completed posets
• Distributive and completely distributive lattice extensions of ordered sets
• Recursive axiomatisations from separation properties
• Title not available (Why is that?)
• 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)