On the provability logic of bounded arithmetic

DOI10.1016/0168-0072(93)90199-NMaRDI QIDQ685071zbMATH OpenFDO

Authors 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 arithmeticprovability logicKripke framesweak fragment of Peano Arithmetic

Mathematics Subject Classification ID

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

Recommendations

• An inside view of EXP; or, The closed fragment of the provability logic of IΔ₀ + Ω₁ with a prepositional constant for EXP
• Logic of Proofs for Bounded Arithmetic
• Biological Perspectives Irreversible Lithium-Induced Neuropathy: Two Cases
• scientific article; zbMATH DE number 5037198
• scientific article; zbMATH DE number 1341927

Cites work

• scientific article; zbMATH DE number 4059391 (Why is no real title available?)
• Cuts, consistency statements and interpretations
• Modal analysis of generalized rosser sentences
• On the \(\Sigma{}^ 0_ 1\)-conservativity of \(\Sigma{}^ 0_ 1\)- completeness
• On the proof of Solovay's theorem
• On the scheme of induction for bounded arithmetic formulas
• Provability interpretations of modal logic
• Rosser sentences
• The decision problem for exponential diophantine equations

Cited in

(25)

• Feasible operations on proofs: the logic of proofs for bounded arithmetic
• Reflections on Orlov
• The second incompleteness theorem and bounded interpretations
• scientific article; zbMATH DE number 4006264 (Why is no real title available?)
• The provability logics of recursively enumerable theories extending Peano arithmetic at arbitrary theories extending Peano arithmetic
• Provability and interpretability logics with restricted realizations
• A small reflection principle for bounded arithmetic
• scientific article; zbMATH DE number 2196511 (Why is no real title available?)
• Solutions to the knower paradox in the light of Haack's criteria
• Bounded arithmetic, proof complexity and two papers of Parikh
• Weak forms of the Regularity Principle in the presence of \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\bf {\mathsf {I}{\mathrm{E}}_1}$\end{document}
• On the scheme of induction for bounded arithmetic formulas
• No escape from Vardanyan's theorem
• On the bounded version of Hilbert's tenth problem
• Bimodal logics for extensions of arithmetical theories
• PROVABILITY LOGIC IN THE GENTZEN FORMULATION OF ARITHMETIC
• Structure and definability in general bounded arithmetic theories
• A bounded arithmetic AID for Frege systems
• Provability logic: models within models in Peano arithmetic
• Quantified propositional calculi and fragments of bounded arithmetic
• Substitutions of \(\Sigma_1^0\)-sentences: Explorations between intuitionistic propositional logic and intuitionistic arithmetic
• Montague's paradox, informal provability, and explicit modal logic
• A proof theory for the logic of provability in true arithmetic
• The bounded proof property via step algebras and step frames
• Finite automata, real time processes and counting problems in bounded arithmetics

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685071)