A note on the series' of ordinal numbers
Marco Trombetti
TL;DR
This paper provides a proof for a statement by Sierpiński regarding the number of possible sums of certain ordinal series, specifically those with length less than .
Contribution
It offers a formal proof of Sierpiński's claim about the sums of ordinal series of length less than , clarifying an aspect of ordinal number theory.
Findings
Confirmed Sierpiski's statement about ordinal series sums
Established bounds on the number of possible sums for -length series
Contributed to the understanding of ordinal series summation
Abstract
The aim of this short note is to provide a proof to a statement of Sierpi\'nski concerning the number of possible sums of a series (of type ) of arbitrary ordinal numbers.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Rough Sets and Fuzzy Logic · AI-based Problem Solving and Planning