Logic of Proofs for Bounded Arithmetic

DOI10.1007/11753728_21MaRDI QIDQ3434694zbMATH OpenOpenAlexFDO

Authors Evan Goris

Publication date 2 May 2007

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11753728_21

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Complexity of proofs (03F20) First-order arithmetic and fragments (03F30) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)

Recommendations

• Feasible operations on proofs: the logic of proofs for bounded arithmetic
• Kolmogorov and Gödel's approach to intuitionistic logic: current developments
• The logic of proofs, semantically
• Logic of proofs and provability
• On arithmetical completeness of the logic of proofs

Cited in

(12)

• Bounded arithmetic for NC, ALogTIME, L and NL
• A bounded arithmetic AID for Frege systems
• A proof theory for the logic of provability in true arithmetic
• scientific article; zbMATH DE number 5862941 (Why is no real title available?)
• Tracking evidence
• scientific article; zbMATH DE number 4006264 (Why is no real title available?)
• Validating Brouwer's continuity principle for numbers using named exceptions
• Symmetric Logic of Proofs
• scientific article; zbMATH DE number 2196511 (Why is no real title available?)
• On the provability logic of bounded arithmetic
• The bounded proof property via step algebras and step frames
• Feasible operations on proofs: the logic of proofs for bounded arithmetic

This page was built for publication: Logic of Proofs for Bounded Arithmetic

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