Operazioni di Brouwer e realizzabilità formalizzata

 Access to full text

 Full (PDF)

1. [1] P. Bernays, Sur le platonisme dans les mathématiques, L'Enseignement Mathématique, vol. 34 (1935), pp. 52-69. Zbl0014.00101JFM61.0047.03
2. [2] H.B. Curry, Foundations of mathematical logic, New York (Mc Graw-Hill) 1963, pp. xii + 408. Zbl0163.24209MR148529
3. [3] N.D. Goodman, Intuitionistic arithmetic as a theory of constructions, tesi, Stanford University, 1968, pp. v + 111. 
4. [4] A. Heyting, Blick von der intuitionistischen Warte, Dialectica, vol.12 (1958), pp. 332-345. Zbl0089.24502MR99924
5. [5] S.C. Kleene, On, the interpretation of intuitionistic number theory, The Journal of Symbolic Logic, vol. 10 (1945), pp. 109-124. Zbl0063.03260MR15346
6. [6] S.C. Kleene, Introduction to metamathematics, Amsterdam (North-Holland) e Groningen (Noordhoff) 1952, pp. x + 550. Zbl0047.00703MR51790
7. [7] S.C. Kleene, Realizability and Shanin's algorithm for the constructive deciphering of mathematical sentences, Logique et Analyse, vol. 3 (1960), pp. 154-165. MR103826
8. [8] S.C. Kleene, Classical extensions of intuitionistic mathematics, in Logic, methodology and philosophy of science II, Proceedings of the 1964 international congress, a cura, di Y. BAR-HILLEL, Amsterdam (North-Holland) 1965, pp. 31-44. Zbl0192.03002MR209124
9. [9] S.C. Kleene, Formalized recursive functionals and formalized realizability, Memoirs of the American Mathematical Society, N. 89, Providence, R. I. (American Mathematical Society) 1969, pp. 106. Zbl0184.02004MR244002
10. [10] S.C. Kleene R.E. Vesley, The foundations of intuitionistic mathematics, especially in relation to recursive functions, Amsterdam (North-Holland) 1965, pp. viii+ 206. Zbl0133.24601MR176922
11. [11] G. Kreisel, Mathematical logic, in Lectures on modern mathematics, a cura di T. L. SAATY, vol. III, New York (Wiley) 1965, pp. 95-195. Zbl0147.24703MR177866
12. [12] G. Kreisel, Lawless sequences of natural numbers. Compositio Mathematica, vol. 20 (1968), pp. 222-248. Zbl0157.33401MR226992
13. [13] G. Kreisel, Church's thesis : a kind of reducibility axiom for constructive mathematics, in Intuitionism and proof theory, Proceedings of the summer conference at Buffalo N. Y. 1968, a cura di A. Kino, J. Myhill e R.E. Vesiley, Amsterdam (North-Holland) 1970, pp. viii + 516. Zbl0199.30001MR270891
14. [14] G. Kreisel A.S. Troelstra, Formal Systems for some branches of intuitionistic analysis, Annals of Mathematical Logic, vol. 1 (1970), pp. 229-387. Zbl0211.01101MR263609
15. [15] D. Prawitz, Natural deduction. A proof-theoretical study, Stockholm (Almqvist & Wiksell) 1965, pp. 113. Zbl0173.00205MR193005
16. [16] C. Spector, Provably recursive functionals of analysis: a consistency proof of analysis by an extension of principles formulated in current intuitioniatics mathematics, in Recursive function theory, Proceedings of symposia in pure mathematics, vol. 5, a cura di J.C.E. Derker, Providence, R. I. (American Mathematical Society) 1962, pp. 1-27. Zbl0143.25502MR154801
17. [17] A.S. Troelstra, The theory of choice sequences, in Logic, methodology and philosophy of science III, Proceedings of the third international congress, a cura di B. VAN ROOTSELAAR e J. F. STAAL, Amsterdam (North-Holland) 1968, pp. 201-223. Zbl0185.01002MR252206
18. [18] A.S. Troelstra, Notions of realizability for intuitionistic arithmetic in all finite types, in Proceedings of the Second Scandinavian Logic Symposium, a cura di J.E. Fenstad, in corso di pubblicazione. Zbl0227.02015