Algorithms for ordinal arithmetic (2003)
| Venue: | In 19th International Conference on Automated Deduction (CADE |
| Citations: | 10 - 5 self |
BibTeX
@INPROCEEDINGS{Manolios03algorithmsfor,
author = {Panagiotis Manolios and Daron Vroon},
title = {Algorithms for ordinal arithmetic},
booktitle = {In 19th International Conference on Automated Deduction (CADE},
year = {2003},
pages = {243--257},
publisher = {Springer–Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. Proofs of termination are essential for establishing the correct behavior of computing systems. There are various ways of establishing termination, but the most general involves the use of ordinals. An example of a theorem proving system in which ordinals are used to prove termination is ACL2. In ACL2, every function defined must be shown to terminate using the ordinals up to ɛ0. We use a compact notation for the ordinals up to ɛ0 (exponentially more succinct than the one used by ACL2) and define efficient algorithms for ordinal addition, subtraction, multiplication, and exponentiation. In this paper we describe our notation and algorithms, prove their correctness, and analyze their complexity. 1
