On the maximality of some pairs of p-t degrees

DOI10.1305/NDJFL/1093634561zbMATH Open0783.03021OpenAlexW2003913728MaRDI QIDQ689190

Xizhong Zheng

Publication date: 20 March 1994

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

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

zbMATH Keywords

minimal pairbranching pairexact pairpolynomial time degreesrecursive p-t degrees

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursively (computably) enumerable sets and degrees (03D25)

Related Items (1)

Turán's theorem and maximal degrees

Recommendations

• Maximal projective degrees for strict partitions 👍 👎
• Turán's theorem and maximal degrees 👍 👎
• A max version of the Perron-Frobenius theorem 👍 👎
• Maximal rank for \(T_{\mathbb{P}^n}\) 👍 👎
• On the maximum degree of path-pairable planar graphs 👍 👎
• On the Maximum Degree of an LCP Map 👍 👎
• Mixed Multiplicities of Maximal Degrees (J. Korean Math. Soc. 55 (2018), No. 3, 605-622) 👍 👎
• On minimal pairs of enumeration degrees 👍 👎
• Maximality of pbw extensions of orders 👍 👎
• On maximal and minimal elements of partially ordered sets of Boolean degrees 👍 👎

This page was built for publication: On the maximality of some pairs of p-t degrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689190)