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

DOI10.1007/S00224-007-9058-XzbMath1144.03038OpenAlexW1991386049MaRDI QIDQ929293

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

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)

Related Items (1)

A modal provability logic of explicit and implicit proofs

Cites Work

• Unnamed Item
• Unnamed Item
• On the provability logic of bounded arithmetic
• Provability interpretations of modal logic
• Explicit Provability and Constructive Semantics
• Introducing Justification into Epistemic Logic
• Reasoning with Justifications
• Logical Omniscience Via Proof Complexity
• Justified and Common Knowledge: Limited Conservativity
• Existence and feasibility in arithmetic

This page was built for publication: Feasible operations on proofs: the logic of proofs for bounded arithmetic