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

Set-theoretic structure of computable sets

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

zbMath1081.03044MaRDI QIDQ2387041

Yanyan Li

Publication date: 26 August 2005

Published in: Russian Mathematics (Search for Journal in Brave)



zbMATH Keywords

limit setcomputable functionsimmunitycomputable setspolynomial-time computable setseffective numerationeffectively computable classprimitive recursive sets


Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45) Set theory (03E99)


Related Items (1)

Unnamed Item







This page was built for publication: Set-theoretic structure of computable sets

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