[FOM] A computational approach to the countable ordinals

[Panagiotis Manolios]

You may be interested in the following paper:

Panagiotis Manolios and Daron Vroon.  Ordinal Arithmetic: Algorithms
and Mechanization. Journal of Automated Reasoning, volume 34(4), pages
387-423, 2005.

which is available at the following URL:

http://www.ccs.neu.edu/home/pete/research/ordinal-arithmetic-algs-mech.html

On Aug 8, 2008, at 7:00 PM, fom-request at cs.nyu.edu wrote:

> 1. A computational approach to the countable ordinals (Paul Budnik)
>
> From: Paul Budnik <paul at mtnmath.com>
> Date: August 7, 2008 8:50:44 PM GMT+03:00
>
> Have there been other attempts to write code for ordinal notations
> as a research tool to create stronger notations systems? I know this
> has been done to support automated proofs.

--
Pete Manolios
Northeastern University
http://www.ccs.neu.edu/home/pete


--
Pete Manolios
Northeastern University
http://www.ccs.neu.edu/home/pete