Recursive axiomatizations for representable posets
Logic
2019-02-01 v2
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.
Cite
@article{arxiv.1806.08328,
title = {Recursive axiomatizations for representable posets},
author = {Rob Egrot},
journal= {arXiv preprint arXiv:1806.08328},
year = {2019}
}
Comments
Minor edits