I am aware that assigning the type of Type to be Type (rather than stratifying to a hierarchy of types) leads to an inconsistency. But does this inconsistency allow the construction of a well-typed term with no normal form, or does it actually allow a proof of False? Are these two questions equivalent?
Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)
|
9
1
|
|
|
|
|
10
|
Girard's paradox constructs a non-normalizing proof of False. You could read Hurken's "A simplification of Girard's paradox", or maybe Kevin Watkin's formalization in Twelf. In general, these questions are not equivalent, though they often coincide. A "reasonable" type theory will by inspection have no normal proofs of False, and so then normalization implies consistency. The inverse (non-normalization => proof of False) is much less obvious, and it is certainly possible to construct reasonable paraconsistent type theories, where non-termination is confined under a monad and does not result in a proof of False. |
||
|
|
You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.
|
0
|
It leads to a well-typed term, having no normal form, which is assigned the type False. You can find the term given explicitly in A simplification of Girard's paradox |
||
|
|
