Abstract
Many philosophical problems take the form: What is x? For example, what is time? What is truth? What is good? What is probability? What is a set? What is a number?
Not published previously.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Wilhelm Ackermann 1950. “Zur Widersprucksfreiheit der Zahlentheorie.” Mathematische Annalen, Vol. 117, pp. 162–194.
Wilhelm Ackermann 1951. “Konstruktiver Aufbau eines Abschnitts der zweiten Cantorschen Zahlenklasse.” Mathematische Zeitschrift, vol. 53.
L. E. J. Brouwer 1912. “Intuitionism and formalism.” Trans. in Bulletin of American Mathematical Society (November, 1913).
Alonzo Church 1936. “An unsolvable problem of elementary number theory.” American journal of mathematics, vol. 58, pp. 345–363.
Alonzo Church 1938. “The constructive second number class.” Bulletin of American Mathematical Society, vol. 44, pp. 224–232.
Kurt Gödel 1934. On undecidable propositions of formal mathematical systems. Princeton, N.J., 30 pp.
D. Hilbert and P. Bernays (HB) 1939. Grundlagen der Mathematik, vol. II.
S. C. Kleene 1943. “Recursive predicates and quantifiers.” Transactions of the American Mathematical Society, vol. 53, pp. 41–73.
S. C. Kleene 1952. Introduction to metamatheamtics. Amsterdam.
G. Kreisel 1952. “On the interpretation of non-finitist proofs, Part II.” Journal of Symbolic Logic, vol. 17, pp. 43–58.
Rózsa Péter 1951. Rekursive Funktionen. Budapest, 206 pp. Compare also review of the work by R. M. Robinson, Journal of Symbolic Logic, vol. 16 (1951), especially last paragraph of p. 281.
A. M. Turing 1936–37. “On computable numbers.” Proceedings of the London Mathematical Society, vol. 42, pp. 230–265.
A. M. Turing 1939. Ibid., vol. 45, pp. 161–228.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1990 Science Press, Beijing, China and Kluwer Academic Publishers, Dordrecht, Holland
About this chapter
Cite this chapter
Wang, H. (1990). The Concept of Computability. In: Computation, Logic, Philosophy. Mathematics and its Application (China Series), vol 2. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-2356-0_2
Download citation
DOI: https://doi.org/10.1007/978-94-009-2356-0_2
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-7561-9
Online ISBN: 978-94-009-2356-0
eBook Packages: Springer Book Archive