关于可数饱和图linear orders及一类可数饱和图
On countably saturated linear orders and certain class of countably saturated graphs
摘要:
本文的思想是探讨不同类型结构的正则可数饱和模型的存在性。众所周知,在CH下,存在唯一的可数饱和线性基数序$\mathfrak{c}$。在不同的集合论假设下,我们给出了基数$\mathfrak{c}$的两两非同构可数饱和线性序的一些例子。我们给出了Harzheim的旧定理的一个新的证明,即可数饱和线性序类具有唯一确定的单元素基。从我们的证明可以得出,这个最小线性序是某个Fraïsse类的Fraïsse极限。特别是,它是关于可数子集齐次。其次,我们证明了随机图的不可数版本的存在性和唯一性。这个图同构于$(H(ω_1),\in \cup \ni)$,其中$H(ω_1)$是遗传可数集的集合,如果两个集合中的一个是另一个的元素,则两个集合是连通的。最后给出了一个素可数饱和布尔代数的例子。
英文摘要:
The idea of this paper is to explore the existence of canonical countably saturated models for different classes of structures. It is well-known that, under CH, there exists a unique countably saturated linear order of cardinality $\mathfrak{c}$. We provide some examples of pairwise non-isomorphic countably saturated linear orders of cardinality $\mathfrak{c}$, under different set-theoretic assumptions. We give a new proof of the old theorem of Harzheim, that the class of countably saturated linear orders has a uniquely determined one-element basis. From our proof it follows that this minimal linear order is a Fraïsse limit of certain Fraïsse class. In particular, it is homogeneous with respect to countable subsets. Next, we prove the existence and uniqueness of the uncountable version of the random graph. This graph is isomorphic to $(H(ω_1),\in \cup \ni)$, where $H(ω_1)$ is the set of hereditarily countable sets, and two sets are connected if one of them is an element of the other. In the last section, an example of a prime countably saturated Boolean algebra is presented.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。