A note on equality in finite‐type arithmetic

Mathematical Logic Quarterly 63 (3-4):282-288 (2017)
  Copy   BIBTEX

Abstract

We present a version of arithmetic in all finite types based on a systematic use of an internally definable notion of observational equivalence for dealing with equalities at higher types. For this system both intensional and extensional models are possible, the deduction theorem holds and the soundness of the Dialectica interpretation is provable inside the system itself.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,174

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2017-10-29

Downloads
32 (#709,290)

6 months
10 (#415,916)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Benno Van Den Berg
University of Amsterdam

Citations of this work

No citations found.

Add more citations

References found in this work

A functional interpretation for nonstandard arithmetic.Benno van den Berg, Eyvind Briseid & Pavol Safarik - 2012 - Annals of Pure and Applied Logic 163 (12):1962-1994.
Godel's functional interpretation.Jeremy Avigad & Solomon Feferman - 1998 - In Samuel R. Buss (ed.), Handbook of proof theory. New York: Elsevier. pp. 337-405.
Transfinite recursion in higher reverse mathematics.Noah Schweber - 2015 - Journal of Symbolic Logic 80 (3):940-969.

Add more references