Reduction of provability logics to _1-provability logics
From MaRDI portal
Publication:4644602
Recommendations
Cited in
(14)- A reduction of proof complexity to computational complexity for đŽđ¶â°[đ] Frege systems
- On the convergence of reduction-based and model-based methods in proof theory
- Does reductive proof theory have a viable rationale?
- Proof-theoretic reduction as a philosopher's tool
- A formal reduction of the general problem of expressibility of formulas in the Gödel-Löb provability logic
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
- Reductions for non-clausal theorem proving
- The \(\Sigma_1\)-provability logic of \(\mathsf{HA}\)
- Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
- REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEETâCOMBINATION
- scientific article; zbMATH DE number 2095713 (Why is no real title available?)
- Hard provability logics
- On Relating Theories: Proof-Theoretical Reduction
- The \(\Sigma_1\)-provability logic of \(\mathsf{HA}^{*}\)
This page was built for publication: Reduction of provability logics to \(\Sigma_1\)-provability logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4644602)