- 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
On the Definition of Computable Function of a Real Variable
Mathematical Logic Quarterly 22 (1):391-402 (1976)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
On the Definition of Computable Function of a Real Variable.J. C. Shepherdson - 1976 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 22 (1):391-402.
On a simple definition of computable function of a real variable‐with applications to functions of a complex variable.Marian Boykan Pour-El & Jerome Caldwell - 1975 - Mathematical Logic Quarterly 21 (1):1-19.
Review: J. C. Shepherdson, A Non-Standard Model for a Free Variable Fragment of Number Theory. [REVIEW]R. L. Goodstein - 1965 - Journal of Symbolic Logic 30 (3):389-390.
The shortest definition of a number in Peano arithmetic.Dev K. Roy - 2003 - Mathematical Logic Quarterly 49 (1):83-86.
H‐monotonically computable real numbers.Xizhong Zheng, Robert Rettinger & George Barmpalias - 2005 - Mathematical Logic Quarterly 51 (2):157-170.
Derivatives of Computable Functions.Ning Zhong - 1998 - Mathematical Logic Quarterly 44 (3):304-316.
Review: A. Frohlich, J. C. Shepherdson, On the Factorisation of Polynomials in a Finite Number of Steps; A. Frohlich, J. C. Shepherdson, Effective Procedures in Field Theory. [REVIEW]Michael O. Rabin - 1959 - Journal of Symbolic Logic 24 (2):169-170.
Index sets for computable differential equations.Douglas Cenzer & Jeffrey B. Remmel - 2004 - Mathematical Logic Quarterly 50 (4-5):329-344.
Predictably computable functionals and definition by recursion.D. L. Kreider & R. W. Ritchie - 1964 - Mathematical Logic Quarterly 10 (5):65-80.
Analytics
Added to PP
2013-11-24
Downloads
13 (#1,044,693)
6 months
6 (#702,272)
2013-11-24
Downloads
13 (#1,044,693)
6 months
6 (#702,272)
Historical graph of downloads
Citations of this work
Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I.Iraj Kalantari & Lawrence Welch - 1998 - Annals of Pure and Applied Logic 93 (1-3):125-151.
A computable ordinary differential equation which possesses no computable solution.Marian Boylan Pour-el - 1979 - Annals of Mathematical Logic 17 (1):61.
Conditional computability of real functions with respect to a class of operators.Ivan Georgiev & Dimiter Skordev - 2013 - Annals of Pure and Applied Logic 164 (5):550-565.
Approximation to measurable functions and its relation to probabilistic computation.Ker-I. Ko - 1986 - Annals of Pure and Applied Logic 30 (2):173-200.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
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
Server: philpapers-web-6686886f5-7g5mb uwo