A Hierarchy of computably Enumerable Degrees

IF 0.7 3区 数学 Q1 LOGIC Bulletin of Symbolic Logic Pub Date : 2018-03-01 DOI:10.1017/BSL.2017.41
R. Downey, Noam Greenberg
{"title":"A Hierarchy of computably Enumerable Degrees","authors":"R. Downey, Noam Greenberg","doi":"10.1017/BSL.2017.41","DOIUrl":null,"url":null,"abstract":"We introduce a new hierarchy of computably enumerable degrees. This hierarchy is based on computable ordinal notations measuring complexity of approximation of ∆2 functions. The hierarchy unifies and classifies the combinatorics of a number of diverse constructions in computability theory. It does so along the lines of the high degrees (Martin) and the array noncomputable degrees (Downey, Jocksuch and Stob). The hierarchy also gives a number of natural definability results in the c.e. degrees, including a definable","PeriodicalId":55307,"journal":{"name":"Bulletin of Symbolic Logic","volume":"41 1","pages":"53-89"},"PeriodicalIF":0.7000,"publicationDate":"2018-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bulletin of Symbolic Logic","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1017/BSL.2017.41","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"LOGIC","Score":null,"Total":0}
引用次数: 4

Abstract

We introduce a new hierarchy of computably enumerable degrees. This hierarchy is based on computable ordinal notations measuring complexity of approximation of ∆2 functions. The hierarchy unifies and classifies the combinatorics of a number of diverse constructions in computability theory. It does so along the lines of the high degrees (Martin) and the array noncomputable degrees (Downey, Jocksuch and Stob). The hierarchy also gives a number of natural definability results in the c.e. degrees, including a definable
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
可计算可枚举度的层次结构
我们引入了一种新的可计算枚举度的层次结构。这个层次是基于测量∆2函数近似复杂度的可计算有序符号。在可计算理论中,层次结构统一和分类了许多不同结构的组合。它按照高度数(Martin)和数组不可计算度数(Downey, Jocksuch和Stob)的顺序进行操作。层次结构还给出了一些自然的可定义性结果,包括一个可定义的
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
0.60
自引率
0.00%
发文量
32
审稿时长
>12 weeks
期刊介绍: The Bulletin of Symbolic Logic was established in 1995 by the Association for Symbolic Logic to provide a journal of high standards that would be both accessible and of interest to as wide an audience as possible. It is designed to cover all areas within the purview of the ASL: mathematical logic and its applications, philosophical and non-classical logic and its applications, history and philosophy of logic, and philosophy and methodology of mathematics.
期刊最新文献
Formal Logic of Sentences, Sentential Logic (also called Sentential Logic and Statement Logic) Semantic Models for ∏: ∏⧉ Basics of Set Theory Concepts of Deductive Reasoning Proof-Theoretical System for Predicate Logic: ∏πφ=
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1