Annals of Pure and Applied Logic 61 (1-2):75-93 (1991)

Let PLω be the provability logic of IΔ0 + ω1. We prove some containments of the form L ⊆ PLω < Th(C) where L is the provability logic of PA and Th(C) is a suitable class of Kripke frames
Keywords provability logic  bounded arithmetic  definable cuts
Categories (categorize this paper)
Reprint years 1993
DOI 10.1016/0168-0072(93)90199-n
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 72,577
Through your library

References found in this work BETA

On the Scheme of Induction for Bounded Arithmetic Formulas.A. J. Wilkie & J. B. Paris - 1987 - Annals of Pure and Applied Logic 35 (3):261-302.
Cuts, Consistency Statements and Interpretations.Pavel Pudlák - 1985 - Journal of Symbolic Logic 50 (2):423-441.
Modal Analysis of Generalized Rosser Sentences.Vítězslav Švejdar - 1983 - Journal of Symbolic Logic 48 (4):986-999.

View all 9 references / Add more references

Citations of this work BETA

Montague’s Paradox, Informal Provability, and Explicit Modal Logic.Walter Dean - 2014 - Notre Dame Journal of Formal Logic 55 (2):157-196.

View all 10 citations / Add more citations

Similar books and articles


Added to PP index

Total views
16 ( #671,246 of 2,533,601 )

Recent downloads (6 months)
1 ( #389,998 of 2,533,601 )

How can I increase my downloads?


My notes