An Interpretation of E-HA$^w$ inside HA$^w$
Logic in Computer Science
2023-11-20 v1
Abstract
Higher Type Arithmetic (HA) is a first-order many-sorted theory. It is a conservative extension of Heyting Arithmetic obtained by extending the syntax of terms to all of System T: the objects of interest here are the functionals of higher types. While equality between natural numbers is specified by the axioms of Peano, how can equality between functionals be defined? From this question, different versions of HA arise, such as an extensional version (E-HA) and an intentional version (I-HA). In this work, we will see how the study of partial equivalence relations leads us to design a translation by parametricity from E-HA to HA.
Keywords
Cite
@article{arxiv.2311.10578,
title = {An Interpretation of E-HA$^w$ inside HA$^w$},
author = {Félix Castro},
journal= {arXiv preprint arXiv:2311.10578},
year = {2023}
}
Comments
In Proceedings LFMTP 2023, arXiv:2311.09918