Partial cut elimination for propositional discrete linear time temporal logic

MaRDI QIDQ2810015zbMATH OpenFDO

Authors Jūratė Sakalauskaitė

Publication date 30 May 2016

Published in Lietuvos Matematikos Rinkinys. Lietuvos Matematiku Draugijos Darbai (Search for Journal in Brave)

zbMATH Keywords

completenesscut rulepast temporal operatorssequent calculitemporal logic

Mathematics Subject Classification ID

Temporal logic (03B44) Cut-elimination and normal-form theorems (03F05) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Recommendations

• Cut-elimination and completeness in dynamic topological and linear-time temporal logics
• CUT ELIMINATION IN HYPERSEQUENT CALCULUS FOR SOME LOGICS OF LINEAR TIME
• scientific article; zbMATH DE number 4197951
• Cut-free sequent systems for temporal logic
• The complexity of propositional linear temporal logics
• The axiomatization of propositional linear time temporal logic
• scientific article; zbMATH DE number 1950255
• Weak completeness theorem for propositional linear time temporal logic
• Propositional temporal logics: decidability and completeness
• A Paraconsistent Linear-time Temporal Logic

Cited in

(8)

• A cut elimination theorem for stationary logic
• Cut-free sequent calculi for some tense logics
• Syntactic cut-elimination and backward proof-search for tense logic via linear nested sequents
• A sequent calculus for logic of knowledge and past time: completeness and decidability
• A sequent calculus for propositional temporal logic with time gaps
• Cut-elimination and completeness in dynamic topological and linear-time temporal logics
• scientific article; zbMATH DE number 4197951 (Why is no real title available?)
• Cut-free sequent systems for temporal logic

This page was built for publication: Partial cut elimination for propositional discrete linear time temporal logic

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