The Complexity of Orbits of Computably Enumerable Sets

IF 0.7 3区 数学 Q1 LOGIC Bulletin of Symbolic Logic Pub Date : 2008-03-01 DOI:10.2178/bsl/1208358844
Peter A. Cholak, R. Downey, L. Harrington
{"title":"The Complexity of Orbits of Computably Enumerable Sets","authors":"Peter A. Cholak, R. Downey, L. Harrington","doi":"10.2178/bsl/1208358844","DOIUrl":null,"url":null,"abstract":"Abstract The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, ε, such that the question of membership in this orbit is complete. This result and proof have a number of nice corollaries: the Scott rank of ε is + 1; not all orbits are elementarily definable; there is no arithmetic description of all orbits of ε; for all finite α ≥ 9, there is a properly orbit (from the proof).","PeriodicalId":55307,"journal":{"name":"Bulletin of Symbolic Logic","volume":"14 1","pages":"69 - 87"},"PeriodicalIF":0.7000,"publicationDate":"2008-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bulletin of Symbolic Logic","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.2178/bsl/1208358844","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"LOGIC","Score":null,"Total":0}
引用次数: 3

Abstract

Abstract The goal of this paper is to announce there is a single orbit of the c.e. sets with inclusion, ε, such that the question of membership in this orbit is complete. This result and proof have a number of nice corollaries: the Scott rank of ε is + 1; not all orbits are elementarily definable; there is no arithmetic description of all orbits of ε; for all finite α ≥ 9, there is a properly orbit (from the proof).
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
可计算可枚举集轨道的复杂性
摘要:本文的目的是宣布含有ε的c.e.集合存在一个单一轨道,从而使该轨道的隶属性问题完备。这个结果和证明有许多很好的推论:ε的Scott秩是+ 1;并非所有轨道都是基本可定义的;没有对ε的所有轨道的算术描述;对于所有有限α≥9,有一个合适的轨道(从证明)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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