Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

There is no plus-capping degree

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

DOI10.1007/BF01352932zbMATH Open0806.03031OpenAlexW2025603984MaRDI QIDQ1325049FDOQ1325049

Steffen Lempp, Rodney G. Downey

Publication date: 7 July 1994

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

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



zbMATH Keywords

recursively enumerable degreeplus-capping degrees


Mathematics Subject Classification ID

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


Cites Work

  • Arithmetization of metamathematics in a general setting
  • On certain lattices of degrees of interpretability
  • Non-bounding constructions
  • Minimal pairs in initial segments of the recursively enumerable degrees


Cited In (1)

  • Lattice nonembeddings and intervals of the recursively enumerable degrees






This page was built for publication: There is no plus-capping degree

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1325049&oldid=13454919"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 12:40. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki