TL;DR: In this paper, the authors consider a system of formal notations for ordinal numbers in the first and second number classes, with the following properties: given a notation for an ordinal, it can be decided effectively whether the ordinal is zero, or the successor of a given ordinal.
Abstract: Consider a system of formal notations for ordinal numbers in the first and second number classes, with the following properties. Given a notation for an ordinal, it can be decided effectively whether the ordinal is zero, or the successor of an ordinal, or the limit of an increasing sequence of ordinals. In the second case, a notation for the preceding ordinal can be determined effectively. In the third case, notations for the ordinals of an increasing sequence of type ω with the given ordinal as limit can be determined effectively.Are there systems of this sort which extend farthest into the second number class? When the conditions for the systems have been made precise, the question will be answered in the affirmative. There is an ordinal ω1 in the second number class such that there are systems of notations of the sort described which extend to all ordinals less than ω1, but none in which ω1 itself is assigned a notation.1. An effective or constructive operation on the objects of an enumerable class is one for which a fixed set of instructions can be chosen such that, for each of the infinitely many objects (or n-tuples of objects), the operation can be completed by a finite process in accordance with the instructions. This notion is made exact by specifying the nature of the process and set of instructions. It appears possible to do so without loss of generality.
TL;DR: In this paper, the authors introduce the following operations: On X that yields the set of all ordinals which belong to the set X, Lim X and sup X that yield the minimal ordinals belonging to X and the minimal min ordinals greater than all min-ordinals in X, respectively.
Abstract: Summary. In the first part of the article we introduce the following operations: On X that yields the set of all ordinals which belong to the set X, Lim X that yields the set of all limit ordinals which belong to X, and inf X and sup X that yield the minimal ordinal belonging to X and the minimal ordinal greater than all ordinals belonging to X, respectively. The second part of the article starts with schemes that can be used to justify the correctness of definitions based on the transfinite induction (see [1] or [3]). The schemes are used to define addition, product and power of ordinal numbers. The operations of limes inferior and limes superior of sequences of ordinals are defined and the concepts of limet of ordinal sequence and increasing and continuous sequence are introduced.
TL;DR: It is shown that a certain ordinal notation system is sufficient to measure the proof-theoretic strength of KPM, which involves a detour through an infinitary calculus RS(M), for which several cutelimination theorems are proved.
Abstract: KPM is a subsystem of set theory designed to formalize a recursively Mahlo universe of sets. In this paper we show that a certain ordinal notation system is sufficient to measure the proof-theoretic strength ofKPM. This involves a detour through an infinitary calculus RS(M), for which we prove several cutelimination theorems. Full cut-elimination is available for derivations of
$$\Sigma (L_{\omega _1^c } )$$
sentences, whereω
1
denotes the least nonrecursive ordinal. This paper is self-contained, at least from a technical point of view.
TL;DR: In this paper, an extension of Japaridze's polymodal logic GLP with transfinitely many modalities is studied and a provability-algebraic ordinal notation system up to the ordinal 0 is developed.
Abstract: We study an extension of Japaridze’s polymodal logic GLP with transfinitely many modalities and develop a provability-algebraic ordinal notation system up to the ordinal Ѓ0.