Ordinals in HOL: Transfinite Arithmetic up to (and Beyond) ω1
| dc.contributor.author | Norrish, Michael | |
| dc.contributor.author | Huffman, Brian | |
| dc.date.accessioned | 2015-12-10T23:20:19Z | |
| dc.date.issued | 2013 | |
| dc.date.updated | 2016-02-24T10:58:07Z | |
| dc.description.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 | |
| dc.identifier.isbn | 9783642396335 | |
| dc.identifier.uri | http://hdl.handle.net/1885/66272 | |
| dc.publisher | Springer Science + Business Media | |
| dc.relation.ispartof | Lecture Notes in Computer Science: Interactive Theorem Proving | |
| dc.relation.isversionof | 1st Edition | |
| dc.subject | Keywords: Arithmetic operations; Fixpoints; Mechanisation; Normal form; Ordinal number; Machinery; Number theory; Theorem proving | |
| dc.title | Ordinals in HOL: Transfinite Arithmetic up to (and Beyond) ω1 | |
| dc.type | Book chapter | |
| local.bibliographicCitation.lastpage | 146 | |
| local.bibliographicCitation.placeofpublication | Heidelberg | |
| local.bibliographicCitation.startpage | 133 | |
| local.contributor.affiliation | Norrish, Michael, College of Engineering and Computer Science, ANU | |
| local.contributor.affiliation | Huffman, Brian, Galois Inc | |
| local.contributor.authoruid | Norrish, Michael, u4087502 | |
| local.description.embargo | 2037-12-31 | |
| local.description.notes | Imported from ARIES | |
| local.identifier.absfor | 080201 - Analysis of Algorithms and Complexity | |
| local.identifier.absseo | 970108 - Expanding Knowledge in the Information and Computing Sciences | |
| local.identifier.ariespublication | u4334215xPUB1255 | |
| local.identifier.doi | 10.1007/978-3-642-39634-2_12 | |
| local.identifier.scopusID | 2-s2.0-84882762773 | |
| local.type.status | Published Version |