On maximal and minimal elements of partially ordered sets of Boolean degrees

DOI10.1134/S1990478913040091MaRDI QIDQ5263813zbMATH OpenFDO

Authors S. S. Marchenkov

Publication date 17 July 2015

Published in Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

zbMATH Keywords

closed class of Boolean functionsBoolean reducibility

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30)

Recommendations

• On the structure of partially ordered sets of Boolean degrees
• Boolean reducibility
• Complete and incomplete Boolean degrees
• scientific article; zbMATH DE number 1524190
• On a quasi-ordering on Boolean functions

Cited in

(7)

• On the maximality of some pairs of p-t degrees
• scientific article; zbMATH DE number 1524190 (Why is no real title available?)
• Boolean reducibility
• On the structure of partially ordered sets of Boolean degrees
• Complete and incomplete Boolean degrees
• Reducibility by means of almost polynomial functions
• BOOLEAN CLASSES OF TURING REDUCTIONS

This page was built for publication: On maximal and minimal elements of partially ordered sets of Boolean degrees

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