Decidability for Priorean linear time using a fixed-point labelled calculus

DOI10.1007/978-3-642-02716-1_9MaRDI QIDQ3648725zbMATH OpenOpenAlexFDO

Authors Bianca Boretti, Sara Negri

Publication date 1 December 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02716-1_9

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Temporal logic (03B44)

Recommendations

• On the completeness and decidability of the Horn-like fragment of the first-order linear temporal logic
• A sequent calculus for logic of knowledge and past time: completeness and decidability
• Loop-type sequent calculi for temporal logic
• A labelled natural deduction system for linear temporal logic
• Sequent systems for PLTL

Cited in

(5)

• Meaning in use
• Beyond semantic pollution: towards a practice-based philosophical analysis of labelled calculi
• Unified sequent calculi and natural deduction systems for until-free linear-time temporal logics
• Proofs and countermodels in non-classical logics
• A unified Gentzen-style framework for until-free LTL

This page was built for publication: Decidability for Priorean linear time using a fixed-point labelled calculus

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