Admissible Rules of Modal Logics

From MaRDI portal
Publication:5696300

DOI10.1093/logcom/exi029zbMath1077.03011OpenAlexW2126852230WikidataQ56474451 ScholiaQ56474451MaRDI QIDQ5696300

Emil Jeřábek

Publication date: 18 October 2005

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exi029




Related Items (48)

On rulesAdmissible inference rules and semantic property of modal logicsAlmost structural completeness; an algebraic approachMultiple Conclusion Rules in Logics with the Disjunction PropertyA syntactic approach to unification in transitive reflexive modal logicsConsequence relations and admissible rulesUNIFICATION IN INTERMEDIATE LOGICSTutorial on Admissible Rules in GudauriA Note on Extensions: Admissible Rules via SemanticsA Tableau Method for Checking Rule Admissibility in S4Structural completeness in propositional logics of dependenceAdmissibility in De Morgan algebrasHypersequent rules with restricted contexts for propositional modal logicsComplexity of admissible rulesRules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient conditionUnification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\)On unification and admissible rules in Gabbay-de Jongh logicsAdmissible rules for six intuitionistic modal logicsAdmissibility and unification in the modal logics related to S4.2Admissible inference rules of modal WCP-logicsAn explicit basis for \textit{WCP}-globally admissible inference rulesAdmissible rules in the implication-negation fragment of intuitionistic logicHereditarily structurally complete intermediate logics: Citkin's theorem via dualityBest unifiers in transitive modal logicsChecking Admissibility Using Natural Dualities2006–07 Winter Meeting of the Association for Symbolic LogicA meta-logic of inference rules: SyntaxBranching 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 algorithmsAdmissibility and refutation: some characterisations of intermediate logicsMathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting)Linear temporal logic with until and next, logical consecutionsPRESERVATION OF ADMISSIBLE RULES WHEN COMBINING LOGICSUnification in linear temporal logic LTLThe admissible rules of \(\mathsf{BD}_2\) and \(\mathsf{GSc}\)Frege systems for extensible modal logicsHypersequent Systems for the Admissible Rules of Modal and Intermediate LogicsProof Complexity of Non-classical LogicsSugihara algebras: admissibility algebras via the test spaces methodDeductive systems with multiple-conclusion rules and the disjunction propertySubstitution Frege and extended Frege proof systems in non-classical logicsProof theory for admissible rulesCanonical rulesUnification and Inference Rules in the Multi-modal Logic of Knowledge and Linear Time LTKUnification in Linear Modal Logic on Non-transitive Time with the Universal ModalityDECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOVInference rules in Nelson's logics, admissibility and weak admissibilityRules with parameters in modal logic. I.Admissibility via natural dualities




This page was built for publication: Admissible Rules of Modal Logics