Problems of substitution and admissibility in the modal system Grz and in intuitionistic propositional calculus

DOI10.1016/0168-0072(90)90055-7zbMath0709.03009OpenAlexW2048520665MaRDI QIDQ920971

Vladimir Vladimirovich Rybakov

Publication date: 1990

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(90)90055-7

zbMATH Keywords

modal logicintuitionistic logicadmissibility of rules of inferencefree modal algebraintuitionistic calculus Hmodal system Grzsolvability of the substitution problem

Mathematics Subject Classification ID

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

Related Items (19)

Criteria for admissibility of inference rules. Modal and intermediate logics with the branching property ⋮ Admissible bases via stable canonical rules ⋮ European Summer Meeting of the Association for Symbolic Logic ⋮ Satisfiability in Boolean Logic (SAT problem) is polynomial? ⋮ Multiagent temporal logics, unification problems, and admissibilities ⋮ Multi-agent logics with dynamic accessibly relations, projective unifiers ⋮ Hereditarily structurally complete modal logics ⋮ Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\) ⋮ Dynamic temporal logical operations in multi-agent logics ⋮ What is an inference rule? ⋮ Admissibility and unification in the modal logics related to S4.2 ⋮ Best unifiers in transitive modal logics ⋮ Best solving modal equations ⋮ Unification in linear temporal logic LTL ⋮ On Finite Model Property for Admissible Rules ⋮ Unification and Inference Rules in the Multi-modal Logic of Knowledge and Linear Time LTK ⋮ DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV ⋮ Inference rules in Nelson's logics, admissibility and weak admissibility ⋮ Rules with parameters in modal logic. I.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The algebraic treatment of the methodology of elementary deductive systems
• Decidability of the admissibility problem in layer-finite logics
• Admissible rules for logics containing S4.3
• Elementary theories of free topo-Boolean and pseudo-Boolean algebras
• A criterion for admissibility of rules in the modal system S4 and intuitionistic logic
• Bases of admissible rules of the logics S4 and Int
• Equations in free topoboolean algebra
• Concerning the method of logical schemes, the notion of logical calculus and the role of consequence relations
• Concerning formulas of the types A→B ν C,A →(Ex)B(x) in intuitionistic formal systems
• DECIDABILITY OF ADMISSIBILITY IN THE MODAL SYSTEM Grz AND IN INTUITIONISTIC LOGIC
• One hundred and two problems in mathematical logic
• ON ADMISSIBLE RULES OF INTUITIONISTIC PROPOSITIONAL LOGIC
• BASES OF ADMISSIBLE RULES OF THE MODAL SYSTEM $ \mathrm{Grz}$ AND OF INTUITIONISTIC LOGIC
• An incomplete logic containing S4
• An incompleteness theorem in modal logic
• Algebraic semantics for modal logics I
• Modal Logics Between S 4 and S 5
• Some remarks on the consequence operation in sentential logics
• Semantic analysis of tense logics
• Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
• Some theorems about the sentential calculi of Lewis and Heyting
• Boolean Algebras with Operators. Part I

This page was built for publication: Problems of substitution and admissibility in the modal system Grz and in intuitionistic propositional calculus