Article ID Journal Published Year Pages File Type
9655967 Electronic Notes in Theoretical Computer Science 2005 22 Pages PDF
Abstract
The proof is done by employing the internal dependent type theory of an arithmetic universe.
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Reflection Into Models of Finite Decidable FP-sketches in an Arithmetic Universe
Authors
,