Countable Ordinals
نویسنده
چکیده
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.
منابع مشابه
The Church Problem for Countable Ordinals
A fundamental theorem of Büchi and Landweber shows that the Church synthesis problem is computable. Büchi and Landweber reduced the Church Problem to problems about ω-games and used the determinacy of such games as one of the main tools to show its computability. We consider a natural generalization of the Church problem to countable ordinals and investigate games of arbitrary countable length....
متن کاملWalks on Countable Ordinals and Selective Ultrafilters
In our previous work we have introduced filters on the set of countable ordinals as invariants to standard characteristics of walks in this domain. In this note we examine their projections to the set of natural numbers.
متن کاملMore on Partitioning Triples of Countable Ordinals
Consider an arbitrary partition of the triples of all countable ordinals into two classes. We show that either for each finite ordinal m the first class of the partition contains all triples from a set of type ω +m, or for each finite ordinal n the second class of the partition contains all triples of an nelement set. That is, we prove that ω1 → (ω + m,n)3 for each pair of finite ordinals m and...
متن کاملCantor-Bendixson ranks of countable SFTs
We show that the possible Cantor-Bendixson ranks of countable SFTs are exactly the finite ordinals and ordinals of the form λ + 3, where λ is a computable ordinal. This result was claimed by the author in his PhD dissertation, but the proof contains an error, which is fixed in this note.
متن کاملDownward Closure of Depth in Countable Boolean Algebras
We study the set of depths of relative algebras of countable Boolean algebras, in particular the extent to which this set may not be downward closed within the countable ordinals for a fixed countable Boolean algebra. Doing so, we exhibit a structural difference between the class of arbitrary rank countable Boolean algebras and the class of rank one countable Boolean algebras.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Archive of Formal Proofs
دوره 2005 شماره
صفحات -
تاریخ انتشار 2005