The p-T-degrees of the recursive sets: lattice embeddings, extensions of embeddings and the two-quantifier theory
Open Access
- 27 April 1992
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 97 (2) , 263-284
- https://doi.org/10.1016/0304-3975(92)90078-t
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Decidability and invariant classes for degree structuresTransactions of the American Mathematical Society, 1988
- Density of a final segment of the truth-table degreesPacific Journal of Mathematics, 1984
- Oracle-dependent properties of the lattice of NP setsTheoretical Computer Science, 1983
- A note on structure and looking back applied to the relative complexity of computable functionsJournal of Computer and System Sciences, 1981
- Countable initial segments of the degrees of unsolvabilityThe Journal of Symbolic Logic, 1976
- On the Structure of Polynomial Time ReducibilityJournal of the ACM, 1975
- Initial Segments of the Degrees of UnsolvabilityAnnals of Mathematics, 1971
- Distributive Initial Segments of the Degrees of UnsolvabilityMathematical Logic Quarterly, 1968
- On Degrees of Recursive UnsolvabilityAnnals of Mathematics, 1956
- The Upper Semi-Lattice of Degrees of Recursive UnsolvabilityAnnals of Mathematics, 1954