English

Isomorphism within Naive Type Theory

Logic in Computer Science 2018-01-23 v7

Abstract

We provide a treatment of isomorphism within a set-theoretic formulation of dependent type theory. Type expressions are assigned their natural set-theoretic compositional meaning. Types are divided into small and large types --- sets and proper classes respectively. Each proper class, such as "group" or "topological space", has an associated notion of isomorphism in correspondence with standard definitions. Isomorphism is handled by definging a groupoid structure on the space of all definable values. The values are simultaneously objects (oids) and morphism --- they are "morphoids". Soundness can then be proved for simple and natural inference rules deriving isomorphisms and for the substitution of isomorphics.

Keywords

Cite

@article{arxiv.1407.7274,
  title  = {Isomorphism within Naive Type Theory},
  author = {David McAllester},
  journal= {arXiv preprint arXiv:1407.7274},
  year   = {2018}
}
R2 v1 2026-06-22T05:14:22.833Z