Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

19

CADE
2003
Springer

favoriteEmaildiscussreport

188views Logical Reasoning» more CADE 2003»

Algorithms for Ordinal Arithmetic

14 years 4 months ago

Algorithms for Ordinal Arithmetic

Download www.cs.utexas.edu

Ordinals form the basis for termination proofs in ACL2. Currently, ACL2 uses a rather inefficient representation for the ordinals up to 0 and provides limited support for reasoning about them. We present algorithms for ordinal arithmetic on an exponentially more compact representation than the one used by ACL2. The algorithms have been implemented and numerous properties of the arithmetic operators have been mechanically verified, thereby greatly extending ACL2's ability to reason about the ordinals. We describe how to use the libraries containing these results, which are currently distributed with ACL2 version 2.7.

Panagiotis Manolios, Daron Vroon

Real-time Traffic

Automated Reasoning | CADE 2003 | Limited Support | Numerous Properties | Termination Proofs |

claim paper

Related Content

» Ordinal Means

» The Transfinite Action of 1 Tape Turing Machines

» Hydra Games and Tree Ordinals

» Proofs Programs and Abstract Complexity

» The Complexity of Quickly ORMDecidable Sets

» Ordinal embeddings of minimum relaxation General properties trees and ultrametrics

» Evolutionary Trees and Ordinal Assertions

» Permutations and wellfoundedness the true meaning of the bizarre arithmetic of Quines NF

» Integrating Reasoning About Ordinal Arithmetic into ACL2

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2003
Where	CADE
Authors	Panagiotis Manolios, Daron Vroon

Comments (0)