Abstract
We present three ordinal notation systems representing ordinals below epsilon(0) 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.
Item Type: | Journal article |
---|---|
Faculties: | Mathematics, Computer Science and Statistics > Mathematics |
Subjects: | 500 Science > 510 Mathematics |
Language: | English |
Item ID: | 88980 |
Date Deposited: | 25. Jan 2022, 09:28 |
Last Modified: | 13. Aug 2024, 12:44 |