Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/142803
Title: ON TRANSFINITE LEVELS OF THE ERSHOV HIERARCHY
Authors: PENG CHENG
Keywords: Ershov hierarchy
Issue Date: 24-Jan-2018
Citation: PENG CHENG (2018-01-24). ON TRANSFINITE LEVELS OF THE ERSHOV HIERARCHY. ScholarBank@NUS Repository.
Abstract: In this thesis, we study Turing degrees in the context of classical recursion theory. The dissertation is motivated by the \Sigma_1-elementary substructure problem. We consider the problem for transfinite levels of the Ershov hierarchy. The techniques in our results are motivated by two remarkable theorems, Sacks Density Theorem and d.r.e Nondensity Theorem.
URI: http://scholarbank.nus.edu.sg/handle/10635/142803
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
PengCH.pdf592.85 kBAdobe PDF

OPEN

NoneView/Download

Page view(s)

19
checked on Aug 16, 2018

Download(s)

5
checked on Aug 16, 2018

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.