Consistent fragments of \textit{Grundgesetze} and the existence of non-logical objects (Q1568382)

The author considers two consistent subsystems of \textit{Frege}'s ``Grundgesetze der Arithmetik'', \textit{Richard Heck}'s predicative fragment H [cf. Hist. Philos. Log. 17, No. 4, 209-220 (1996; Zbl 0876.03032); Notre Dame J. Formal Log. 38, No. 3, 437-474 (1997; Zbl 0915.03005)] containing Frege's \textit{scheme} V and predicative second-order comprehension, and the system T\(_\Delta\) with \textit{axiom} V and \(\Delta^{1}_{1}\)-comprehension. He shows that the existence of infinitely many non-value-ranges can be proved in H. T\(_\Delta\), proved to be consistent, goes beyond. Not only can the existence of non-logical objects be proved in it, but also the existence of the concept of being a value-range can be refuted. In consequence the author regards it as convincing to understand these results as a \textit{reductio ad absurdum} of the logicist program, at least with respect to these subsystems of arithmetic (p. 326). He furthermore affirms Cantor's theorem concerning the non-existence of a bijection between the individuals and the second order entities of a given domain.