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

Iterated relative recursive enumerability

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

DOI10.1007/BF01278463zbMath0810.03035OpenAlexW2153470928MaRDI QIDQ1344547

Peter G. Hinman, Peter A. Cholak

Publication date: 20 April 1995

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

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


zbMATH Keywords

recursively enumerable degreerecursively enumerable set\(m\)-REA degreeiterated hops


Mathematics Subject Classification ID

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


Related Items (4)

Extending properly n - REA sets1 ⋮ Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting) ⋮ Isolation in the CEA hierarchy ⋮ Relative enumerability in the difference hierarchy




Cites Work

  • Pseudo Jump Operators. I: The R. E. Case
  • Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
  • Unnamed Item




This page was built for publication: Iterated relative recursive enumerability

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