Challenges to predicative foundations of arithmetic (Q2755496)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Challenges to predicative foundations of arithmetic |
scientific article; zbMATH DE number 1671367
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Challenges to predicative foundations of arithmetic |
scientific article; zbMATH DE number 1671367 |
Statements
29 August 2002
0 references
predicative foundations of arithmetic
0 references
0 references
0.90503114
0 references
0.8981526
0 references
0.8955891
0 references
0.8938296
0 references
0.8880559
0 references
Challenges to predicative foundations of arithmetic (English)
0 references
The paper is a sequel to the authors' article ``Predicative foundations of arithmetic'' [J. Philos. Log. 24, 1-17 (1995; Zbl 0816.03030)] (PFA). It is reviewed and clarified what was accomplished in PFA. The paper deals also with the challenges of Parsons, Isaacson, George and Velleman.NEWLINENEWLINEFor the entire collection see [Zbl 0961.00010].
0 references
