Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

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

Date

Authors

Norrish, Michael

Huffman, Brian

Publisher

Springer Science + Business Media

Abstract

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

Keywords

Keywords: Arithmetic operations; Fixpoints; Mechanisation; Normal form; Ordinal number; Machinery; Number theory; Theorem proving

URI

http://hdl.handle.net/1885/66272

Collections

ANU Research Publications

Type

Book Title

Lecture Notes in Computer Science: Interactive Theorem Proving

DOI

10.1007/978-3-642-39634-2_12

Restricted until

2037-12-31

Downloads

File

Description

01_Norrish_Ordinals_in_HOL:_Transfinite_2013.pdf (2.2 MB)

02_Norrish_Ordinals_in_HOL:_Transfinite_2013.pdf (264.82 KB)