The unfolding of non-finitist arithmetic

Annals of Pure and Applied Logic

Volumn 104, Issue 1-3, 2000, Pages 75-96

  Feferman, Solomon ^a   Strahm, Thomas ^b  

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITY OF BERN   (Switzerland)

Author keywords

Generalized recursion theory; Non finitist arithmetic; Predicative analysis; Schematic formal systems

Indexed keywords

EID: 0010740735     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-0072(00)00008-7     Document Type: Article

References (16)

1. M.J. Beeson, Foundations of Constructive Mathematics: Metamathematical Studies, Springer, Berlin, 1985.
2. S. Feferman, A more perspicuous system for predicativity, in Konstruktionen vs. Positionen I, de Gruyter, Berlin, 1979, pp. 87-139.
3. S. Feferman, Reflecting on incompleteness, J. Symbolic Logic 56 (1) (1991) 1-49.
4. S. Feferman, A new approach to abstract data types, II. Computation on ADTs as ordinary computation, in: E. Börger et al. (Ed.), Computer Science Logic '91, Lecture Notes in Computer Science, vol. 626, Springer, Berlin, 1992, pp. 79-95.
5. S. Feferman, Computation on abstract data types. The extensional approach, with an application to streams, Ann. Pure Appl. Logic 81 (1996) 75-113.
6. S. Feferman, Gödel's program for new axioms: why, where, how and what?, in: P. Hájek (Ed.), Gödel '96, Lecture Notes in Logic, vol. 6, Springer, Berlin, 1996, pp. 3-22.
7. S. Feferman, G. Jäger, Systems of explicit mathematics with non-constructive μ-operator. Part I, Ann. Pure Appl. Logic 65 (3) (1993) 243-263.
8. S. Feferman, G. Jäger, Systems of explicit mathematics with non-constructive μ-operator. Part II, Ann. Pure Appl. Logic 79 (1) (1996) 37-52.
9. T. Glass, T. Strahm, Systems of explicit mathematics with non-constructive μ-operator and join, Ann. Pure Appl. Logic 82 (1996) 193-219.
10. G. Jäger, Fixed points in Peano arithmetic with ordinals, Ann. Pure Appl. Logic 60 (2) (1993) 119-132.
11. Y. Moschovakis, The formal language of recursion, J. Symbolic Logic 54 (1989) 1216-1252.
12. R. Platek, Foundations of recursion theory, Ph.D. Thesis, Stanford University, 1966.
13. W. Pohlers, in: Proof Theory: An Introduction, Lecture Notes in Mathematics, vol. 1407, Springer, Berlin, 1988.
14. M. Rathjen, The role of parameters in bar rule and bar induction, J. Symbolic Logic 56 (2) (1991) 715-730.
15. K. Schütte, Proof Theory, Springer, Berlin, 1977.
16. T. Strahm, The non-constructive μ operator, fixed point theories with ordinals, and the bar rule, Ann. Pure Appl. Logic 104 (2000) 305-324.