9 citations · 10 across the 3 of their papers we have counts for
3 papers
cs.LO2020
Hypersequent calculi for non-normal modal and deontic logics: Countermodels and optimal complexity
Tiziano Dalmonte, Björn Lellmann, Nicola Olivetti +1
We present some hypersequent calculi for all systems of the classical cube and their extensions with axioms , , , and, for every , rule . The calculi are…
cs.LO2019★ 1 cited
Syntactic cut-elimination and backward proof-search for tense logic via linear nested sequents (Extended version)
Rajeev Goré, Björn Lellmann
We give a linear nested sequent calculus for the basic normal tense logic Kt. We show that the calculus enables backwards proof-search, counter-model construction and syntactic cut…
cs.LO2017★ 9 cited
Mīmā\d{m}sā deontic logic: proof theory and applications
Agata Ciabattoni, Elisa Freschi, Francesco A. Genco +1
Starting with the deontic principles in M\=ımā\d{m}sā texts we introduce a new deontic logic. We use general proof-theoretic methods to obtain a cut-free sequent calculus for this…