A cyclic proof system for full computation tree logic

DOI10.4230/LIPICS.CSL.2023.5MaRDI QIDQ6610603zbMATH OpenFDO

Authors Bahareh Afshari, Graham E. Leigh, Turata Guillermo Menéndez

Publication date 25 September 2024

Full work available at URL https://doi.org/10.4230/LIPICS.CSL.2023.5

zbMATH Keywords

cyclic proofsfull computation tree logichypersequent calculus

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cited in

(1)

• Ill-founded proof systems for intuitionistic linear-time temporal logic

This page was built for publication: A cyclic proof system for full computation tree logic

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