Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

btt-reducibility

From MaRDI portal
Publication:1218850
Jump to:navigation, search

DOI10.1007/BF02219293zbMath0309.02042OpenAlexW4255149363MaRDI QIDQ1218850

G. N. Kobzev

Publication date: 1974

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

Full work available at URL: https://doi.org/10.1007/bf02219293



Mathematics Subject Classification ID

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


Related Items (2)

Relations between reducibilities of table type ⋮ Bounded Immunity and Btt-Reductions




Cites Work

  • Unnamed Item
  • Semirecursive Sets and Positive Reducibility
  • Turing degrees and many-one degrees of maximal sets
  • Some Properties of Recursively Inseparable Sets
  • Some theorems on R-maximal sets and major subsets of recursively enumerable sets




This page was built for publication: btt-reducibility

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1218850&oldid=13286527"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 06:48.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki