Church's thesis: A kind of reducibility axiom for constructive mathematics

Studies in Logic and the Foundations of Mathematics

Volumn 60, Issue C, 1970, Pages 121-150

  Kreisel, G ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77956961206     PISSN: 0049237X     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0049-237X(08)70746-8     Document Type: Article

References (44)

1. E. Bishop, Foundations of constructive analysis, New York (1967).
2. E. Bishop, Mathematics as a numerical language, these proceedings, 53–71.
3. Brouwer, L.E.J., Über Definitionsbereiche von Funktionen. Math. Ann. 97 (1927), 60–76.
4. K. Gödel, Russell's mathematical logic, in The philosophy of Bertrand Russell, ed. Schilpp. Chicago (1944) 123–153.
5. Gödel, K., Über eine bisher noch nicht benützte Erweiterung des finiten Standpunktes. Dialectica 12 (1958), 280–287.
6. K. Gödel, What is Cantor's continuum problem? in Philosophy of mathematics, ed. Benaceraff and Putnam, Englewood Cliffs (1964) 258–273.
7. K. Gödel, Remarks before the Princeton bicentennial conference on problems in mathematics, in The undecidable, ed. Davis, New York (1964) 84–88.
8. N. Goodman, A theory of constructions equivalent to arithmetic, these proceedings. 101–120.
9. J. Herbrand, in Ecrits logiques, ed. van Heijenoort, Paris (1968).
10. A. Heyting, Infinitistic methods from a finitist point of view, in Infinitistic methods, Warsaw (1961) 185–192.
11. W. A. Howard, Assignment of ordinals to terms for primitive recursive functionals of finite type, these proceedings, 443–458.
12. Howard, W.A., Kreisel, G., Transfinite induction and bar induction of types zero and one, and the role of continuity in intuitionistic analysis. J. Symb. Logic 31 (1966), 325–358.
13. L. Kalmar, An argument against the plausibility of Church's thesis, in Constructivity in mathematics, ed. Heyting, Amsterdam (1959) 72–80.
14. S. C. Kleene, Introduction to metamathematics, Princeton (1952).
15. Kleene, S.C., Formalized recursive functionals and formalized realizability. Memoirs Am. Math. Soc., 89, 1969.
16. S. C. Kleene and R. E. Vesley, Foundations of intuitionistic mathematics, Amsterdam (1965).
17. G. Kreisel, Interpretation of classical analysis by means of constructive functionals of finite type, in Constructivity in mathematics, ed. Heyting, Amsterdam (1959) 101–128.
18. Kreisel, G., A remark on free choice sequences and the topological completeness proofs. J. Symb. Logic 23 (1958), 369–387.
19. Kreisel, G., On weak completeness of intuitionistic predicate logic. J. Symb. Logic 27 (1962), 139–158.
20. G. Kreisel, Foundations of intuitionistic logic, in Proc. intern. congress logic, methodology and philosophy of science, 1960, Stanford (1962) 198–210.
21. G. Kreisel, Mathematical Logic, in Lectures on modern mathematics, vol. III, ed. Saaty (1965) 95–195.
22. G. Kreisel, Mathematical logic: What has it done for the philosophy of mathematics? in Bertrand Russell: Philosopher of the century, London (1966) 201–272.
23. G. Kreisel, Informal rigour and completeness proofs, in Problems in the philosophy of mathematics, ed. Lakatos. Amsterdam (1967) 138–171.
24. Kreisel, G., Lawless sequences of natural numbers. Compositio 20 (1968), 222–248.
25. G. Kreisel, Functions, ordinals, species, in Logic, methodology and philosophy of science III, Amsterdam (1968) 145–159.
26. G. Kreisel, Principles of proof and ordinals implicit in given concepts, these proceedings, 489–516.
27. G. Kreisel and J. L. Krivine, Elements of mathematical logic, Amsterdam (1967).
28. Kruse, A.H., Some notions of random sequence and their set theoretic foundations. Z. math. Logik u. Grundl. Math. 13 (1967), 299–322.
29. R. M. Montague, Deterministic theories, in Decision, values and groups, ed. Washburne, New York (1962) 325–370.
30. Mostowski, A., On recursive models of formalized arithmetic. Bull. Acad. Polon. Sci. 5 (1957), 705–710.
31. Myhill, J., Notes towards an axiomatization of intuitionistic analysis. Logique et analyse 35 (1967), 260–297.
32. D. Prawitz, Some results for intuitionistic logic with second order quantifier rules. these proceedings, 259–269.
33. B. Scarpellini, On cut elimination in intuitionistic systems of analysis, these proceedings, 271–285.
34. K. Schütte, Beweistheorie, Berlin (1960).
35. Scott, D., Measurable cardinals and constructible sets. Bull. Acad. Polon. Sci 9 (1961), 521–524.
36. D. Scott, Extending the topological interpretation to intuitionistic analysis II, these proceedings, pp. 235–255.
37. Spector, C., Provably recursive functionals of analysis: a consistency proof of analysis by an extension of principles formulated in current intuitionistic mathematics. Proc. Symp. Pure Math. 5 (1962), 1–27.
38. A. S. Troelstra, The theory of choice sequences, in Logic. methodology and philosophy of science III, Amsterdam (1968) 201–223.
39. D. van Dalen and A. S. Troelstra, Projections of lawless sequences, these proceedings, pp. 163–186.
40. von Neuman, J., Zur Hilbertschen Beweistheorie. Math. Z. 26 (1927), 1–46.
41. Zermelo, E., Untersuchungen über die Grundlagen der Mengenlehre. Math. Ann. 65 (1908), 261–281.
42. Zermelo, E., Über Grenuahlen und Mengenbereiche. Fund. Math. 16 (1930), 29–47.
43. Kreisel, G., Troelstra, A.S., Formal systems for some branches of intuitionistic analysis. Ann. Math. Logic 1:3 (1970), 229–387 (announced in [24] and [38] under the title: A formal system for intuitionistic analysis).
44. Kreisel, G., A Survey of proof Theory. J. Symb. Logic 33 (1968), 321–388.