Hostname: page-component-586b7cd67f-tf8b9 Total loading time: 0 Render date: 2024-11-28T20:32:00.286Z Has data issue: false hasContentIssue false
  • English
  • Français

Rearranging transfinite series of ordinals

Published online by Cambridge University Press:  17 April 2009

Péter Komjath
Péter Komjath
Affiliation:
Department of Algebra and Number Theory, Eötvös Lorand University, Budapest, Hungary.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A new, simplified proof is given of a theorem of J.L. Hickman (to be published; see also J. London Math. Soc. (2) 9 (1974), 239–244), giving an upper bound for the sums of a well-ordered series of ordinals under permutation.

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 16 , Issue 3 , June 1977 , pp. 321 - 323
Copyright
Copyright © Australian Mathematical Society 1977

References

[1]Ginsburg, S., “On the distinct sums of λ-type transfinite series obtained by permuting the elements of a fixed λ-type series”, Fund. Math. 39 (1952), 131–132.CrossRefGoogle Scholar
[2]Hickman, J.L., “Concerning the number of sums obtainable from a countable series of ordinals by permutations that preserve the order-type”, J. London Math. Soc. (2) 9 (1974/1975), 239–244.CrossRefGoogle Scholar
[3]Hickman, J.L., “Some results on series of ordinals”, Z. math. Logik Grundlagen Math. (to appear).Google Scholar
[4]Sierpiński, Wacław, “Sur les séries infinies de nombres ordinaux”, Fund. Math. 36 (1949), 248–253.CrossRefGoogle Scholar