The non-constructive μ operator, fixed point theories with ordinals, and the bar rule

Annals of Pure and Applied Logic

Volumn 104, Issue 1-3, 2000, Pages 305-324

  Strahm, Thomas ^a  

^a UNIVERSITY OF BERN   (Switzerland)

Author keywords

Applicative theories; Bar rule; Non constructive operator; Theories with ordinals

Indexed keywords

EID: 0010696689     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0168-0072(00)00016-6     Document Type: Article

References (25)

1. M.J. Beeson, Foundations of Constructive Mathematics: Metamathematical Studies, Springer, Berlin, 1985.
2. A. Cantini, A note on a predicatively reducible theory of iterated elementary induction, Boll. Un. Math. Ital. 4-B (6) (1985) 413-430.
3. S. Feferman, Systems of predicative analysis, J. Symbolic Logic 29 (1) (1964) 1-30.
4. S. Feferman, Autonomous transfinite progressions and the extent of predicative mathematics, in: B. van Rootselaar, J. Staal (Eds.), Logic, Methodology and Philosophy of Science III, North-Holland, Amsterdam, 1968, pp. 121-135.
5. S. Feferman, Formal theories for transfinite iteration of generalized inductive definitions and some subsystems of analysis, in: A. Kino, J. Myhill, R.E. Vesley (Eds.), Intuitionism and Proof Theory, Proceedings of the Summer Conference at Buffalo, New York, 1968, North-Holland, Amsterdam, 1970, pp. 303-326.
6. S. Feferman, A language and axioms for explicit mathematics, in: J. Crossley (Ed.), Algebra and Logic, Lecture Notes in Mathematics, Vol. 450, Springer, Berlin, 1975, pp. 87-139.
7. S. Feferman, Constructive theories of functions and classes, in: M. Boffa, D. van Dalen, K. McAloon (Eds.), Logic Colloquium'78, North-Holland, Amsterdam, 1979, pp. 159-224.
8. S. Feferman, G. Jäger, Choice principles, the bar rule and autonomoulsy iterated comprehension schemes in analysis, J. Symbolic Logic 48 (1) (1982) 63-70.
9. S. Feferman, G. Jäger, Systems of explicit mathematics with non-constructive μ-operator. Part I, Ann. Pure Appl. Logic 65 (3) (1993) 243-263.
10. S. Feferman, G. Jäger, Systems of explicit mathematics with non-constructive μ-operator. Part II, Ann. Pure Appl. Logic 79 (1) (1996) 37-52.
11. S. Feferman, T. Strahm, The unfolding of non-finitist arithmetic, Ann. Pure Appl. Logic 104 (2000) 75-96.
12. 2-AC, in: A. Kino, J. Myhill, R.E. Vesley (Eds.), Intuitionism and Proof Theory, Proc. Summer Conf. at Buffalo, New York, 1968, North-Holland, Amsterdam, 1970, pp. 435-442.
13. T. Glass, T. Strahm, Systems of explicit mathematics with non-constructive μ-operator and join, Ann. Pure Appl. Logic 82 (1996) 193-219.
14. G. Jäger, Theories for Admissible Sets: A Unifying Approach to Proof Theory, Bibliopolis, Napoli, 1986.
15. G. Jäger, Fixed points in Peano arithmetic with ordinals, Ann. Pure Appl. Logic 60 (2) (1993) 119-132.
16. G. Jäger, T. Strahm, Second order theories with ordinals and elementary comprehension, Arch. Math. Logic 34 (6) (1995) 345-375.
17. G. Jäger, T. Strahm, Totality in applicative theories, Ann. Pure Appl. Logic 74 (2) (1995) 105-120.
18. G. Jäger, T. Strahm, Some theories with positive induction of ordinal strength φω0, J. Symbolic Logic 61 (3) (1996) 818-842.
19. M. Marzetta, T. Strahm, The μ quantification operator in explicit mathematics with universes and iterated fixed point theories with ordinals, Arch. Math. Logic 37 (5+6) (1998) 391-413.
20. W. Pohlers, Proof Theory: An Introduction, Lecture Notes in Mathematics, Vol. 1407, Springer, Berlin, 1988.
21. A. Schlüter, A theory of rules for enumerated classes of functions, Arch. Math. Logic 34 (1995) 47-63.
22. K. Schütte, Proof Theory, Springer, Berlin, 1977.
23. H. Schwichtenberg, Proof theory: Some applications of cut-elimination, in: J. Barwise (Ed.), Handbook of Mathematical Logic, North-Holland, Amsterdam, 1977, pp. 867-895.
24. S.G. Simpson, Subsystems of Second Order Arithmetic. Perspectives in Mathematical Logic, Springer, Berlin, 1998.
25. A. Troelstra, D. van Dalen, Constructivism in Mathematics, Vol. I, North-Holland, Amsterdam, 1988.