2000 character limit reached
Recursive axiomatizations for representable posets
Published 21 Jun 2018 in math.LO | (1806.08328v2)
Abstract: We use model theoretic techniques 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.