A Note on Bounded-Truth-Table Reducibility

DOI10.2307/2035018zbMATH Open0124.24602OpenAlexW4255102831MaRDI QIDQ5328148FDOQ5328148

Authors: 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)

Cites Work

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

Cited In (8)

• Relationships Between Reducibilities
• Recursively enumerable \(m\)- and \(tt\)-degrees. II: The distribution of singular degrees
• On Semi-Cylinders, Splinters, and Bounded-Truth-Table Reducibility
• Title not available (Why is that?)
• Weak mitoticity of bounded disjunctive and conjunctive truth-table autoreducible sets
• PP is closed under truth-table reductions
• An answer to a question by P. R. Young
• Schnorr trivial sets and truth-table reducibility

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

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