Reduction of provability logics to _1-provability logics
From MaRDI portal
Publication:4644602
DOI10.1093/JIGPAL/JZV031zbMATH Open1405.03094OpenAlexW2225896778MaRDI QIDQ4644602FDOQ4644602
Authors: Mohammad Ardeshir, S. Mojtaba Mojtahedi
Publication date: 8 January 2019
Published in: Logic Journal of the IGPL (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/jigpal/jzv031
Recommendations
First-order arithmetic and fragments (03F30) Provability logics and related algebras (e.g., diagonalizable algebras) (03F45)
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
- Reductions for non-clausal theorem proving
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
- 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
- Title not available (Why is that?)
- 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)