Axiomatization and polynomial solvability of strictly positive fragments of certain modal logics

DOI10.1134/S0001434618050322zbMath1491.03016OpenAlexW2811093937WikidataQ129647256 ScholiaQ129647256MaRDI QIDQ1668101

Mikhail V. Svyatlovskii

Publication date: 31 August 2018

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0001434618050322

zbMATH Keywords

epistemic logicstrictly positive modal logic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45)

Related Items

KRIPKE COMPLETENESS OF STRICTLY POSITIVE MODAL LOGICS OVER MEET-SEMILATTICES WITH OPERATORS, Modal companions of \(K4^+\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Positive provability logic for uniform reflection principles
• On the complexity of the closed fragment of Japaridze's provability logic
• On the reflection calculus with partial conservativity operators
• A universal algebra for the variable-free fragment of \({\mathrm{RC}^\nabla}\)
• Provability algebras and proof-theoretic ordinals. I
• On the positive fragment of the polymodal provability logic GLP
• Semilattices with closure
• Mathematical Logic for Life Science Ontologies
• A Note on Strictly Positive Logics and Word Rewriting Systems