Reverse Mathematics and Ordinal Multiplication
β Scribed by Jeffry L. Hirst
- Publisher
- John Wiley and Sons
- Year
- 1998
- Tongue
- English
- Weight
- 352 KB
- Volume
- 44
- Category
- Article
- ISSN
- 0044-3050
No coin nor oath required. For personal study only.
β¦ Synopsis
This paper uses the framework of reverse mathematics to analyze the proof theoretic content of several statements concerning multiplication of countable well-orderings. In particular, a division algorithm for ordinal arithmetic is shown t o be equivalent t o the subsystem ATRo.
π SIMILAR VOLUMES
## Abstract One of the earliest applications of transfinite numbers is in the construction of derived sequences by Cantor [2]. In [6], the existence of derived sequences for countable closed sets is proved in ATR~0~. This existence theorem is an intermediate step in a proof that a statement concern
## Abstract We analyze three applications of Ramseyβs Theorem for 4βtuples to infinite traceable graphs and finitely generated infinite lattices using the tools of reverse mathematics. The applications in graph theory are shown to be equivalent to Ramseyβs Theorem while the application in lattice t
The relationship of Grundy and chromatic numbers of graphs in the context of Reverse Mathematics is investigated.