Journal Article10.1007/BF01049412
Decidable and undecidable logics with a binary modality
TL;DR: An overview of decidability results for modal logics having a binary modality is given, and the demonstration of proof-techniques is put on to help in finding the borderlines between decidable and undecidable fragments of usual first-order logic.
read more
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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Undecidability of Propositional Separation Logic and Its Neighbours
James Brotherston,Max I. Kanovich +1 more
- 11 Jul 2010
TL;DR: It is shown that the purely propositional fragment of separation logic is undecidability, and a number of propositional systems which approximate separation logic are undecidable as well, including both Boolean BI and Classical BI.
Relation Algebras, Idempotent Semirings and Generalized Bunched Implication Algebras
Peter Jipsen
- 15 May 2017
TL;DR: A finitely-based variety of cyclic involutive GBI-algebras are constructed from so-called weakening relations, and it is proved that the class of weakening relation algebrAs is not finitely axiomatizable.
Sequent calculi with context restrictions and applications to conditional logic
Björn Lellmann
- 01 Jul 2013
TL;DR: The format of a sequent rule with context restrictions is introduced and the notion of cut trees as representations of rules constructed by absorbing cuts is introduced as a step towards a generic construction of cut free and tractable sequent calculi.
Labelled Natural Deduction for Interval Logics
Thomas Marthedal Rasmussen
- 10 Sep 2001
TL;DR: A Labelled Natural Deduction framework is developed for interval logics with emphasis on Signed Interval Logic and it is shown that normal derivations satisfy a subformula property.
14
Cut elimination for shallow modal logics
Björn Lellmann,Dirk Pattinson +1 more
- 04 Jul 2011
TL;DR: This work provides a generic translation of shallow axioms to (one-sided, unlabelled) sequent rules and obtains a small (PSPACE-computable) representation of an extended rule set for which cut elimination holds, leading to (tight) PSPACE bounds for various conditional logics.
References
Theory of Recursive Functions and Effective Computability
TL;DR: If searching for the ebook by Hartley Rogers Theory of Recursive Functions and Effective Computability in pdf format, then you've come to the faithful site, which presented the complete version of this book in PDF, DjVu, doc, ePub, txt forms.
3.5K
•Book
A Course in Universal Algebra
Stanley Burris,Hanamantagouda P. Sankappanavar +1 more
- 16 Nov 1981