scientific article; zbMATH DE number 7561320

DOI10.4230/LIPIcs.FSTTCS.2018.15MaRDI QIDQ5090950

Anthony Lick, David Baelde, Sylvain Schmitz

Publication date: 21 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Temporal logics over linear time domains are in PSPACE
• Proof analysis in modal logic
• Deep sequent systems for modal logic
• Automata on linear orderings
• On the size of refutation Kripke models for some linear modal and tense logics
• Decision problems for propositional linear logic
• Reasoning in a restricted temporal logic
• Cut-free sequent calculi for some tense logics
• Hypersequents, logical consequence and intermediate logics for concurrency
• A cut-free cyclic proof system for Kleene algebra
• Display logic
• First-order logic with two variables and unary temporal logic
• Two variable first-order logic over ordered domains
• The complexity of linear-time temporal logic over the class of ordinals
• Linear Nested Sequents, 2-Sequents and Hypersequents
• The Method of Tree-Hypersequents for Modal Propositional Logic
• On modal systems having arithmetical interpretations
• The complexity of propositional linear temporal logics
• Cut Elimination Theorem for Non-Commutative Hypersequent Calculus
• LINEAR TIME IN HYPERSEQUENT FRAMEWORK
• A PURELY SYNTACTIC AND CUT-FREE SEQUENT CALCULUS FOR THE MODAL LOGIC OF PROVABILITY

This page was built for publication: