Computer Science – Logic in Computer Science
Scientific paper
2011-09-08
LMCS 7 (3:18) 2011
Computer Science
Logic in Computer Science
Scientific paper
10.2168/LMCS-7(3:18)2011
It is well-known that simple type theory is complete with respect to non-standard set-valued models. Completeness for standard models only holds with respect to certain extended classes of models, e.g., the class of cartesian closed categories. Similarly, dependent type theory is complete for locally cartesian closed categories. However, it is usually difficult to establish the coherence of interpretations of dependent type theory, i.e., to show that the interpretations of equal expressions are indeed equal. Several classes of models have been used to remedy this problem. We contribute to this investigation by giving a semantics that is standard, coherent, and sufficiently general for completeness while remaining relatively easy to compute with. Our models interpret types of Martin-L\"of's extensional dependent type theory as sets indexed over posets or, equivalently, as fibrations over posets. This semantics can be seen as a generalization to dependent type theory of the interpretation of intuitionistic first-order logic in Kripke models. This yields a simple coherent model theory, with respect to which simple and dependent type theory are sound and complete.
Awodey Steve
Rabe Florian
No associations
LandOfFree
Kripke Semantics for Martin-Löf's Extensional Type Theory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Kripke Semantics for Martin-Löf's Extensional Type Theory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Kripke Semantics for Martin-Löf's Extensional Type Theory will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-475144