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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.