Provability logics for natural Turing progressions of arithmetical theories

Studia Logica 50 (1):107-128 (1991)
  Copy   BIBTEX

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.

Other Versions

No versions found

Links

PhilArchive

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

Fuzzy logic and arithmetical hierarchy, II.Petr Hájek - 1997 - Studia Logica 58 (1):129-141.
On bimodal logics of provability.Lev D. Beklemishev - 1994 - Annals of Pure and Applied Logic 68 (2):115-159.
The Logic of Turing Progressions.Eduardo Hermo Reyes & Joost J. Joosten - 2020 - Notre Dame Journal of Formal Logic 61 (1):155-180.

Analytics

Added to PP
2009-01-28

Downloads
122 (#379,823)

6 months
15 (#807,222)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

On bimodal logics of provability.Lev D. Beklemishev - 1994 - Annals of Pure and Applied Logic 68 (2):115-159.
Bimodal logics for extensions of arithmetical theories.Lev D. Beklemishev - 1996 - Journal of Symbolic Logic 61 (1):91-124.
On the inevitability of the consistency operator.Antonio Montalbán & James Walsh - 2019 - Journal of Symbolic Logic 84 (1):205-225.

View all 8 citations / Add more citations

References found in this work

Transfinite recursive progressions of axiomatic theories.Solomon Feferman - 1962 - Journal of Symbolic Logic 27 (3):259-316.
Quantified modal logic and self-reference.C. Smoryński - 1987 - Notre Dame Journal of Formal Logic 28 (3):356-370.

Add more references