SourceForge.net Logo
project summary

 

Countable Ordinals

 

Title: Countable Ordinals
Author: Brian Huffman
Submission date: 2005-11-11
Abstract: This development defines a well-ordered type of countable ordinals. It includes notions of continuous and normal functions, recursively defined functions over ordinals, least fixed-points, and derivatives. Much of ordinal arithmetic is formalized, including exponentials and logarithms. The development concludes with formalizations of Cantor Normal Form and Veblen hierarchies over normal functions.
Status: [ok] This is the development version of this entry generated for Isabelle-16-Sep-2009. The development version might change over time and is only permanently archived at Isabelle release points. It is provided as a preview of the next upcoming release. Please refer to release versions only in citations. If the status shows [FAIL], the links below will point to the last working version if any.

 

$Date: 2009/04/28 23:20:48 $, $Revision: 1.1 $