COUNTING SIBLINGS IN UNIVERSAL THEORIES

JOURNAL OF SYMBOLIC LOGIC（2022）

引用 2|浏览4

暂无评分

摘要

We show that if a countable structure M in a finite relational language is not cellular, then there is an age-preserving N superset of M such that 2(N0) many structures are bi-embeddable with N. The proof proceeds by a case division based on mutual algebraicity.

查看译文

关键词

Siblings, cellular, mutually algebraic, bi-embeddable

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要