Dependent Types Simplified

Abstract

We present two logical systems based on dependent types that are comparable to ZFC, both in terms of simplicity and having natural set theoretic interpretations. Our perspective is that of a mathematician trained in classical logic, but nevertheless we hope this paper might go some way to bridging the cultural divide between type theorists coming from computer science.