Convex subsets of 2ⁿ and bounded truth-table reducibility

DOI10.1016/0012-365X(78)90145-0zbMATH Open0377.02036MaRDI QIDQ1246530FDOQ1246530

Authors: Louise Hay 

Publication date: 1978

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Lattice Theoretic Properties of Frontal Switching Functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• A discrete chain of degrees of index sets
• Title not available (Why is that?)
• A Reducibility Condition for Recursiveness

Cited In (3)

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

This page was built for publication: Convex subsets of \(2^n\) and bounded truth-table reducibility

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