BOOLEAN CLASSES OF TURING REDUCTIONS

DOI10.1070/IM1986V026N01ABEH001131zbMATH Open0612.03019OpenAlexW2079984816MaRDI QIDQ3752373FDOQ3752373

V. K. Bulitko

Publication date: 1986

Published in: Mathematics of the USSR-Izvestiya (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1070/im1986v026n01abeh001131

zbMATH Keywords

ordered pairs of Boolean functionssub-Turing reducibility

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Other degrees and reducibilities in computability and recursion theory (03D30)

Cited In (2)

• Boolean reducibility
• Turing-Complete Subclasses of CHR

   Recommendations

• Sub-Turing reducibilities of restricted complexity 👍 👎
• Boolean reducibility 👍 👎
• Title not available (Why is that?) 👍 👎
• On maximal and minimal elements of partially ordered sets of Boolean degrees 👍 👎
• \(m\)-reducibility with upper and lower bounds for reducing functions 👍 👎

This page was built for publication: BOOLEAN CLASSES OF TURING REDUCTIONS

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