1970
DOI: 10.1007/bf01967653
|View full text |Cite
|
Sign up to set email alerts
|

Ein Bezeichnungssystem für Ordinalzahlen

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

1972
1972
2020
2020

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 12 publications
(3 citation statements)
references
References 2 publications
0
3
0
Order By: Relevance
“…. , l. Note that the existence of such γ i ∈C m α ,θ m (α ) ∩ dom(θ m +1 ) ∩ α is guaranteed by (11) and Lemma 2.6. We put γ i := rt n m +1 (γ i ), Γ i := ϑ n m +1 (γ i ) for 1 ≤ i ≤ l, and Γ := Γ 1 + · · · + Γ l .…”
Section: The Proofs Of Both Parts (A) and (B) Proceed By Induction Onmentioning
confidence: 99%
See 2 more Smart Citations
“…. , l. Note that the existence of such γ i ∈C m α ,θ m (α ) ∩ dom(θ m +1 ) ∩ α is guaranteed by (11) and Lemma 2.6. We put γ i := rt n m +1 (γ i ), Γ i := ϑ n m +1 (γ i ) for 1 ≤ i ≤ l, and Γ := Γ 1 + · · · + Γ l .…”
Section: The Proofs Of Both Parts (A) and (B) Proceed By Induction Onmentioning
confidence: 99%
“…Note that Ψ > 0 since α ≥ ε Ωm + 1 +1 . Since α ∈ dom(θ m ) we have (11) α ∈C m (α ,θ m (α )), and by Lemma 2.16 we obtain Ψ ∈ dom(θ m +1 ). Set Ψ := rt n m +1 (Ψ ) and let γ i be such that Γ i =θ m +1 (γ i ) for i = 1, .…”
Section: The Proofs Of Both Parts (A) and (B) Proceed By Induction Onmentioning
confidence: 99%
See 1 more Smart Citation