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

Categories

Keywords

Reprint years

DOI

10.1002/malq.19980440404

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,322

External links

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

Through your library

My notes

Similar books and articles

Ordinal inequalities, transfinite induction, and reverse mathematics.Jeffry L. Hirst - 1999 - Journal of Symbolic Logic 64 (2):769-774.
Mathematical proof theory in the light of ordinal analysis.Reinhard Kahle - 2002 - Synthese 133 (1/2):237 - 255.
Ordinal arithmetic with simultaneously defined theta‐functions.Andreas Weiermann & Gunnar Wilken - 2011 - Mathematical Logic Quarterly 57 (2):116-132.
Reverse mathematics and ordinal exponentiation.Jeffry L. Hirst - 1994 - Annals of Pure and Applied Logic 66 (1):1-18.
Ordinal arithmetic and $\Sigma_{1}$ -elementarity.Timothy J. Carlson - 1999 - Archive for Mathematical Logic 38 (7):449-460.
Proof theory in philosophy of mathematics.Andrew Arana - 2010 - Philosophy Compass 5 (4):336-347.
Proof theory and ordinal analysis.W. Pohlers - 1991 - Archive for Mathematical Logic 30 (5-6):311-376.
Reverse mathematics of prime factorization of ordinals.Jeffry L. Hirst - 1999 - Archive for Mathematical Logic 38 (3):195-201.
Addition and multiplication of sets.Laurence Kirby - 2007 - Mathematical Logic Quarterly 53 (1):52-65.
Review: Chen Chung Chang, Anne C. Morel, Some Cancellation Theorems for Ordinal Products of Relations; Chen Chung Chang, Cardinal and Ordinal Multiplication of Relation Types; C. C. Chang, Ordinal Factorization of Finite Relations. [REVIEW]Ann M. Singleterry - 1966 - Journal of Symbolic Logic 31 (1):129-130.
How to develop Proof‐Theoretic Ordinal Functions on the basis of admissible ordinals.Michael Rathjen - 1993 - Mathematical Logic Quarterly 39 (1):47-54.
Wadge hierarchy and veblen hierarchy part I: Borel sets of finite rank.J. Duparc - 2001 - Journal of Symbolic Logic 66 (1):56-86.
Derived sequences and reverse mathematics.Jeffry L. Hirst - 1993 - Mathematical Logic Quarterly 39 (1):447-453.

Analytics

Added to PP
2014-01-16

Downloads
24 (#637,523)

6 months
4 (#818,853)

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