A criterion for admissibility of rules in the modal system S4 and intuitionistic logic
From MaRDI portal
Publication:1079558
DOI10.1007/BF01982031zbMATH Open0598.03013OpenAlexW2046526482MaRDI QIDQ1079558FDOQ1079558
Authors: Vladimir Rybakov 
Publication date: 1984
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/187289
Recommendations
Other nonclassical logic (03B60) Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25) Intermediate logics (03B55) Metamathematics of constructive systems (03F50) Other algebras related to logic (03G25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- One hundred and two problems in mathematical logic
- Concerning formulas of the types A→B ν C,A →(Ex)B(x) in intuitionistic formal systems
- ON ADMISSIBLE RULES OF INTUITIONISTIC PROPOSITIONAL LOGIC
- Decidability of the admissibility problem in layer-finite logics
- The deducibilities of S5
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (48)
- Unification in linear temporal logic LTL
- Inference rules in Nelson's logics, admissibility and weak admissibility
- Decidability of the admissibility problem in layer-finite logics
- About the unification type of modal logics between \(\mathbf{KB}\) and \(\mathbf{KTB} \)
- DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV
- On unification and admissible rules in Gabbay-de Jongh logics
- Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\)
- Criteria for admissibility of inference rules. Modal and intermediate logics with the branching property
- Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition
- Title not available (Why is that?)
- Admissible and derivable rules in intuitionistic logic
- Admissibility in positive logics
- Admissibility and Unifiability in Contact Logics
- Unification in pretabular extensions of S4
- Admissibility of logical inference rules
- Satisfiability in Boolean logic (SAT problem) is polynomial
- Best unifiers in transitive modal logics
- Problems of substitution and admissibility in the modal system Grz and in intuitionistic propositional calculus
- An explicit basis for admissible rules of modal logics of finite width
- European Summer Meeting of the Association for Symbolic Logic
- Logical consecutions in discrete linear temporal logic
- Rules with parameters in modal logic. I.
- On the rules of intermediate logics
- DECIDABILITY OF ADMISSIBILITY IN THE MODAL SYSTEM Grz AND IN INTUITIONISTIC LOGIC
- 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
- The decidability of admissibility problems for modal logics S4.2 and S4.2Grz and superintuitionistic logic KC
- Equations in free topoboolean algebra
- Admissible inference rules of modal WCP-logics
- An explicit basis for \textit{WCP}-globally admissible inference rules
- Hereditarily structurally complete modal logics
- Decidability of Hybrid Logic with Local Common Knowledge Based on Linear Temporal Logic LTL
- Explicit basis for admissible rules in \(K\)-saturated tabular logics
- Admissibility via natural dualities
- Admissibility and refutation: some characterisations of intermediate logics
- Description of modal logics which enjoy co-cover property
- Semantic admissibility criteria for deduction rules in S4 and Int
- Logic of knowledge and discovery via interacting agents -- decision algorithm for true and satisfiable statements
- On Finite Model Property for Admissible Rules
- Title not available (Why is that?)
- Admissible inference rules in the linear logic of knowledge and time \(\mathrm{LTK}_r\) with intransitive time relation
- Strongly decidable properties of modal and intuitionistic calculi
- KD is nullary
- Multiple conclusion rules in logics with the disjunction property
- Decidability of quantified propositional intuitionistic logic and S4 on trees of height and arity \(\leq \omega\)
- Title not available (Why is that?)
- Finite frames fail: how infinity works its way into the semantics of admissibility
- A note on extensions: admissible rules via semantics
- A tableau method for checking rule admissibility in S4
This page was built for publication: A criterion for admissibility of rules in the modal system S4 and intuitionistic logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1079558)
