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

Provability Logics for Natural Turing Progressions of Arithmetical Theories

L. D. Beklemishev
Studia Logica: An International Journal for Symbolic Logic
Vol. 50, No. 1, Provability Logic (Mar., 1991), pp. 107-128
Published by: Springer
Stable URL: http://www.jstor.org/stable/20015557
Page Count: 22
  • Download ($43.95)
  • Cite this Item
If you need an accessible version of this item please contact JSTOR User Support
Provability Logics for Natural Turing Progressions of Arithmetical Theories
Preview not available

Abstract

Provability logics with many modal operators for progressions of theories obtained by iterating their consistency statements are introduced. The corresponding arithmetical completeness theorem is proved.

Page Thumbnails

  • Thumbnail: Page 
[107]
    [107]
  • Thumbnail: Page 
108
    108
  • Thumbnail: Page 
109
    109
  • Thumbnail: Page 
110
    110
  • Thumbnail: Page 
111
    111
  • Thumbnail: Page 
112
    112
  • Thumbnail: Page 
113
    113
  • Thumbnail: Page 
114
    114
  • Thumbnail: Page 
115
    115
  • Thumbnail: Page 
116
    116
  • Thumbnail: Page 
117
    117
  • Thumbnail: Page 
118
    118
  • Thumbnail: Page 
119
    119
  • Thumbnail: Page 
120
    120
  • Thumbnail: Page 
121
    121
  • Thumbnail: Page 
122
    122
  • Thumbnail: Page 
123
    123
  • Thumbnail: Page 
124
    124
  • Thumbnail: Page 
125
    125
  • Thumbnail: Page 
126
    126
  • Thumbnail: Page 
127
    127
  • Thumbnail: Page 
128
    128