Abstract
Based on a categorical semantics for impredicative calculi of dependent types we prove several dependence and independence results. Especially we prove that there exists a model where all usual syntactical concepts can be interpreted with only one exception: in the model the strong sum of a family of propositions indexed over a proposition need not be isomorphic to a proposition again.The method of proof consists of restricting the set of propositions in the well known PERw model due to E. Moggi. The subsets of PERw considered in this paper are inspired by the subset ExpO of PERw introduced by Freyd et al.Finally we show that a weak and a strong notion of sub-locally-cartesian-closed-category coincide under rather mild completeness conditions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
