Reverse Mathematics and Ordinal Multiplication

Mathematical Logic Quarterly 44 (4):459-464 (1998)
  Copy   BIBTEX

Abstract

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 to be equivalent to the subsystem ATR0

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 103,945

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Reverse mathematics and ordinal exponentiation.Jeffry L. Hirst - 1994 - Annals of Pure and Applied Logic 66 (1):1-18.
Embeddings of countable closed sets and reverse mathematics.Jeffry L. Hirst - 1993 - Archive for Mathematical Logic 32 (6):443-449.
Reverse mathematics and homeomorphic embeddings.Harvey M. Friedman & Jeffry L. Hirst - 1991 - Annals of Pure and Applied Logic 54 (3):229-253.
The Bachmann-Howard Structure in Terms of Σ1-Elementarity.Gunnar Wilken - 2006 - Archive for Mathematical Logic 45 (7):807-829.
Derived sequences and reverse mathematics.Jeffry L. Hirst - 1993 - Mathematical Logic Quarterly 39 (1):447-453.
Proof theory in philosophy of mathematics.Andrew Arana - 2010 - Philosophy Compass 5 (4):336-347.

Analytics

Added to PP
2014-01-16

Downloads
33 (#748,931)

6 months
2 (#1,353,553)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references