Recursive axiomatizations for representable posets
Rob Egrot · International Journal of Algebra and Computation · 2019
We use model theoretic techniques and games to construct explicit first-order axiomatizations for the classes of posets that can be represented as systems of sets, where the order relation is given by inclusion, and existing meets and joins of specified countable cardinalities correspond to intersections and unions, respectively.