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
Discussion
View source
View history
Purge
English
Log in

General Recursion Theory

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

DOI10.1017/9781316717073zbMath1365.03006OpenAlexW2493908645MaRDI QIDQ5274768

Jens Erik Fenstad

Publication date: 6 July 2017

Full work available at URL: https://doi.org/10.1017/9781316717073


zbMATH Keywords

finitenessadmissible setcomputable setsprewellorderingSpector classsemi computable sets


Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25) Other degrees and reducibilities in computability and recursion theory (03D30) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Higher-type and set recursion theory (03D65) Inductive definability (03D70) Hierarchies of computability and definability (03D55) Abstract and axiomatic computability and recursion theory (03D75)


Related Items (1)

Kleene computable functionals and the higher order existence property







This page was built for publication: General Recursion Theory

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