A Note on Bounded-Truth-Table Reducibility

DOI10.2307/2035018zbMath0124.24602OpenAlexW4255102831MaRDI QIDQ5328148

Patrick C. Fischer

Publication date: 1963

Full work available at URL: https://doi.org/10.2307/2035018

zbMATH Keywords

mathematical logic

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Related Items (4)

Recursively enumerable \(m\)- and \(tt\)-degrees. II: The distribution of singular degrees ⋮ On Semi-Cylinders, Splinters, and Bounded-Truth-Table Reducibility ⋮ Relationships Between Reducibilities ⋮ An answer to a question by P. R. Young

Cites Work

• Quasicreative Sets
• The Present Theory of Turing Machine Computability
• Two Notes on Recursively Enumerable Sets
• A Theorem on Hypersimple Sets
• Recursively enumerable sets of positive integers and their decision problems
• Creative sets

This page was built for publication: A Note on Bounded-Truth-Table Reducibility