Problems of substitution and admissibility in the modal system Grz and in intuitionistic propositional calculus
From MaRDI portal
Publication:920971
DOI10.1016/0168-0072(90)90055-7zbMath0709.03009MaRDI 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
modal logic; intuitionistic logic; admissibility of rules of inference; free modal algebra; intuitionistic calculus H; modal system Grz; solvability of the substitution problem
03B45: Modal logic (including the logic of norms)
03B25: Decidability of theories and sets of sentences
03B20: Subsystems of classical logic (including intuitionistic logic)
Related Items
On Finite Model Property for Admissible Rules, European Summer Meeting of the Association for Symbolic Logic, Hereditarily structurally complete modal logics, DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV, Satisfiability in Boolean Logic (SAT problem) is polynomial?, Unification and Inference Rules in the Multi-modal Logic of Knowledge and Linear Time LTK, Dynamic temporal logical operations in multi-agent logics, Admissibility and unification in the modal logics related to S4.2, Admissible bases via stable canonical rules, Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\), Best unifiers in transitive modal logics, Unification in linear temporal logic LTL, Criteria for admissibility of inference rules. Modal and intermediate logics with the branching property, Best solving modal equations, Multiagent temporal logics, unification problems, and admissibilities, Multi-agent logics with dynamic accessibly relations, projective unifiers, Inference rules in Nelson's logics, admissibility and weak admissibility, Rules with parameters in modal logic. I., What is an inference rule?
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
