On the provability logic of bounded arithmetic

DOI10.1016/0168-0072(93)90199-NzbMATH Open0803.03037MaRDI QIDQ685071FDOQ685071

Authors: Rineke Verbrugge, Alessandro Berarducci 

Publication date: 22 September 1993

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

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

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)

Cites Work

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

Cited In (25)

• A proof theory for the logic of provability in true arithmetic
• Finite automata, real time processes and counting problems in bounded arithmetics
• Bimodal logics for extensions of arithmetical theories
• Substitutions of \(\Sigma_1^0\)-sentences: Explorations between intuitionistic propositional logic and intuitionistic arithmetic
• Structure and definability in general bounded arithmetic theories
• Provability logic: models within models in Peano arithmetic
• On the scheme of induction for bounded arithmetic formulas
• On the bounded version of Hilbert's tenth problem
• Quantified propositional calculi and fragments of bounded arithmetic
• Title not available (Why is that?)
• Provability and interpretability logics with restricted realizations
• Reflections on Orlov
• The second incompleteness theorem and bounded interpretations
• Montague's paradox, informal provability, and explicit modal logic
• 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}
• The bounded proof property via step algebras and step frames
• Feasible operations on proofs: the logic of proofs for bounded arithmetic
• No escape from Vardanyan's theorem
• The provability logics of recursively enumerable theories extending Peano arithmetic at arbitrary theories extending Peano arithmetic
• Bounded arithmetic, proof complexity and two papers of Parikh
• A small reflection principle for bounded arithmetic
• PROVABILITY LOGIC IN THE GENTZEN FORMULATION OF ARITHMETIC
• A bounded arithmetic AID for Frege systems
• Title not available (Why is that?)
• Solutions to the knower paradox in the light of Haack's criteria

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)