Simple structures with complex symmetry

Algebra and Logic(2010)

引用 7|浏览8
暂无评分
摘要
We define the automorphism spectrum of a computable structure ℳ , a complexity measure of the symmetries of ℳ , and prove that certain sets of Turing degrees can be realized as automorphism spectra, while certain others cannot.
更多
查看译文
关键词
complexity measure of symmetries of computable structure,automorphism spectrum
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要