COMPUTABILITY AND UNCOUNTABLE LINEAR ORDERS II: DEGREE SPECTRA

Author:

GREENBERG NOAM,KACH ASHER M.,LEMPP STEFFEN,TURETSKY DANIEL D.

Abstract

AbstractWe study the computable structure theory of linear orders of size $\aleph _1 $ within the framework of admissible computability theory. In particular, we study degree spectra and the successor relation.

Publisher

Cambridge University Press (CUP)

Subject

Logic,Philosophy

Reference21 articles.

1. [17] Richter Linda Jean , Degrees of structures, this Journal , vol. 46 (1981), no. 4, pp. 723–731.

2. Enumerations, countable structures and Turing degrees

3. [10] Greenberg Noam , Kach Asher M. , Lempp Steffen , and Turetsky Daniel D. , Computability and uncountable linear orders, part I: computable categoricity, this Journal , vol. 80 (2015), no. 1, pp. 116–144.

4. Degrees of orderings not isomorphic to recursive linear orderings

5. Some notes on recursively enumerable sets;Uspenskii;Zeitschrift fur mathematische Logik und Grundlagen der Mathematik,1957

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

1. UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES;The Journal of Symbolic Logic;2018-06

2. Finding bases of uncountable free abelian groups is usually difficult;Transactions of the American Mathematical Society;2017-12-14

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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