Studia Logica 49 (2):215 - 239 (1990)
Abstract |
This paper concerns modal logics of provability — Gödel-Löb systemGL and Solovay logicS — the smallest and the greatest representation of arithmetical theories in propositional logic respectively. We prove that the decision problem for admissibility of rules (with or without parameters) inGL andS is decidable. Then we get a positive solution to Friedman''s problem forGL andS. We also show that A. V. Kuznetsov''s problem of the existence of finite basis for admissible rules forGL andS has a negative solution. Afterwards we give an algorithm deciding the solvability of logical equations inGL andS and constructing some solutions.
|
Keywords | No keywords specified (fix it) |
Categories | (categorize this paper) |
DOI | 10.1007/BF00935600 |
Options |
![]() ![]() ![]() ![]() |
Download options
References found in this work BETA
An Essay in Classical Modal Logic.Krister Segerberg - 1971 - Uppsala, Sweden: Uppsala, Filosofiska Föreningen Och Filosofiska Institutionen Vid Uppsala Universitet.
One Hundred and Two Problems in Mathematical Logic.Harvey Friedman - 1975 - Journal of Symbolic Logic 40 (2):113-129.
Arithmetical Necessity, Provability and Intuitionistic Logic.Rob Goldblatt - 1978 - Theoria 44 (1):38-46.
Citations of this work BETA
What is an Inference Rule?Ronald Fagin, Joseph Y. Halpern & Moshe Y. Vardi - 1992 - Journal of Symbolic Logic 57 (3):1018-1045.
Rules with Parameters in Modal Logic I.Emil Jeřábek - 2015 - Annals of Pure and Applied Logic 166 (9):881-933.
Criteria for Admissibility of Inference Rules. Modal and Intermediate Logics with the Branching Property.Vladimir V. Rybakov - 1994 - Studia Logica 53 (2):203 - 225.
Best Unifiers in Transitive Modal Logics.Vladimir V. Rybakov - 2011 - Studia Logica 99 (1-3):321-336.
Decidability of Admissibility: On a Problem by Friedman and its Solution by Rybakov.Jeroen P. Goudsmit - 2021 - Bulletin of Symbolic Logic 27 (1):1-38.
Similar books and articles
Bimodal Logics for Extensions of Arithmetical Theories.Lev D. Beklemishev - 1996 - Journal of Symbolic Logic 61 (1):91-124.
Metalogic of Intuitionistic Propositional Calculus.Alex Citkin - 2010 - Notre Dame Journal of Formal Logic 51 (4):485-502.
Logical Consecutions in Discrete Linear Temporal Logic.V. V. Rybakov - 2005 - Journal of Symbolic Logic 70 (4):1137 - 1149.
Best Unifiers in Transitive Modal Logics.Vladimir V. Rybakov - 2011 - Studia Logica 99 (1-3):321-336.
On Self-Admissible Quasi-Characterizing Inference Rules.V. V. Rybakov, M. Terziler & C. Gencer - 2000 - Studia Logica 65 (3):417-428.
Criteria for Admissibility of Inference Rules. Modal and Intermediate Logics with the Branching Property.Vladimir V. Rybakov - 1994 - Studia Logica 53 (2):203 - 225.
Axiomatizations with Context Rules of Inference in Modal Logic.Valentin Goranko - 1998 - Studia Logica 61 (2):179-197.
Finite Kripke Models and Predicate Logics of Provability.Sergei Artemov & Giorgie Dzhaparidze - 1990 - Journal of Symbolic Logic 55 (3):1090-1098.
Rules of Inference with Parameters for Intuitionistic Logic.Vladimir V. Rybakov - 1992 - Journal of Symbolic Logic 57 (3):912-923.
Analytics
Added to PP index
2009-01-28
Total views
33 ( #343,690 of 2,499,869 )
Recent downloads (6 months)
2 ( #277,946 of 2,499,869 )
2009-01-28
Total views
33 ( #343,690 of 2,499,869 )
Recent downloads (6 months)
2 ( #277,946 of 2,499,869 )
How can I increase my downloads?
Downloads