Recursive axiomatizations for representable posets
classification
🧮 math.LO
keywords
axiomatizationsposetscardinalitiesclassesconstructcorrespondcountableexisting
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.