scientific article; zbMATH DE number 7561320

DOI10.4230/LIPICS.FSTTCS.2018.15MaRDI QIDQ5090950FDOQ5090950

Authors: David Baelde, Anthony Lick, Sylvain Schmitz 

Publication date: 21 July 2022

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

modal logicproof systemhypersequent

Mathematics Subject Classification ID

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

Cites Work

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

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)