Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 4 of 4 for “"Recursively Enumerable Degrees"”.
-
The role of true finiteness in the admissible recursively enumerable degrees
… both codings of models of arithmetic into the recursively enumerable degrees, and non-distributive lattice embeddings into these degrees. We show that if an admissible ordinal alpha is effectively close to omega (where this closeness can be measured by size or by cofinality) then such …
-
Some Theorems on Thue Systems, Partial Propositional Calculi and Recursively Enumerable Degrees of Unsolvability
Made available in DSpace on 2014-12-09T22:17:14Z (GMT). No. of bitstreams: 1 6500838.pdf: 3275229 bytes, checksum: a354721923bc96dcf4cc79aa1cbca1c5 (MD5) Previous issue date: 1964
-
A Hierarchy of Families of Recursively Enumerable Degrees and A Theorem on Bounding Minimal Pairs
This thesis is concerned with the properties of recursivelyenumerable sets--that is, sets which can be listed by Turingmachines--and their Turing degrees. We shall use the abbreviationr.e. to stand for the phrase recursively enumerable.
-
Elements Of Classical Recursion Theory: Degree-Theoretic Properties And Combinatorial Properties
… Theory (Computability Theory), we study Turing degrees in terms of their degree-theoretic properties and combinatorial properties. In this dissertation we present several results in terms of connections either between these two categories of properties or within each category. Our first main …