Admissibility of rules of inference, and logical equations, in modal logics axiomatizing provability
Izvestiya. Mathematics , Tome 36 (1991) no. 2, pp. 369-390
Voir la notice de l'article provenant de la source Math-Net.Ru
This paper examines the modal logics of Gödel-Löb (GL) and Solovay (S) – the smallest and the largest modal representations of arithmetic theories. The problem of recognizing the admissibility of inference rules with parameters (and, in particular, without parameters) in GL and S is shown to be decidable; that is, a positive solution is obtained to analogues of a problem of Friedman. The analogue of a problem of Kuznetsov on finite bases of admissible rules for S and GL is solved in the negative sense. Algorithms are found for recognizing the solvability in GL and S of logical equations and for constructing solutions for them.
@article{IM2_1991_36_2_a7,
author = {V. V. Rybakov},
title = {Admissibility of rules of inference, and logical equations, in modal logics axiomatizing provability},
journal = {Izvestiya. Mathematics },
pages = {369--390},
publisher = {mathdoc},
volume = {36},
number = {2},
year = {1991},
language = {en},
url = {http://geodesic.mathdoc.fr/item/IM2_1991_36_2_a7/}
}
TY - JOUR AU - V. V. Rybakov TI - Admissibility of rules of inference, and logical equations, in modal logics axiomatizing provability JO - Izvestiya. Mathematics PY - 1991 SP - 369 EP - 390 VL - 36 IS - 2 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/IM2_1991_36_2_a7/ LA - en ID - IM2_1991_36_2_a7 ER -
V. V. Rybakov. Admissibility of rules of inference, and logical equations, in modal logics axiomatizing provability. Izvestiya. Mathematics , Tome 36 (1991) no. 2, pp. 369-390. http://geodesic.mathdoc.fr/item/IM2_1991_36_2_a7/