Computably Extendible Order Types

Gay, James Robert Kishore (2016) Computably Extendible Order Types. PhD thesis, University of Leeds.



Keywords: partial order, linear order, total order, linearisation, well-founded, scattered, computable partial order, computable linearisation
Awarding institution: University of Leeds
Academic Units: The University of Leeds > Faculty of Maths and Physical Sciences (Leeds) > School of Mathematics (Leeds) > Pure Mathematics (Leeds)
Identification Number/EthosID (e.g.
Depositing User: Mr James Gay
Date Deposited: 27 Sep 2016 12:52
Last Modified: 06 Oct 2016 14:43


Final eThesis - complete (pdf)

Filename: thesis.pdf

Description: Final eThesis

Licence: Creative Commons Attribution Non-commercial Share Alike (UK)

Share / Export

You do not need to contact us to get a copy of this thesis. Please use the 'Download' link(s) above to get a copy.
You can contact us about this thesis. If you need to make a general enquiry, please see the Contact us page.