Abstract
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 \Pi01 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.
Degree
thesis:*- Name thesis:degree_name
- Ph. D., Mathematics
- Level thesis:degree_level
- Doctor of Philosophy
- Discipline thesis:degree_discipline
- Mathematics
- Grantor
- Cornell University
- Year dc:date.issued
- 2018
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Tran, Ying-Ying
- Chair dc:contributor.chair
-
- Nerode, Anil
- Committee members dc:contributor.committeemember
-
- Kress Gazit, Hadas
- Shore, Richard A.
Subjects
dc:subject × 5Rights
dc:rights- Statement dc:rights
-
- Attribution-ShareAlike 4.0 International
- Licence dc:rights.uri
- Language dc:language.iso
- en_US
Identifiers
dc:identifier.*- Dc Identifier Bibid
- 10489589
- Dc Identifier Other
-
ProQuest Submission ID: 10785
ProQuest Publication ID: 10811596