Decidable and undecidable logics with a binary modality

We give an overview of decidability results for modal logics having a binary modality. We put an emphasis on the demonstration of proof-techniques, and hope that this will also help in finding the borderlines between decidable and undecidable fragments of usual first-order logic.
Keywords poly-modal and multi-modal logics  decision problems  Arrow logics  algebraic logic  relation algebra  associativity  dynamic logics  action algebras  Boolean algebras with operators
Categories (categorize this paper)
DOI 10.1007/BF01049412
 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: 23,201
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

View all 8 references / Add more references

Citations of this work BETA
Michał Walicki, Marc Bezem & Wojtek Szajnkenig (2009). Developing Bounded Reasoning. Journal of Logic, Language and Information 18 (1):97-129.
Maarten Marx (1998). Amalgamation in Relation Algebras. Journal of Symbolic Logic 63 (2):479-484.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

22 ( #213,183 of 1,940,950 )

Recent downloads (6 months)

2 ( #333,818 of 1,940,950 )

How can I increase my downloads?

My notes
Sign in to use this feature

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