scientific article; zbMATH DE number 7561320

DOI10.4230/LIPICS.FSTTCS.2018.15MaRDI QIDQ5090950zbMATH OpenFDO

Authors David Baelde, Anthony Lick, Sylvain Schmitz

Publication date 21 July 2022

zbMATH Keywords

modal logicproof systemhypersequent

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Recommendations

• A hypersequent calculus with clusters for data logic over ordinals
• Tense logic based on finite orthomodular posets
• Cut-free sequent calculi for some tense logics
• The Complexity of Temporal Logic with Until and Since over Ordinals
• A Focused Sequent Calculus for Higher-Order Logic
• Tense logics over lattices
• The sequent systems and algebraic semantics of intuitionistic tense logics
• Sequent calculus for hybrid logic
• scientific article; zbMATH DE number 1341473
• Dynamic order algebras as an axiomatization of modal and tense logics

Cites work

• scientific article; zbMATH DE number 3129315 (Why is no real title available?)
• scientific article; zbMATH DE number 3940713 (Why is no real title available?)
• scientific article; zbMATH DE number 970628 (Why is no real title available?)
• A cut-free cyclic proof system for Kleene algebra
• A purely syntactic and cut-free sequent calculus for the modal logic of provability
• A sequent calculus for a modal logic on finite data trees
• Automata and temporal logic over arbitrary linear time
• Automata on linear orderings
• Cut elimination theorem for non-commutative hypersequent calculus
• Cut-free hypersequent calculus for S4.3.
• Cut-free sequent calculi for some tense logics
• Decision problems for propositional linear logic
• Deep sequent systems for modal logic
• Display logic
• First-order logic with two variables and unary temporal logic
• Hypersequents, logical consequence and intermediate logics for concurrency
• LINEAR TIME IN HYPERSEQUENT FRAMEWORK
• Linear Nested Sequents, 2-Sequents and Hypersequents
• Modal logic
• On modal systems having arithmetical interpretations
• On the size of refutation Kripke models for some linear modal and tense logics
• Proof analysis in modal logic
• Reasoning in a restricted temporal logic
• Temporal logics over linear time domains are in PSPACE
• The Method of Tree-Hypersequents for Modal Propositional Logic
• The complexity of linear-time temporal logic over the class of ordinals
• The complexity of propositional linear temporal logics
• Two variable first-order logic over ordered domains

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090950)