A Theorem on Hypersimple Sets
From MaRDI portal
Publication:5829026
DOI10.2307/2031868zbMath0056.24902OpenAlexW4229577848MaRDI QIDQ5829026
Publication date: 1954
Full work available at URL: https://doi.org/10.2307/2031868
Turing reducibilityrecursively enumerable setshypersimple setcreative setrecursively enumerable but not recursive set
Recursively (computably) enumerable sets and degrees (03D25) Recursive equivalence types of sets and structures, isols (03D50)
Related Items
Certain properties of deducibility operators, A class of hypersimple incomplete sets, Reverse mathematics, well-quasi-orders, and Noetherian spaces, On the Turing degrees of minimal index sets, Quasi-simple relations in copies of a given recursive structure, A remark on the length problem, On the Degrees of Index Sets, Deficiency Sets and Bounded Information Reducibilities, Nondeterministic bounded query reducibilities, Turing degrees of hypersimple relations on computable structures, (EXTRA)ORDINARY EQUIVALENCES WITH THE ASCENDING/DESCENDING SEQUENCE PRINCIPLE, Relationships Between Reducibilities, Effectively Simple Sets, Semirecursive Sets and Positive Reducibility, Completeness, the Recursion Theorem, and Effectively Simple Sets, A Note on Bounded-Truth-Table Reducibility, Weakly precomplete computably enumerable equivalence relations, Independent axiomatizability of sets of sentences, Recursively enumerable sets and degrees, T-Degrees, Jump Classes, and Strong Reducibilities, Computing degrees of unsolvability, Recursive and Recursively Enumerable Orders, Degrees of sets having no subsets of higher m- and t t-degree, Strong reducibilities, On trees without hyperimmune branches, Metarecursively enumerable sets and admissible ordinals, Classes bounded by incomplete sets
