Computable Embeddings for Pairs of Linear Orders
Algebra i logika(2021)
摘要
We study computable embeddings for pairs of structures, i.e., for classes containing precisely two nonisomorphic structures. Surprisingly, even for some pairs of simple linear orders, computable embeddings induce a nontrivial degree structure. Our main result shows that {ω · k,ω * · k} is computably embeddable in {ω · t, ω * · t} iff k divides t.
更多查看译文
关键词
computable embedding, enumeration operator, computable linear order
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要