Abstract
We present three ordinal notation systems representing ordinals below epsilon zero in type theory, using recent type-theoretical innovations such as mutual inductive-inductive definitions and higher inductive types. We show how ordinal arithmetic can be developed for these systems, and how they admit a transfinite induction principle. We prove that all three notation systems are equivalent, so that we can transport results between them using the univalence principle. All our constructions have been implemented in cubical Agda.
| Original language | English |
|---|---|
| Title of host publication | CPP 2020 : Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs |
| Editors | Jasmin Blanchette, Catalin Hritcu |
| Place of Publication | New York |
| Pages | 172–185 |
| Number of pages | 14 |
| DOIs | |
| Publication status | Published - 24 Jan 2020 |
Fingerprint
Keywords
- theory of computation
- proof theory
- type theory
- ordinal notation
- cantor normal form
- inductive-inductive definitions
- higher inductive types
- cubical Agda
- programming
Cite this
Nordvall Forsberg, F., Xu, C., & Ghani, N. (2020). Three equivalent ordinal notation systems in cubical Agda. In J. Blanchette, & C. Hritcu (Eds.), CPP 2020 : Proceedings of the 9th ACM SIGPLAN International Conference on Certified Programs and Proofs (pp. 172–185). New York. https://doi.org/10.1145/3372885.3373835