Decidable and undecidable logics with a binary modality

Journal of Logic, Language and Information 4 (3):191-206 (1995)
  Copy   BIBTEX

Abstract

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,881

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
56 (#285,674)

6 months
6 (#520,934)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Amalgamation in relation algebras.Maarten Marx - 1998 - Journal of Symbolic Logic 63 (2):479-484.
Developing bounded reasoning.Michał Walicki, Marc Bezem & Wojtek Szajnkenig - 2009 - Journal of Logic, Language and Information 18 (1):97-129.

Add more citations

References found in this work

Algebraizable Logics.W. J. Blok & Don Pigozzi - 2022 - Advanced Reasoning Forum.
Cylindric Algebras. Part II.Leon Henkin, J. Donald Monk & Alfred Tarski - 1988 - Journal of Symbolic Logic 53 (2):651-653.
Boolean Algebras with Operators.Alfred Tarski - 1953 - Journal of Symbolic Logic 18 (1):70-71.
[Omnibus Review].R. D. Maddux - 2001 - Bulletin of Symbolic Logic 7 (2):281-283.

View all 10 references / Add more references