Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support

Theories and Ordinals in Proof Theory

Michael Rathjen
Synthese
Vol. 148, No. 3, Proof-Theoretic Semantics (Feb., 2006), pp. 719-743
Published by: Springer
Stable URL: http://www.jstor.org/stable/20118717
Page Count: 25
  • Get Access
  • Download ($43.95)
  • Cite this Item
If you need an accessible version of this item please contact JSTOR User Support
Theories and Ordinals in Proof Theory
Preview not available

Abstract

How do ordinals measure the strength and computational power of formal theories? This paper is concerned with the connection between ordinal representation systems and theories established in ordinal analyses. It focusses on results which explain the nature of this connection in terms of semantical and computational notions from model theory, set theory, and generalized recursion theory.

Page Thumbnails

  • Thumbnail: Page 
[719]
    [719]
  • Thumbnail: Page 
720
    720
  • Thumbnail: Page 
721
    721
  • Thumbnail: Page 
722
    722
  • Thumbnail: Page 
723
    723
  • Thumbnail: Page 
724
    724
  • Thumbnail: Page 
725
    725
  • Thumbnail: Page 
726
    726
  • Thumbnail: Page 
727
    727
  • Thumbnail: Page 
728
    728
  • Thumbnail: Page 
729
    729
  • Thumbnail: Page 
730
    730
  • Thumbnail: Page 
731
    731
  • Thumbnail: Page 
732
    732
  • Thumbnail: Page 
733
    733
  • Thumbnail: Page 
734
    734
  • Thumbnail: Page 
735
    735
  • Thumbnail: Page 
736
    736
  • Thumbnail: Page 
737
    737
  • Thumbnail: Page 
738
    738
  • Thumbnail: Page 
739
    739
  • Thumbnail: Page 
740
    740
  • Thumbnail: Page 
741
    741
  • Thumbnail: Page 
742
    742
  • Thumbnail: Page 
743
    743