Some new computable structures of high rank

Author:

Harrison-Trainor Matthew,Igusa Gregory,Knight Julia

Abstract

We give several new examples of computable structures of high Scott rank. For earlier known computable structures of Scott rank ω 1 C K \omega _1^{CK} , the computable infinitary theory is 0 \aleph _0 -categorical. Millar and Sacks asked whether this was always the case. We answer this question by constructing an example whose computable infinitary theory has non-isomorphic countable models. The standard known computable structures of Scott rank ω 1 C K + 1 \omega _1^{CK}+1 have infinite indiscernible sequences. We give two constructions with no indiscernible ordered triple.

Funder

Natural Sciences and Engineering Research Council of Canada

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Reference14 articles.

1. Categoricity of computable infinitary theories;Calvert, W.;Arch. Math. Logic,2009

2. Computable trees of Scott rank 𝜔₁^{𝐶𝐾}, and computable approximation;Calvert, Wesley;J. Symbolic Logic,2006

3. Computability of Fraïssé limits;Csima, Barbara F.;J. Symbolic Logic,2011

4. Recursive pseudo-well-orderings;Harrison, Joseph;Trans. Amer. Math. Soc.,1968

Cited by 5 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. An Introduction to the Scott Complexity of Countable Structures and a Survey of Recent Results;The Bulletin of Symbolic Logic;2021-11-15

2. SCOTT COMPLEXITY OF COUNTABLE STRUCTURES;The Journal of Symbolic Logic;2021-02-01

3. THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS;The Journal of Symbolic Logic;2020-09

4. ASSIGNING AN ISOMORPHISM TYPE TO A HYPERDEGREE;The Journal of Symbolic Logic;2019-12-10

5. A first-order theory of Ulm type;Computability;2019-09-20

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3