The Consistency of predicative fragments of frege’s <i>grundgesetze der arithmetik</i> (Q4344728)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1036328
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Consistency of predicative fragments of frege’s <i>grundgesetze der arithmetik</i> |
scientific article; zbMATH DE number 1036328 |
Statements
The Consistency of predicative fragments of frege’s <i>grundgesetze der arithmetik</i> (English)
0 references
20 November 1997
0 references
second-order logic
0 references
Frege
0 references
logicism
0 references
predicative logics
0 references
consistency
0 references
Robinson arithmetic
0 references
0.8707971572875977
0 references
0.8251222968101501
0 references
0.8244743347167969
0 references
As is well known, the second-order system of Frege's ``Grundgesetze der Arithmetik'' is inconsistent: Russell's Paradox is derivable. For this, often only Frege's ``Axiom V'' (the extensionality of the value-ranges, the ``Wertverläufe'') is blamed. The author proves, however, that this Axiom V -- even taken as a schema -- is consistent with a ``simple'' second-order predicative system allowing no references to value-ranges in the defining formulas for value-ranges. And he sketches that this consistency result holds also true for a full predicative second-order system including Axiom V (and having a type-theoretic structure for the well-formed value-range terms). Within this full system, Robinson arithmetic is interpretable.
0 references
