Structural highness notions

JOURNAL OF SYMBOLIC LOGIC(2023)

引用 0|浏览14
暂无评分
摘要
We introduce several highness notions on degrees related to the problem of computing isomorphisms between structures, provided that isomorphisms exist. We consider variants along axes of uniformity, inclusion of negative information, and several other problems related to computing isomorphisms. These other problems include Scott analysis (in the form of back-and-forth relations), jump hierarchies, and computing descending sequences in linear orders.
更多
查看译文
关键词
highness for isomorphism,Scott rank,Harrison orderings,jump hierarchies,traceability
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要