On the provability logic of bounded arithmetic

DOI10.1016/0168-0072(93)90199-NzbMath0803.03037MaRDI QIDQ685071

Rineke Verbrugge, Alessandro Berarducci

Publication date: 22 September 1993

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

bounded arithmeticKripke framesprovability logicweak fragment of Peano Arithmetic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) First-order arithmetic and fragments (03F30)

Related Items

Reflections on Orlov ⋮ Solutions to the knower paradox in the light of Haack's criteria ⋮ Provability and interpretability logics with restricted realizations ⋮ Provability logic: models within models in Peano arithmetic ⋮ The second incompleteness theorem and bounded interpretations ⋮ Bimodal logics for extensions of arithmetical theories ⋮ Feasible operations on proofs: the logic of proofs for bounded arithmetic ⋮ Montague's paradox, informal provability, and explicit modal logic ⋮ No escape from Vardanyan's theorem ⋮ Substitutions of \(\Sigma_1^0\)-sentences: Explorations between intuitionistic propositional logic and intuitionistic arithmetic

Cites Work

• Unnamed Item
• On the scheme of induction for bounded arithmetic formulas
• The decision problem for exponential diophantine equations
• On the proof of Solovay's theorem
• On the \(\Sigma{}^ 0_ 1\)-conservativity of \(\Sigma{}^ 0_ 1\)- completeness
• Provability interpretations of modal logic
• Modal analysis of generalized rosser sentences
• Cuts, consistency statements and interpretations
• Rosser sentences

This page was built for publication: On the provability logic of bounded arithmetic