Library

eCommons

 

Computably enumerable boolean algebras

Simple item page
dc.contributor.authorTran, Ying-Ying
dc.contributor.chairNerode, Anil
dc.contributor.committeeMemberKress Gazit, Hadas
dc.contributor.committeeMemberShore, Richard A.
dc.date.accessioned2018-10-23T13:23:48Z
dc.date.available2018-10-23T13:23:48Z
dc.date.issued2018-05-30
dc.description.abstractWe study computably enumerable boolean algebras, focusing on Stone duality and universality phenomena. We show how classical Stone duality specializes to c.e. boolean algebras, giving a natural bijection between c.e. boolean algebras and $\Pi^0_1$ classes. We also give a new characterization of computably universal-homogeneous c.e. boolean algebras, which yields a more direct proof of the computable isomorphism between the Lindenbaum algebras of theories which satisfy the hypotheses of the second incompleteness theorem.
dc.identifier.doihttps://doi.org/10.7298/X4Z60M82
dc.identifier.otherTran_cornellgrad_0058F_10785
dc.identifier.otherhttp://dissertations.umi.com/cornellgrad:10785
dc.identifier.otherbibid: 10489589
dc.identifier.urihttps://hdl.handle.net/1813/59504
dc.language.isoen_US
dc.rightsAttribution-ShareAlike 4.0 International*
dc.rights.urihttps://creativecommons.org/licenses/by-sa/4.0/*
dc.subjectStone duality
dc.subjectuniversal-homogeneous
dc.subjectLogic
dc.subjectboolean algebra
dc.subjectcomputably enumerable
dc.titleComputably enumerable boolean algebras
dc.typedissertation or thesis
dcterms.licensehttps://hdl.handle.net/1813/59810
thesis.degree.disciplineMathematics
thesis.degree.grantorCornell University
thesis.degree.levelDoctor of Philosophy
thesis.degree.namePh. D., Mathematics

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Tran_cornellgrad_0058F_10785.pdf
Size:
332.85 KB
Format:
Adobe Portable Document Format
Download

Collections

Cornell Theses and Dissertations