Differences between resource bounded degree structures

DOI10.1305/ndjfl/1082637612zbMath1068.03034OpenAlexW1993066088MaRDI QIDQ558725

Michael E. Mytilinaios, Theodore A. Slaman

Publication date: 13 July 2005

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1082637612

zbMATH Keywords

Turing degreepolynomial-time degreetruth-table degree

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Other Turing degree structures (03D28)

Related Items (1)

Automorphisms of the truth-table degrees are fixed on a cone

Cites Work

• On the theory of the PTIME degrees of the recursive sets
• The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory
• Interpretability and Definability in the Recursively Enumerable Degrees
• The Theory of the Degrees below 0 ′
• On the Structure of Polynomial Time Reducibility
• Unnamed Item
• Unnamed Item

This page was built for publication: Differences between resource bounded degree structures