MetadataShow full item record
It is well known that Boolean logic circuits are functionally equivalent to propositional logic. This thesis develops an extension of Boolean logic circuits that are functionally equivalent to modal logic with Kripke semantics. We call these circuits modal circuits. We ﬁrst deﬁne how modal circuits work with a series of deﬁnitions. Then we prove that modal circuits are functionally equivalent to modal logic with Kripke semantics. Using these circuits, we also deﬁne a modal analogue of Boolean circuit satisﬁability, called MCSAT. We show that the well known PSPACE-complete problem of modal satisﬁability (MSAT) is polynomial time reducible to MCSAT.