Hostname: page-component-8678677fb7-xsjpr Total loading time: 0 Render date: 2026-10-07T02:34:55.206Z Has data issue: false hasContentIssue false

Maximal chains in the Turing degrees

Published online by Cambridge University Press:  12 March 2014

C. T. Chong
Affiliation:
Department of Mathematics, Faculty of Science, National University of Singapore, Lower Kent Ridge Road, Singapore 117543, Singapore. E-mail: chongct@math.nus.edu.sg
Liang Yu
Affiliation:
Institute of Mathematical Science, Nanjing University, Nanjing, Jiangsu Province 210093 PR. OF China. E-mail: yuliang.nju@gmail.com

Abstract

We study the problem of existence of maximal chains in the Turing degrees. We show that:

1. ZF + DC + “There exists no maximal chain in the Turing degrees” is equiconsistent with ZFC + “There exists an inaccessible cardinal”

2. For all a ∈ 2ω, (ω1)L[a] = ω1 if and only if there exists a [a] maximal chain in the Turing degrees. As a corollary, ZFC + “There exists an inaccessible cardinal” is equiconsistent with ZFC + “There is no (bold face) maximal chain of Turing degrees”.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)