Loop-check specification for a sequent calculus of temporal logic

DOI10.1007/s11225-022-10010-9OpenAlexW4293692424WikidataQ114017380 ScholiaQ114017380MaRDI QIDQ2106881

Haroldas Giedra, R. Alonderis, A. Ju. Pljuskevicene, Regimantas Pliuškevičius

Publication date: 29 November 2022

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-022-10010-9

zbMATH Keywords

sequent calculitemporal logicsderivation loops

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cut-free sequent systems for temporal logic
• A cut-free cyclic proof system for Kleene algebra
• Loop-type sequent calculi for temporal logic
• Decision Procedure for a Fragment of Mutual Belief Logic with Quantified Agent Variables
• Contraction-free sequent calculi for intuitionistic logic
• A completeness proof for an infinitary tense-logic
• Efficient loop-check for backward proof search in some non-classical propositional logics
• Cyclic Proofs for Linear Temporal Logic
• A Proof System for the Linear Time μ-Calculus
• Automated Reasoning with Analytic Tableaux and Related Methods
• Automatically verifying temporal properties of pointer programs with cyclic proof

This page was built for publication: Loop-check specification for a sequent calculus of temporal logic