Tableau systems for deontic action logics based on finite Boolean algebras, and their complexity
From MaRDI portal
(Redirected from Publication:526730)
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)
Recommendations
Cites work
- scientific article; zbMATH DE number 1142326 (Why is no real title available?)
- scientific article; zbMATH DE number 837700 (Why is no real title available?)
- scientific article; zbMATH DE number 3274715 (Why is no real title available?)
- A Tableaux System for Deontic Action Logic
- A deontic logic of action
- A practical decision method for propositional dynamic logic (preliminary report)
- Computational Complexity
- Deontic action logic, atomic Boolean algebras and fault-tolerance
- On deontic action logics based on Boolean algebra
Cited in
(7)- Towards Metalogical Systematisation of Deontic Action Logics Based on Boolean Algebra
- A systematics of deontic action logics based on Boolean algebra
- Tableaux for some deontic logics with the explicit permission operator
- A Tableaux System for Deontic Action Logic
- scientific article; zbMATH DE number 7450023 (Why is no real title available?)
- scientific article; zbMATH DE number 5316128 (Why is no real title available?)
- 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)