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

Traces, traceability, and lattices of traces under the set theoretic inclusion

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

DOI10.1007/S00153-013-0348-5zbMath1287.03091OpenAlexW1964021480MaRDI QIDQ377460

Gunther Mainhardt

Publication date: 6 November 2013

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

Full work available at URL: https://doi.org/10.1007/s00153-013-0348-5


zbMATH Keywords

tracescomputably enumerable sets


Mathematics Subject Classification ID

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





Cites Work

  • Classical recursion theory. The theory of functions and sets of natural numbers
  • Algorithmic Randomness and Complexity
  • Recursively enumerable sets and degrees
  • Computability and Randomness




This page was built for publication: Traces, traceability, and lattices of traces under the set theoretic inclusion

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