可表示偏序集的递归公理化
Recursive axiomatizations for representable posets
摘要:
我们使用模型论的技术来构建明确的一阶公理化的类的偏序集,可以表示为系统的集合,其中的顺序关系是由包含,现有的满足和连接指定可数基数分别对应于交叉和工会。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。