论文信息 - The unfolding of non-finitist arithmetic - 字舞流文

The unfolding of non-finitist arithmetic

Solomon Feferman | Thomas Strahm | S. Feferman | T. Strahm

[1] R. Platek. Foundations of recursion theory , 1966 .

[2] Kurt Schütte. Proof theory , 1977 .

[3] M. Beeson. Foundations of Constructive Mathematics: Metamathematical Studies , 1985 .

[4] Yiannis N. Moschovakis,et al. The formal language of recursion , 1989, Journal of Symbolic Logic.

[5] Michael Rathjen,et al. The role of parameters in bar rule and bar induction , 1991, Journal of Symbolic Logic.

[6] Solomon Feferman,et al. Reflecting on incompleteness , 1991, Journal of Symbolic Logic.

[7] Solomon Feferman. A New Approach to Abstract Data Types II: Computation on ADTs as Ordinary Computation , 1991, CSL.

[8] Gerhard Jäger,et al. Systems of Explicit Mathematics with Non-Constructive µ-Operator, Part I , 1993, Ann. Pure Appl. Logic.

[9] Gerhard Jäger. Fixed Points in Peano Arithmetic with Ordinals , 1993, Ann. Pure Appl. Log..

[10] Solomon Feferman. Computation on Abstract Data Types: The Extensional Approach, with an Application to Streams , 1996, Ann. Pure Appl. Log..

[11] Thomas Strahm,et al. Systems of Explicit Mathematics with Non-Constructive µ-Operator and Join , 1996, Ann. Pure Appl. Log..

[12] Solomon Feferman,et al. Gödel's program for new axioms: why, where, how and what? , 1996 .