Rules with parameters in modal logic. II.

DOI10.1016/j.apal.2020.102829zbMath1472.03016arXiv1905.13157OpenAlexW4206408917MaRDI QIDQ2004954

Emil Jeřábek

Publication date: 7 October 2020

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.13157

zbMATH Keywords

computational complexitymodal logicsequational unification

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

On the proof complexity of logics of bounded branching

Cites Work

• Complexity of admissible rules
• Substitution Frege and extended Frege proof systems in non-classical logics
• Intuitionistic propositional logic is polynomial-space complete
• Rules with parameters in modal logic. I.
• Computing queries with higher-order logics
• Canonical rules
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• Truth definitions in finite models
• Computational Complexity
• Unnamed Item
• Unnamed Item

This page was built for publication: Rules with parameters in modal logic. II.