On the structure of partially ordered sets of Boolean degrees

DOI10.1515/156939206776241237MaRDI QIDQ5491241zbMATH OpenOpenAlexFDO

Authors S. S. Marchenkov

Publication date 10 October 2006

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/156939206776241237

zbMATH Keywords

Boolean functionsinformational complexity

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Combinatorics of partially ordered sets (06A07) Boolean functions (06E30)

Recommendations

• On maximal and minimal elements of partially ordered sets of Boolean degrees
• Boolean reducibility
• Complete and incomplete Boolean degrees
• On a quasi-ordering on Boolean functions
• BOOLEAN CLASSES OF TURING REDUCTIONS

Cited in

(8)

• Partial ordering of degrees of alternative m-reducibility
• Boolean term orders and the root system B_n
• scientific article; zbMATH DE number 2047485 (Why is no real title available?)
• Boolean reducibility
• On maximal and minimal elements of partially ordered sets of Boolean degrees
• Partially ordered sets of sequences and the related Boolean algebras
• Reducibility by means of almost polynomial functions
• Complete and incomplete Boolean degrees

This page was built for publication: On the structure 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 Q5491241)