Feasible operations on proofs: the logic of proofs for bounded arithmetic

DOI10.1007/S00224-007-9058-XzbMATH Open1144.03038OpenAlexW1991386049MaRDI QIDQ929293FDOQ929293

Authors: Evan Goris 

Publication date: 17 June 2008

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-007-9058-x

Recommendations

• Logic of Proofs for Bounded Arithmetic
• The logic of proofs, semantically
• Logic of proofs and provability
• Logics of proofs and justifications
• On arithmetical completeness of the logic of proofs

zbMATH Keywords

bounded arithmeticlogic of proofsarithmetical completeness

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Explicit provability and constructive semantics
• Existence and feasibility in arithmetic
• Provability interpretations of modal logic
• Introducing Justification into Epistemic Logic
• Reasoning with Justifications
• Logical Omniscience Via Proof Complexity
• Justified and Common Knowledge: Limited Conservativity
• On the provability logic of bounded arithmetic

Cited In (4)

• Logic of Proofs for Bounded Arithmetic
• Kolmogorov and Gödel's approach to intuitionistic logic: current developments
• A modal provability logic of explicit and implicit proofs
• Arithmetical Completeness of the Intuitionistic Logic of Proofs

This page was built for publication: Feasible operations on proofs: the 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 Q929293)