Bisimulations and Boolean Vectors

Abstract A modal accessibility relation is just a transition relation, and so can be represented by a {0, 1} valued transition matrix. Starting from this observation, I first show that the machinery of matrices, over Boolean algebras more general than the two-valued one, is appropriate for investigating multi-modal semantics. Then I show that bisimulations have a rather elegant theory, when expressed in terms of transformations on Boolean vector spaces. The resulting theory is a curious hybrid, fitting between conventional modal semantics and conventional linear algebra. I don’t know where the investigations begun here will ultimately wind up, but in the meantime the approach has a kind of curious charm that others may find appealing.
Keywords No keywords specified (fix it)
Categories No categories specified (fix it)
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 5,701
External links
  •   Try with proxy.
  • Through your library Only published papers are available at libraries

    Similar books and articles
    Lars Hansen (2005). On an Algebra of Lattice-Valued Logic. Journal of Symbolic Logic 70 (1):282 - 318.

    Analytics

    Monthly downloads

    Added to index

    2010-12-22

    Total downloads

    2 ( #232,575 of 549,113 )

    Recent downloads (6 months)

    0

    How can I increase my downloads?


    My notes
    Sign in to use this feature


    Discussion
    Start a new thread
    Order:
    There  are no threads in this forum
    Nothing in this forum yet.

    Other forums