Decidability of the admissibility problem in layer-finite logics

DOI10.1007/BF01979701zbMath0576.03012OpenAlexW2062047612MaRDI QIDQ1064315

Vladimir Vladimirovich Rybakov

Publication date: 1984

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/187258

zbMATH Keywords

free algebrasinterior algebrasquasiidentitiesadmissible rules of inferenceclosure algebraslayer-finite propositional modal logics

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25)

Related Items

A criterion for admissibility of rules in the modal system S4 and intuitionistic logic, Bases of admissible rules of the logics S4 and Int, Problems of substitution and admissibility in the modal system Grz and in intuitionistic propositional calculus, Unification in pretabular extensions of S4, DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV

Cites Work

• ON ADMISSIBLE RULES OF INTUITIONISTIC PROPOSITIONAL LOGIC
• Unnamed Item
• Unnamed Item