- 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
Formulas for Computable and Non-Computable Functions
Rose-Hulman Undergraduate Mathematics Journal 7 (2) (2006)
Abstract
This article has no associated abstract. (fix it)Author's Profile
Other Versions
No versions found
My notes
Similar books and articles
Malitz Jerome. Introduction to mathematical logic. Set theory, computable functions, model theory. Undergraduate texts in mathematics. Springer-Verlag, New York, Heidelberg, and Berlin, 1979, xii + 198 pp. [REVIEW]P. Eklof - 1984 - Journal of Symbolic Logic 49 (2):672-673.
Review: Richard L. Epstein, Walter A. Carnielli, Computability. Computable Functions, Logic, and the Foundations of Mathematics ; Richard L. Epstein, Walter A. Carnielli, Computability. Computable Functions, Logic, and the Foundations of Mathematics. Second Edition of the Preceding. [REVIEW]Carlos Augusto Priscdio - 2002 - Bulletin of Symbolic Logic 8 (1):101-104.
Unsolvable classes of quantificational formulas.Harry R. Lewis - 1979 - Reading, Mass.: Addison-Wesley.
Complexity of $$\Sigma ^0_n$$-classifications for definable subsets.Svetlana Aleksandrova, Nikolay Bazhenov & Maxim Zubkov - 2022 - Archive for Mathematical Logic 62 (1):239-256.
Computability. Computable Functions, Logic, and the Foundations of Mathematics.Richard L. Epstein & Walter A. Carnielli - 2002 - Bulletin of Symbolic Logic 8 (1):101-104.
A New Perspective on Diagonalization and Computability.Yaroslav Sergeyev - 2025 - Internationa Journal of Unconventional Computing 20 (4):329–340.
On local non‐compactness in recursive mathematics.Jakob G. Simonsen - 2006 - Mathematical Logic Quarterly 52 (4):323-330.
Computability. Computable Functions, Logic, and the Foundations of Mathematics. Second Edition of the Preceding.Carlos Augusto Di Prisco, Richard L. Epstein & Walter A. Carnielli - 2002 - Bulletin of Symbolic Logic 8 (1):101.
Computability: Computable Functions, Logic, and the Foundations of Mathematics.Richard L. Epstein - 2004
Derivatives of Computable Functions.Ning Zhong - 1998 - Mathematical Logic Quarterly 44 (3):304-316.
Analytics
Added to PP
2011-05-19
Downloads
1,394 (#31,803)
6 months
169 (#76,752)
2011-05-19
Downloads
1,394 (#31,803)
6 months
169 (#76,752)
Historical graph of downloads
Author's Profile
Citations of this work
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