- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Recursion theory: computational aspects of definability
Boston: Walter de Gruyter GmbH & Co., KG. Edited by Liang Yu (2015)
Abstract
The series is devoted to the publication of high-level monographs on all areas of mathematical logic and its applications. It is addressed to advanced students and research mathematicians, and may also serve as a guide for lectures and for seminars at the graduate level.Other Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Recursion theory and complexity: proceedings of the Kazan '97 Workshop, Kazan, Russia, July 14-19, 1997.Marat Mirzaevich Arslanov & Steffen Lempp (eds.) - 1999 - New York: W. de Gruyter.
Recursion theory for metamathematics.Raymond Merrill Smullyan - 1993 - New York: Oxford University Press.
The equivalence of bar recursion and open recursion.Thomas Powell - 2014 - Annals of Pure and Applied Logic 165 (11):1727-1754.
Transfinite recursion and computation in the iterative conception of set.Benjamin Rin - 2015 - Synthese 192 (8):2437-2462.
On generalized computational complexity.Barry E. Jacobs - 1977 - Journal of Symbolic Logic 42 (1):47-58.
On Spector's bar recursion.Paulo Oliva & Thomas Powell - 2012 - Mathematical Logic Quarterly 58 (4-5):356-265.
General recursion theory: an axiomatic approach.Jens Erik Fenstad - 1980 - New York: Springer Verlag.
Analytics
Added to PP
2022-12-16
Downloads
39 (#1,397,435)
6 months
18 (#639,411)
2022-12-16
Downloads
39 (#1,397,435)
6 months
18 (#639,411)
Historical graph of downloads
Citations of this work
On the hausdorff dimension of maximal chains and antichains of turing and hyperarithmetic degrees.Sirun Song & Liang Yu - 2025 - Archive for Mathematical Logic 65 (2):213-238.
Turing invariant sets and the perfect set property.Clovis Hamel, Haim Horowitz & Saharon Shelah - 2020 - Mathematical Logic Quarterly 66 (2):247-250.
Π11‐Martin‐Löf randomness and Π11‐Solovay completeness.Claude Sureson - 2019 - Mathematical Logic Quarterly 65 (3):265-279.
Try MATCHA Writer if you're interested in citing directly from PhilPapers and certifying your authorship.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation