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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. N. Artemov,Modal logics axiomatizing provability,Izvestia AN SSSR, ser. matem. 49, no 6 (1985), pp. 1123–1154 (in Russian).
G. Boolos,The logic of provability,Amer. Math. Monthly 91, no 8 (1984), pp. 470–480.
R. Goldblatt,Arithmetical necessity, provability and intuitionistic logic,Theoria 44, no 1 (1978), pp. 38–46.
H. Friedman,One hundred and two problems of mathematical logic,Journal of Symbolic Logic 40 (1975), pp. 113–130.
A. V. Kuznetsov andA. U. Muravitsky,Provability as modality, In book:Actual Problems of Logic and Methodology of Science, Naukova dumka, Kiev, USSR, 1980, pp. 193–230.
J. Łoś andR. Suszko,Remarks on sentential logic,Indagationes Mathematicae 20 (1985), pp. 117–183.
V. V. Rybakov,Admissible rules in pretabular modal logics,Algebra i logika 20 (1981), pp. 440–464 (in Russian).
V. V. Rybakov,Admissible rules for logics containing S4.3,Sibirsky Math. Jour. 25, no 5 (1984), pp. 141–145 (in Russian).
V. V. Rybakov,Criterion of admissibility for modal system S4 and intuitionistic logic,Algebra i logika 23 (1984), pp. 546–572 (in Russian).
V. V. Rybakov,The bases for admissible rules of logics S4 and Int,Algebra i logika 24 (1985), pp. 87–107 (in Russian).
V. V. Rybakov,Decidability of admissibility in the modal system Grz and intuitionistic logic,Math. USSR Izvestia 28, no 3 (1987), pp. 589–608.
V. V. Rybakov,Bases of admissible rules of the modal system Grz and intuitionistic logic,Math. USSR Sbornik 56, no 2 (1987), pp. 311–331.
V. V. Rybakov,The equations in the free topoboolean algebras,Algebra i logika 25 no 2 (1986), pp. 172–204 (in Russian).
V. V. Rybakov,An algorithm for recognition of admissibility the rules of inference in modal system G, In book:Applications of Method Mathematical Logic, Section algorithms for difficult problems, Institute of Cybernetics Acad. Sc. Est. SSR, Tallin, 1986, pp. 175–177 (in Russian).
K. Segerberg,An Essay in Classical Modal Logic, V. 1–3, Filosofiska studier, Uppsala 1971.
R. M. Solovay,Provability interpretations of modal logic,Israel J. Math. 25 (1976), pp. 287–304.
A. I. Tsitkin,An admissible rule for intuitionistic propositional calculus,Mathemat. Sbornik 102, no 2 (1977), pp. 314–323 (in Russian, there exists an English translation).
A. Visser,Aspects of diagnolization and provability, Ph. D. Thesis, Utrecht, 1981.
R. Wójcicki,Investigations into methodology of sentential calculi (1), Inst. of Phil, and Soc. PAS, Warsaw 1971.
Logical Note-Book. Unsolved Questions of Mathematical Logic, Mathematical Inst. SO AN SSSR, Novosibirsk, 1986 (in Russian).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Rybakov, V.V. Logical equations and admissible rules of inference with parameters in modal provability logics. Stud Logica 49, 215–239 (1990). https://doi.org/10.1007/BF00935600
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00935600