Relations between reducibilities of table type

DOI10.1007/BF01978978zbMath0544.03017OpenAlexW2079871618MaRDI QIDQ796521

A. N. Degtev

Publication date: 1983

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/187220

zbMATH Keywords

elementary theoriesrecursively enumerable degreesreducibilities of table typeupper semilattices

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (1)

Relations between reducibilities of table type

Cites Work

• Unnamed Item
• Unnamed Item
• Relations between reducibilities of table type
• btt-reducibility
• Recursively Enumerable Sets and Retracing Functions
• ON RECURSIVELY ENUMERABLE MINIMAL BTT-DEGREES
• A note on universal sets

This page was built for publication: Relations between reducibilities of table type