Name
Abstract | ||
|---|---|---|
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 Gamma proves P where Gamma = empty set). For intuitionistic implicational 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. Natural deduction versions of illative combinatory logics 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 HPTSs 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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.2168/LMCS-4(1:1)2008 | LOGICAL METHODS IN COMPUTER SCIENCE |
Keywords | DocType | Volume |
Hilbert-style logics,pure type systems,type theory,lambda calculus,illative combinatory logic | Journal | 4 |
Issue | ISSN | Citations |
1 | 1860-5974 | 0 |
PageRank | References | Authors |
0.34 | 2 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martin W. Bunder | 1 | 64 | 16.78 |
| WIL J. M. DEKKERS | 2 | 0 | 0.34 |
| Henk Barendregt | 3 | 588 | 92.49 |