The Tree of Tuples of a Structure

The Journal of Symbolic Logic(2022)

引用 3|浏览13
暂无评分
摘要
Our main result is that there exist structures which cannot be computably recovered from their tree of tuples. This implies that there are structures with no computable copies which nevertheless cannot code any information in a natural/functorial way.
更多
查看译文
关键词
computable structure theory, back-and-forth, coding
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要