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.

生成讲解博客的中文版本

生成AI智能校验的中文版本