On the Decidability of Certain Semi-Lattice Based Modal Logics

@inproceedings{Bimb2017OnTD,
  title={On the Decidability of Certain Semi-Lattice Based Modal Logics},
  author={Katalin Bimb{\'o}},
  booktitle={TABLEAUX},
  year={2017}
}
  • K. Bimbó
  • Published in TABLEAUX 25 September 2017
  • Philosophy, Mathematics
Sequent calculi are proof systems that are exceptionally suitable for proving the decidability of a logic. Several relevance logics were proved decidable using a technique attributable to Curry and Kripke. Further enhancements led to a proof of the decidability of implicational ticket entailment by Bimbo and Dunn in [12, 13]. This paper uses a different adaptation of the same core proof technique to prove a group of positive modal logics (with disjunction but no conjunction) decidable. 
View via Publisher
sites.ualberta.ca
1 Citations

One Citation

Citation Type

Citation Type

Interpretations of Weak Positive Modal Logics
  • K. Bimbó
  • Philosophy
    Outstanding Contributions to Logic
  • 2021

References

SHOWING 1-10 OF 34 REFERENCES
On the decidability of implicational ticket entailment
TLDR
It is shown that the implicational fragment of the logic of ticket entailment, T→ is decidable, based on the consecution calculus that was introduced specifically to solve the decidability problem of T→.
The decidability of the intensional fragment of classical linear logic
  • K. Bimbó
  • Philosophy, Mathematics
    Theor. Comput. Sci.
  • 2015
Improved Decision Procedures for Pure Relevant Logic
TLDR
Finite model properties for various fragments of R, including R→ have the finite model property and are hence model-theoretically decidable and shown how to define various logical particles using Church’s propositional quantifiers, which turns what are conservative extension results at the quantifier-free level into axiomatic extensions when quantifiers are present.
SEMANTICAL ANALYSIS OF MODAL LOGIC II. NON-NORMAL MODAL PROPOSITIONAL CALCULI
Calculi for symmetric generalized galois logics
Symmetric generalized Galois logics are motivated by proof theoretical, categorical and linguistic regularities, among others. This paper focuses on the proof theory of these logics. First, the…
Semantical Analysis of Modal Logic I Normal Modal Propositional Calculi
Publisher Summary This chapter discusses semantical analysis of modal logic ii and non-normal modal propositional calculi. The proof of sufficiency, which is omitted by many, proceeds by constructing…
Generalized Galois Logics: Relational Semantics of Nonclassical Logical Calculi
Nonclassical logics have recently played an increasing role in disciplines ranging from mathematics and computer science to linguistics and philosophy. "Generalized Galois Logics" develops a uniform…
What is relevance logic?
  • A. Avron
  • Philosophy, Computer Science
    Ann. Pure Appl. Log.
  • 2014
Combinators and Structurally Free Logic
TLDR
A “Kripke-style” semantics is given for combinatory logic using frames with a ternary accessibility relation, much as in the Routley-Meyer semantics for relevance logic, and a philosophical interpretation is given of the models, showing that an element of a combinatory poset can be understood simultaneously as a set of states and as aSet of (untyped) actions on states.
Positive modal logic
TLDR
A set of postulates for the minimal normal modal logicK+ without negation or any kind of implication is given, and it is shown thatK+ is complete with respect to the usual Kripke-style semantics.
...
...