Convex subsets of \(2^n\) and bounded truth-table reducibility

DOI10.1016/0012-365X(78)90145-0zbMath0377.02036MaRDI QIDQ1246530

Louise Hay

Publication date: 1978

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Structure theory of Boolean algebras (06E05) Logical aspects of Boolean algebras (03G05) Computability and recursion theory (03D99) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items

Bounded query classes and the difference hierarchy, Fine hierarchies and Boolean terms, The complexity of ODD_n^A

Cites Work

• A Reducibility Condition for Recursiveness
• A discrete chain of degrees of index sets
• Lattice Theoretic Properties of Frontal Switching Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item