On the embedding of distributive lattices into recursive polynomial degrees

DOI10.1007/BF02565021zbMath0637.03039MaRDI QIDQ3778007

Xiaofeng Han

Publication date: 1987

Published in: Acta Mathematica Sinica (Search for Journal in Brave)

zbMATH Keywords

embeddingdistributive latticecountable atomless Boolean algebrapolynomial T-degrees

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Other degrees and reducibilities in computability and recursion theory (03D30)

Cites Work

• Unnamed Item
• On the Structure of Polynomial Time Reducibility

This page was built for publication: On the embedding of distributive lattices into recursive polynomial degrees