Hostname: page-component-586b7cd67f-dsjbd Total loading time: 0 Render date: 2024-12-04T09:33:47.873Z Has data issue: false hasContentIssue false
  • English
  • Français

Systems of predicative analysis1

Published online by Cambridge University Press:  12 March 2014

Solomon Feferman
Solomon Feferman*
Affiliation:
Stanford University
Get access Rights & Permissions [Opens in a new window]

Extract

This paper is divided into two parts. Part I provides a resumé of the evolution of the notion of predicativity. Part II describes our own work on the subject.

Part I

§1. Conceptions of sets. Statements about sets lie at the heart of most modern attempts to systematize all (or, at least, all known) mathematics. Technical and philosophical discussions concerning such systematizations and the underlying conceptions have thus occupied a considerable portion of the literature on the foundations of mathematics.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 29 , Issue 1 , March 1964 , pp. 1 - 30
Copyright
Copyright © Association for Symbolic Logic 1964

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

1

Text of an invited address delivered to a meeting of the Association for Symbolic Logic at Berkeley, California, on January 26, 1963.

References

[1]Feferman, S., Classifications of recursive functions by means of hierarchies, Transactions of the American Mathematical Society, vol. 104 (1962), pp. 101–122.CrossRefGoogle Scholar
[2]Feferman, S., Transfinite recursive progressions of axiomatic theories, this Journal, vol. 27 (1962), pp. 259–316.Google Scholar
[3]Gandy, R., Kreisel, G., and Tait, W., Set existence, Bulletin de l'Académie Polonaise des Sciences, Série des sciences mathématiques, astronomiques et physiques, vol. 8 (1960), pp. 577–582.Google Scholar
[4]Gödel, K., Russell's mathematical logic, The philosophy of Bertrand Russell, New York, 1944, pp. 125–153.Google Scholar
[5]Gödel, K., The consistency of the axiom of choice and the generalized continuum hypothesis with the axioms of set theory, Annals of Mathematics Studies No. 3, Princeton (1940).Google Scholar
[6]Grzegorczyck, A., Elementary definable analysis, Fundamenta mathematica, vol. 41 (1955), pp. 311–338.CrossRefGoogle Scholar
[7]Kleene, S. C., Hierarchies of number-theoretic predicates, Bulletin of the American Mathematical Society, vol. 61 (1955), pp. 193–213.CrossRefGoogle Scholar
[8]Kleene, S. C., On the forms of predicates in the theory of constructive ordinals, II, American journal of mathematics, vol. 77 (1955), pp. 405–428.CrossRefGoogle Scholar
[9]Kleene, S. C., Quantification of number-theoretic functions, Compositio Mathematica, vol. 14 (1959), pp. 23–40.Google Scholar
[10]Kreisel, G., La predicativité, Bulletin de la Société Mathématique de France, vol. 88 (1960), pp. 371–391.CrossRefGoogle Scholar
[11]Kreisel, G., Ordinal logics and the characterization of informal concepts of proof, Proceedings of the International Congress of Mathematicians (1958); pp. 289–299.Google Scholar
[12]Kreisel, G., Ordinals of ramified analysis (abstract), this Journal, vol. 25 (1960), pp. 390–391.Google Scholar
[13]Kreisel, G., The axiom of choice and the class of hyperarithmetic functions, Koninklijke Nederlandse Akademie van Wetenschappen, Proceedings, ser. A, vol. 65 (also Indagationes mathematicae, vol. 24), (1962), pp. 307–319.Google Scholar
[14]Kond, M.ô, Sur les ensembles nommables et le fondement de l'analyse mathématique I, Japanese journal of mathematics, vol. 28 (1958), pp. 1–116.CrossRefGoogle Scholar
[15]Lorenzen, P., Logical reflection and formalism, this Journal, vol. 23 (1958), pp. 241–249.Google Scholar
[16]Lorenzen, P. and Myhill, J., Constructive definition of certain analytic sets of numbers, this Journal, vol. 24 (1959), pp. 37–49.Google Scholar
[17]Schütte, K., Beweistheorie, Springer-Verlag, Berlin, 1960.Google Scholar
[18]Schütte, K., Eine Grenze für die Beweisbarkeit der transfiniten Induktion in der verzweigten Typenlogik, to appear.Google Scholar
[19]Schütte, K., Kennzeichnung von Ordnungszahlen durch rekursiv erklärte Funktionen, Mathematische Annalen, vol. 127 (1954), pp. 15–32.CrossRefGoogle Scholar
[20]Spector, C., Provably recursive functionals of analysis: a consistency proof of analysis by an extension of principles formulated in current intuitionistic mathematics, Recursive function theory. Proceedings of symposia in pure mathematics (Providence), vol. 5 (1962), pp. 1–27.CrossRefGoogle Scholar
[21]Spector, C., Recursive well-orderings, this Journal, vol. 20 (1955), pp. 151–163.Google Scholar
[22]Tait, W. W., The ε-substitution method, to appear.Google Scholar
[23]Takeuti, G., On the fundamental conjecture of GLC. VI, Proceedings of the Japan Academy, vol. 37 (1961), pp. 440–443.Google Scholar
[24]Takeuti, G., On the inductive definition with quantifiers of second order, Journal of the Mathematical Society of Japan, vol. 13 (1961), pp. 333–341.CrossRefGoogle Scholar
[25]Veblen, O., Continuous increasing functions of finite and transfinite ordinals, Transactions of the American Mathematical Society, vol. 9 (1908), pp. 280–292.CrossRefGoogle Scholar
[26]Wang, H., A survey of mathematical logic, Amsterdam, North-Holland Publishing Company, 1963.Google Scholar
[27]Wang, H., Ordinal numbers and predicative set theory, Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 5 (1959), pp. 216–239.CrossRefGoogle Scholar
[28]Wang, H., The formalization of mathematics, this Journal, vol. 19 (1954), pp. 241–266.Google Scholar
[29]Weyl, H., Das Kontinuum. Kritische Untersuchungen über die Grundlagen der Analysis, Leipzig (1918), iv + 84 pp.CrossRefGoogle Scholar
[30]Whitehead, A. N. and Russell, B., Principia mathematica, vol. I, Cambridge University Press, Cambridge, 2nd edition, 1925.Google Scholar