A criterion for admissibility of rules in the modal system S4 and intuitionistic logic
From MaRDI portal
(Redirected from Publication:1079558)
Recommendations
Cites work
- scientific article; zbMATH DE number 3769602 (Why is no real title available?)
- scientific article; zbMATH DE number 3485746 (Why is no real title available?)
- scientific article; zbMATH DE number 3639589 (Why is no real title available?)
- scientific article; zbMATH DE number 3328980 (Why is no real title available?)
- Concerning formulas of the types A→B ν C,A →(Ex)B(x) in intuitionistic formal systems
- Decidability of the admissibility problem in layer-finite logics
- ON ADMISSIBLE RULES OF INTUITIONISTIC PROPOSITIONAL LOGIC
- One hundred and two problems in mathematical logic
- The deducibilities of S5
Cited in
(48)- A tableau method for checking rule admissibility in S4
- 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} \)
- 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}^+\)
- DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV
- 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
- scientific article; zbMATH DE number 7324611 (Why is no real title available?)
- Admissibility in positive logics
- Admissible and derivable rules in intuitionistic logic
- Admissibility and Unifiability in Contact Logics
- Admissibility of logical inference rules
- Unification in pretabular extensions of S4
- Best unifiers in transitive modal logics
- Problems of substitution and admissibility in the modal system Grz and in intuitionistic propositional calculus
- Satisfiability in Boolean logic (SAT problem) is polynomial
- An explicit basis for admissible rules of modal logics of finite width
- European Summer Meeting of the Association for Symbolic Logic
- Rules with parameters in modal logic. I.
- Logical consecutions in discrete linear temporal logic
- On the rules of intermediate logics
- 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
- DECIDABILITY OF ADMISSIBILITY IN THE MODAL SYSTEM Grz AND IN INTUITIONISTIC LOGIC
- The decidability of admissibility problems for modal logics S4.2 and S4.2Grz and superintuitionistic logic KC
- Equations in free topoboolean algebra
- Hereditarily structurally complete modal logics
- Admissible inference rules of modal WCP-logics
- An explicit basis for \textit{WCP}-globally admissible inference rules
- Decidability of Hybrid Logic with Local Common Knowledge Based on Linear Temporal Logic LTL
- Admissibility and refutation: some characterisations of intermediate logics
- Admissibility via natural dualities
- 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
- Explicit basis for admissible rules in \(K\)-saturated tabular logics
- On Finite Model Property for Admissible Rules
- scientific article; zbMATH DE number 4031629 (Why is no real title available?)
- 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\)
- scientific article; zbMATH DE number 3959387 (Why is no real title available?)
- Finite frames fail: how infinity works its way into the semantics of admissibility
- A note on extensions: admissible rules via semantics
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)
