Logical equations and admissible rules of inference with parameters in modal provability logics

Studia Logica 49 (2):215 - 239 (1990)
  Copy   BIBTEX


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.



    Upload a copy of this work     Papers currently archived: 79,702

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library


Added to PP

33 (#368,197)

6 months
1 (#479,744)

Historical graph of downloads
How can I increase my downloads?

References found in this work

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.

Add more references