Chapter I: Constructive Ordinals and $\Pi^1_1$ Sets. Gerald E. Sacks. Source: Gerald E. Sacks, Higher Recursion Theory (Berlin: Springer-Verlag, 1990) , 3-21.
|
|
Ordinal notation - Wikipedia, the free encyclopedia
en.wikipedia.org/wiki/Ordinal_notation
In mathematical logic and set theory, an ordinal notation is a finite sequence of .... Larry W. (1976), "Normal Functions and Constructive Ordinal Notations", The ... |
||
(i.e., nonnegative integers) and constructive ordinals in a free variable theory V of ... finite induction with respect to constructive ordinals says: if a property Q(Z) of ...
|
||
constructive finite number classes. It was shown that both the forms of the sets of notations for the finite number classes and the ordinals obtained are the same ...
|
||
Constructive Ordinal Notation Systems. G: Adam, did you find a good system for naming ordinals? A: Ordinals? / thought you said "animals." FREDERICK GASS ...
|
||
The constructive ordinals or trees form such a distinguished class. They have been mathematically investigated (e.g. by Brouwer, Church, ~eene) and have ...
|
|
|
(1955) Kleene. American Journal of Mathematics. Read by researchers in: 100% Mathematics. Type: journal. Volume: 66. Pages: 41-58.
|
||
A summary of definitions and properties of ordinal numbers.
|
||
numbers by using constructive ordinals, whose notations are recursively de- fined. Constructive ordinals coincide with computable ordinals, that is, with the order ...
|
||
There are various classically equivalent definitions of ordinal number. In a constructive context, ordinals are usually ...
|
