## Higman's Lemma in Type Theory (1997)

Venue: | PROCEEDINGS OF THE 1996 WORKSHOP ON TYPES FOR PROOFS AND PROGRAMS |

Citations: | 5 - 0 self |

### BibTeX

@INPROCEEDINGS{Fridlender97higman'slemma,

author = {Daniel Fridlender},

title = {Higman's Lemma in Type Theory},

booktitle = {PROCEEDINGS OF THE 1996 WORKSHOP ON TYPES FOR PROOFS AND PROGRAMS},

year = {1997},

pages = {112--133},

publisher = {Springer-Verlag}

}

### OpenURL

### Abstract

This thesis is about exploring the possibilities of a limited version of Martin-Löf's type theory. This exploration consists both of metatheoretical considerations and of the actual use of that version of type theory to prove Higman's lemma. The thesis is organized in two papers, one in which type theory itself is studied and one in which it is used to prove Higman's lemma. In the first paper, A Lambda Calculus Model of Martin-Löf's Theory of Types with Explicit Substitution, we present the formal calculus in complete detail. It consists of Martin-Lof's logical framework with explicit substitution extended with some inductively defined sets, also given in complete detail. These inductively defined sets are precisely those we need in the second paper of this thesis for the formal proof of Higman's lemma. The limitations of the formalism come from the fact that we do not introduce universes. It is known that for other versions of type theory, the absence of universes implies the impossib...