Bunder, M. W. and Dekkers, W. M. J. - Are there Hilbert-style Pure Type Systems?

lmcs:839 - Logical Methods in Computer Science, January 7, 2008, Volume 4, Issue 1
Are there Hilbert-style Pure Type Systems?

Authors: Bunder, M. W. and Dekkers, W. M. J.

For many a natural deduction style logic there is a Hilbert-style logic that is equivalent to it in that it has the same theorems (i.e. valid judgements with empty contexts). For intuitionistic logic, the axioms of the equivalent Hilbert-style logic can be propositions which are also known as the types of the combinators I, K and S. Hilbert-style versions of illative combinatory logic have formulations with axioms that are actual type statements for I, K and S. As pure type systems (PTSs)are, in a sense, equivalent to systems of illative combinatory logic, it might be thought that Hilbert-style PTSs (HPTSs) could be based in a similar way. This paper shows that some PTSs have very trivial equivalent HPTSs, with only the axioms as theorems and that for many PTSs no equivalent HPTS can exist. Most commonly used PTSs belong to these two classes. For some PTSs however, including lambda* and the PTS at the basis of the proof assistant Coq, there is a nontrivial equivalent HPTS, with axioms that are type statements for I, K and S.


Source : oai:arXiv.org:0707.0890
DOI : 10.2168/LMCS-4(1:1)2008
Volume: Volume 4, Issue 1
Published on: January 7, 2008
Submitted on: November 21, 2006
Keywords: Computer Science - Logic in Computer Science,F.4.1


Share

Consultation statistics

This page has been seen 55 times.
This article's PDF has been downloaded 35 times.