Bases of admissible rules of the logics S4 and Int

DOI10.1007/BF01978706zbMath0598.03014MaRDI QIDQ1079559

Vladimir Vladimirovich Rybakov

Publication date: 1985

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

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

zbMATH Keywords

modal logic; finite basis; admissible rules; intuitionistic propositional calculus; infinite basis

Mathematics Subject Classification ID

03B45: Modal logic (including the logic of norms)

03B60: Other nonclassical logic

03B25: Decidability of theories and sets of sentences

03G25: Other algebras related to logic

03F50: Metamathematics of constructive systems

03B55: Intermediate logics

Related Items

Admissible and derivable rules in intuitionistic logic, Logical consecutions in discrete linear temporal logic, An explicit basis for admissible inference rules in table modal logics of width 2, Table admissible inference rules, Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition, Problems of substitution and admissibility in the modal system Grz and in intuitionistic propositional calculus, Branching time logics \(\mathcal {BTL}^{\text{U,S}}_{\text{N},\text{N}^{-1}}(\mathcal {Z})_{\alpha }\) with operations \textit{Until} and \textit{Since} based on bundles of integer numbers, logical consecutions, deciding algorithms, Solvability of logical equations in the modal system Grz and intuitionistic logic, Criteria for admissibility of inference rules. Modal and intermediate logics with the branching property

Cites Work

• Unnamed Item
• Decidability of the admissibility problem in layer-finite logics
• Completeness of calculii for axiomatically defined classes of algebras
• One hundred and two problems in mathematical logic
• ON ADMISSIBLE RULES OF INTUITIONISTIC PROPOSITIONAL LOGIC
• Modal Logics Between S 4 and S 5