Polymorphism and the obstinate circularity of second order logic: a victims' tale

10/27/2017
by   Paolo Pistone, et al.
0

The investigations on higher-order type theories and on the related notion of parametric polymorphism constitute the technical counterpart of the old foundational problem of the circularity (or impredicativity) of second and higher order logic. However, the epistemological significance of such investigations, and of their often non trivial results, has not received much attention in the contemporary foundational debate. The results recalled in this paper suggest that the question of the circularity of second order logic cannot be reduced to the simple assessment of a vicious circle. Through a comparison between the faulty consistency arguments given by Frege and Martin-Löf, respectively for the logical system of the Grundgesetze (shown inconsistent by Russell's paradox) and for the intuitionistic type theory with a type of all types (shown inconsistent by Girard's paradox), and the normalization argument for second order type theory (or System F), we indicate a bunch of subtle mathematical problems and logical concepts hidden behind the hazardous idea of impredicative quantification, constituting a vast (and largely unexplored) domain for foundational research.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/16/2020

On Reductions of Hintikka Sets for Higher-Order Logic

Steen's (2018) Hintikka set properties for Church's type theory based on...
research
03/06/2013

Dialectic Reasoning with Inconsistent Information

From an inconsistent database non-trivial arguments may be constructed b...
research
10/13/2022

Proofs and Refutations for Intuitionistic and Second-Order Logic (Extended Version)

The lambda-PRK-calculus is a typed lambda-calculus that exploits the dua...
research
08/29/2023

Conservativity of Type Theory over Higher-order Arithmetic

We investigate how much type theory is able to prove about the natural n...
research
02/16/2015

Rewriting Higher-Order Stack Trees

Higher-order pushdown systems and ground tree rewriting systems can be s...
research
09/21/2022

Capturing Bisimulation-Invariant Exponential-Time Complexity Classes

Otto's Theorem characterises the bisimulation-invariant PTIME queries ov...
research
09/18/2023

Fitchean Ignorance and First-order Ignorance: A Neighborhood Look

In a seminal work <cit.>, Fine classifies several forms of ignorance, am...

Please sign up or login with your details

Forgot password? Click here to reset