View Item 
        •   Utrecht University Student Theses Repository Home
        • UU Theses Repository
        • Theses
        • View Item
        •   Utrecht University Student Theses Repository Home
        • UU Theses Repository
        • Theses
        • View Item
        JavaScript is disabled for your browser. Some features of this site may not work without it.

        Browse

        All of UU Student Theses RepositoryBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

        Modal Circuits

        Thumbnail
        View/Open
        thesis upload version.pdf (222.4Kb)
        Publication date
        2017
        Author
        Hendriks, T.
        Metadata
        Show full item record
        Summary
        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 first define how modal circuits work with a series of definitions. Then we prove that modal circuits are functionally equivalent to modal logic with Kripke semantics. Using these circuits, we also define a modal analogue of Boolean circuit satisfiability, called MCSAT. We show that the well known PSPACE-complete problem of modal satisfiability (MSAT) is polynomial time reducible to MCSAT.
        URI
        https://studenttheses.uu.nl/handle/20.500.12932/27364
        Collections
        • Theses
        Utrecht university logo