Provability logics for natural Turing progressions of arithmetical theories
Studia Logica 50 (1):107 - 128 (1991)
| 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 | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,705 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesPaolo Gentilini (1999). Proof-Theoretic Modal PA-Completeness II: The Syntactic Countermodel. Studia Logica 63 (2):245-268.
Dick H. J. Jongh & Franco Montagna (1987). Generic Generalized Rosser Fixed Points. Studia Logica 46 (2):193 - 203.
Giorgie Dzhaparidze (1990). Decidable and Enumerable Predicate Logics of Provability. Studia Logica 49 (1):7 - 21.
Petr Hájek (1997). Fuzzy Logic and Arithmetical Hierarchy, II. Studia Logica 58 (1):129-141.
V. V. Rybakov (1990). Logical Equations and Admissible Rules of Inference with Parameters in Modal Provability Logics. Studia Logica 49 (2):215 - 239.
Sergei Artëmov & Franco Montagna (1994). On First-Order Theories with Provability Operator. Journal of Symbolic Logic 59 (4):1139-1153.
Sergei Artemov & Giorgie Dzhaparidze (1990). Finite Kripke Models and Predicate Logics of Provability. Journal of Symbolic Logic 55 (3):1090-1098.
Konstantin N. Ignatiev (1993). On Strong Provability Predicates and the Associated Modal Logics. Journal of Symbolic Logic 58 (1):249-290.
Lev D. Beklemishev (1996). Bimodal Logics for Extensions of Arithmetical Theories. Journal of Symbolic Logic 61 (1):91-124.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads1 ( #274,982 of 549,131 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
