论文信息 - Predicative foundations of arithmetic

Predicative foundations of arithmetic

L'A. resout le probleme selon lequel les mathematiques predicatives, fondees par Poincare et Weyl sur le systeme des nombres naturels, presupposeraient des principes impredicatifs point de vue de la theorie des ensembles. L'A. defend la validite d'une axiomatisation predicative de l'arithmetique, fondee sur les concepts de categoricite, d'existence et de structure isomorphique, formules dans le cadre de la theorie elementaire des ensembles finis et des classes (EFSC)

Geoffrey Hellman | Solomon Feferman | S. Feferman | G. Hellman

[1] Geoffrey Hellman,et al. Mathematics without Numbers: Towards a Modal-Structural Interpretation , 1989 .

[2] S. Shelah,et al. Annals of Pure and Applied Logic , 1991 .

[3] Joseph R. Shoenfield,et al. Mathematical logic , 1967 .

[4] J. D. Monk,et al. Mathematical Logic , 1976 .

[5] Joseph R. Shoenfield,et al. A relative consistency proof , 1954, Journal of Symbolic Logic.

[6] Solomon Feferman,et al. Autonomous Transfinite Progressions and the Extent of Predicative Mathematics , 1968 .

[7] D. Isaacson,et al. Arithmetical truth and hidden higher-order concepts , 1985, Logic Colloquium.

[8] Wilfried Sieg,et al. Fragments of arithmetic , 1985, Ann. Pure Appl. Log..

[9] Solomon Feferman,et al. Systems of predicative analysis , 1964, Journal of Symbolic Logic.

[10] R. Dedekind,et al. Was sind und was sollen die Zahlen , 1961 .

[11] S. Shapiro,et al. Foundations Without Foundationalism: A Case for Second-Order Logic. , 1994 .