Back to search

University of Leeds

Automorphisms and linearisations of computable orderings

Abstract

dc:description.abstract

In this thesis, we study computable content of existing classical theorems on linearisations of partial orderings and automorphisms of linear orderings, and provide computational refinements in terms of the Ershov hierarchy. In Chapter 2, we examine questions as to the constructiveness of linearisations obtained in terms of the Ershov hierarchy, while respecting particular constraints. The main result here entails a proof that every computably well-founded computable partial ordering has a computably well-founded ω-c.e. linear extension. In Chapter 3, we examine questions as to how less constructive rigidities of certain order types break down within the context of the Ershov hierarchy, and introduce uniform Δ02 classes as likely candidates in the case of order types 2.η and ω + ς.

Degree

thesis:*
Name dc:type.qualificationname
Ph.D
Level dc:type.qualificationlevel
doctoral
Grantor dc:publisher.institution
University of Leeds
Year dc:date.issued
2011

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Lee, Kyung Il
Advisor dc:contributor.advisor
  • Cooper, S.B.

Rights

Language dc:language.dcterms_iso639_2
eng

Identifiers

dc:identifier.*
Identifier
uk.bl.ethos.546654

Chain of custody

source
Harvested from
White Rose University Consortium
Base URL
etheses.whiterose.ac.uk/cgi/oai2
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
related terms
citation

Lee, Kyung Il. Automorphisms and linearisations of computable orderings. doctoral thesis, University of Leeds, 2011.