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

Every incomplete computably enumerable truth-table degree is branching

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

DOI10.1007/s001530000050zbMath0981.03045OpenAlexW1990940731MaRDI QIDQ5931217

Peter A. Fejer, Richard A. Shore

Publication date: 21 March 2002

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

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


zbMATH Keywords

branching degreecomputably enumerable truth-table degree


Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)





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