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

Turing degrees and many-one degrees of maximal sets

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

DOI10.2307/2271152zbMath0198.02503OpenAlexW4243050924MaRDI QIDQ5596232

Manuel Lerman

Publication date: 1970

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

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


zbMATH Keywords

recursion theory, constructive mathematics



Related Items (7)

Some theorems on R-maximal sets and major subsets of recursively enumerable sets ⋮ btt-reducibility ⋮ On btt-reducibilities. II ⋮ Index sets of degrees of unsolvability ⋮ Recursively enumerable sets and degrees ⋮ Hypersimple sets with retraceable complements ⋮ Strong reducibilities




This page was built for publication: Turing degrees and many-one degrees of maximal sets

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5596232&oldid=30233785"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 7 March 2024, at 03:51.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki