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.
โฆ LIBER โฆ
Reverse mathematics and ordinal exponentiation
โ Scribed by Jeffry L. Hirst
- Book ID
- 103601783
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 979 KB
- Volume
- 66
- Category
- Article
- ISSN
- 0168-0072
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Reverse Mathematics and Ordinal Multipli
โ
Jeffry L. Hirst
๐
Article
๐
1998
๐
John Wiley and Sons
๐
English
โ 352 KB
Reverse Order Exponentiation
โ
Shraga Yeshurun
๐
Article
๐
1989
๐
School Science and Mathematics Association
๐
English
โ 188 KB
Reverse mathematics of prime factorizati
โ
Jeffry L. Hirst
๐
Article
๐
1999
๐
Springer
๐
English
โ 71 KB
Graph Coloring and Reverse Mathematics
โ
James H. Schmerl
๐
Article
๐
2000
๐
John Wiley and Sons
๐
English
โ 133 KB
Derived sequences and reverse mathematic
โ
Jeffry L. Hirst
๐
Article
๐
1993
๐
John Wiley and Sons
๐
English
โ 412 KB
## 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
Reverse mathematics and Peano categorici
โ
Stephen G. Simpson; Keita Yokoyama
๐
Article
๐
2013
๐
Elsevier Science
๐
English
โ 235 KB