Skip to main content
SpringerLink
Log in

Reverse mathematics of prime factorization of ordinals

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract.

One of the earliest applications of Cantor's Normal Form Theorem is Jacobstahl's proof of the existence of prime factorizations of ordinals. Applying the techniques of reverse mathematics, we show that the full strength of the Normal Form Theorem is used in this proof.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Mathematical Sciences, Appalachian State University, Boone, NC 28608, USA. e-mail: jlh@math.appstate.edu , , , , , , US

    Jeffry L. Hirst

Authors
  1. Jeffry L. Hirst
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: 13 August 1997 / Revised version: 3 November 1997

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hirst, J. Reverse mathematics of prime factorization of ordinals. Arch Math Logic 38, 195–201 (1999). https://doi.org/10.1007/s001530050123

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001530050123

Search

Navigation