LINEAR TIME IN HYPERSEQUENT FRAMEWORK

DOI10.1017/bsl.2016.2zbMath1403.03114OpenAlexW2313862367MaRDI QIDQ5346691

Andrzej Indrzejczak

Publication date: 26 May 2017

Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/bsl.2016.2

zbMATH Keywords

proof theorytemporal logichypersequent calculi

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Temporal logic (03B44) Proof theory in general (including proof-theoretic semantics) (03F03)

Related Items

Cut Elimination Theorem for Non-Commutative Hypersequent Calculus, Proof theory for functional modal logic, Unnamed Item, CUT ELIMINATION IN HYPERSEQUENT CALCULUS FOR SOME LOGICS OF LINEAR TIME, On a multilattice analogue of a hypersequent S5 calculus, Two proofs of the algebraic completeness theorem for multilattice logic, CUT-FREE COMPLETENESS FOR MODULAR HYPERSEQUENT CALCULI FOR MODAL LOGICS K, T, AND D

Uses Software

• TABLEAUX
• Pesca

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Eliminability of cut in hypersequent calculi for some modal logics of linear frames
• Natural deduction, hybrid systems and modal logics
• Proof analysis in modal logic
• Deep sequent systems for modal logic
• Gentzen calculi for modal propositional logic
• Proof theory. 2nd ed
• TABLEAUX: A general theorem prover for modal logics
• Cut-free sequent calculi for some tense logics
• Hypersequents, logical consequence and intermediate logics for concurrency
• A labelled natural deduction system for linear temporal logic
• Display logic
• Hypersequent and display calculi -- a unified perspective
• Proof theory for fuzzy logics
• A deep inference system for the modal logic S5
• Structural Extensions of Display Calculi: A General Recipe
• Hypersequent Calculi for S5: The Methods of Cut Elimination
• A Simple Proof of Completeness and Cut-admissibility for Propositional Godel Logic
• Axioms vs Hypersequent Rules with Context Restrictions: Theory and Applications
• Determiners and logic
• A CUT-FREE SIMPLE SEQUENT CALCULUS FOR MODAL LOGIC S5
• A constructive analysis of RM
• Editorial
• Practical reasoning for very expressive description logics
• Displaying the modal logic of consistency
• Sequent-systems for modal logic
• Embedding the hypersequent calculus in the display calculus
• From Frame Properties to Hypersequent Rules in Modal Logics