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

DOI10.1134/S1990478913040091zbMATH Open1324.03012MaRDI QIDQ5263813FDOQ5263813

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)

Cited In (4)

• On the maximality of some pairs of p-t degrees
• Title not available (Why is that?)
• Boolean reducibility
• Reducibility by means of almost polynomial functions

   Recommendations

• On the structure of partially ordered sets of Boolean degrees 👍 👎
• Boolean reducibility 👍 👎
• Complete and incomplete Boolean degrees 👍 👎
• Title not available (Why is that?) 👍 👎
• On a quasi-ordering on Boolean functions 👍 👎

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)