Basic Normal Modal Logic K
Normal propositional modal logic K, with arbitrary Kripke accessibility; local satisfiability is PSPACE-complete.
Normal Modal LogicsThe directory29 published entries
Welcome to LogicalZoo
Explore formal logics, their expressive power, and their relationships. A growing reference guide from syntax and semantics to decidability and complexity.
Find a logic
Search results
12 entriesTransitive Modal Logic K4
Normal propositional modal logic K4, with transitive Kripke accessibility; local satisfiability is PSPACE-complete.
Normal Modal LogicsTransitive Euclidean Modal Logic K45
Normal propositional modal logic K45, with transitive and Euclidean Kripke accessibility; local satisfiability is NP-complete.
Normal Modal LogicsEuclidean Modal Logic K5
Normal propositional modal logic K5, with Euclidean Kripke accessibility; local satisfiability is NP-complete.
Normal Modal LogicsNormal Modal Logic KB
Normal propositional modal logic KB, with symmetric Kripke accessibility; local satisfiability is PSPACE-complete.
Normal Modal LogicsSymmetric Euclidean Modal Logic KB5
Normal propositional modal logic KB5, with symmetric and Euclidean Kripke accessibility; local satisfiability is NP-complete.
Normal Modal LogicsNormal Modal Logic KD
Normal propositional modal logic KD, with serial Kripke accessibility; local satisfiability is PSPACE-complete.
Normal Modal LogicsSerial Transitive Modal Logic KD4
Normal propositional modal logic KD4, with serial and transitive Kripke accessibility; local satisfiability is PSPACE-complete.
Normal Modal LogicsSerial Transitive Euclidean Modal Logic KD45
Normal propositional modal logic KD45, with serial and transitive and Euclidean Kripke accessibility; local satisfiability is NP-complete.
Normal Modal LogicsSerial Euclidean Modal Logic KD5
Normal propositional modal logic KD5, with serial and Euclidean Kripke accessibility; local satisfiability is NP-complete.
Normal Modal LogicsNormal Modal Logic KDB
Normal propositional modal logic KDB, with serial and symmetric Kripke accessibility; local satisfiability is PSPACE-complete.
Normal Modal LogicsNormal Modal Logic T
Normal propositional modal logic KT, with reflexive Kripke accessibility; local satisfiability is PSPACE-complete.
Normal Modal Logics