Skip navigation
Skip navigation

Ordinals in HOL: Transfinite Arithmetic up to (and Beyond) ω1

Norrish, Michael; Huffman, Brian


We describe a comprehensive HOL mechanisation of the theory of ordinal numbers, focusing on the basic arithmetic operations. Mechanised results include the existence of fixpoints such as ε 0, the existence of normal forms, and the validation of algorithm

CollectionsANU Research Publications
Date published: 2013
Type: Book chapter
Book Title: Lecture Notes in Computer Science: Interactive Theorem Proving
DOI: 10.1007/978-3-642-39634-2_12


File Description SizeFormat Image
01_Norrish_Ordinals_in_HOL:_Transfinite_2013.pdf2.26 MBAdobe PDF    Request a copy
02_Norrish_Ordinals_in_HOL:_Transfinite_2013.pdf264.82 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator