Relationships Between Reducibilities
From MaRDI portal
Publication:5581615
DOI10.2307/1995354zbMath0188.02604MaRDI QIDQ5581615
Publication date: 1969
Full work available at URL: https://doi.org/10.2307/1995354
Related Items
Irreducible, singular, and contiguous degrees, Relations between table-type degrees, Some properties of \(r\)-maximal sets and \(Q_{1,N}\)-reducibility, Recursively enumerable \(m\)- and \(tt\)-degrees. II: The distribution of singular degrees, Three theorems on tt-degrees, Countable thin \(\Pi^0_1\) classes, Index sets of degrees of unsolvability, Truth tabular degrees of recursively enumerable sets, Recursively enumerable bw-degrees, Positive equivalences, Hereditary sets and tabular reducibility, Lattice properties of Rogers semilattices of compuatble and generalized computable families, Computable permutations and word problems, The members of thin and minimal \(\Pi_1^0\) classes, their ranks and Turing degrees, Hypersimple sets with retraceable complements, T-Degrees, Jump Classes, and Strong Reducibilities, Two Theorems on Truth Table Degrees, Strong reducibilities, Recursively enumerable sets and degrees
Cites Work
- Recursively enumerable many-one degrees
- Three theorems on the degrees of recursively enumerable sets
- Recursive and Recursively Enumerable Orders
- Retraceable Sets
- A Note on Bounded-Truth-Table Reducibility
- Linear orderings under one-one reducibility
- Recursion Theory and Dedekind Cuts
- On Properties of Regressive Sets
- Semirecursive Sets and Positive Reducibility
- Recursive Functions Modulo Co-r-Maximal Sets
- The Degrees of Hyperimmune Sets
- A Theorem on Hypersimple Sets
- Recursively enumerable sets of positive integers and their decision problems
- Creative sets
