Tableau systems for deontic action logics based on finite Boolean algebras, and their complexity
DOI10.1007/S11225-016-9688-6zbMATH Open1364.03028OpenAlexW2528006531MaRDI QIDQ526730FDOQ526730
Authors: Pablo F. Castro 
Publication date: 15 May 2017
Published in: Studia Logica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11225-016-9688-6
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modal logic (including the logic of norms) (03B45) Mechanization of proofs and logical operations (03B35) Logic in computer science (03B70) Complexity of computation (including implicit computational complexity) (03D15)
Cites Work
- Computational Complexity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A practical decision method for propositional dynamic logic (preliminary report)
- A deontic logic of action
- On deontic action logics based on Boolean algebra
- Deontic action logic, atomic Boolean algebras and fault-tolerance
- A Tableaux System for Deontic Action Logic
Cited In (7)
- Towards Metalogical Systematisation of Deontic Action Logics Based on Boolean Algebra
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tableaux for some deontic logics with the explicit permission operator
- A Tableaux System for Deontic Action Logic
- A systematics of deontic action logics based on Boolean algebra
- Deontic action logic, atomic Boolean algebras and fault-tolerance
This page was built for publication: Tableau systems for deontic action logics based on finite Boolean algebras, and their complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526730)
