A modal logic for cyclic repeating

DOI10.1016/0890-5401(92)90077-SMaRDI QIDQ1201727zbMATH OpenFDO

Authors Dimiter Vakarelov

Publication date 17 January 1993

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0890-5401(92)90077-S

zbMATH Keywords

completenesscyclic repeating of a programdecidabilitymodal logic for cyclic repeatingnonstandard models

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70)

Recommendations

• scientific article; zbMATH DE number 4010497
• Looping vs. repeating in dynamic logic
• scientific article; zbMATH DE number 218549
• scientific article; zbMATH DE number 3869303
• A non-wellfounded, labelled proof system for propositional dynamic logic

Cites work

• An algebraic study of well-foundedness
• Determinism and looping in combinatory PDL
• scientific article; zbMATH DE number 4014675 (Why is no real title available?)
• scientific article; zbMATH DE number 3843130 (Why is no real title available?)
• scientific article; zbMATH DE number 3880104 (Why is no real title available?)
• scientific article; zbMATH DE number 3983144 (Why is no real title available?)
• scientific article; zbMATH DE number 3485746 (Why is no real title available?)
• scientific article; zbMATH DE number 1028833 (Why is no real title available?)
• scientific article; zbMATH DE number 218549 (Why is no real title available?)
• Propositional dynamic logic of looping and converse is elementarily decidable

Cited in

(1)

• scientific article; zbMATH DE number 6215727 (Why is no real title available?)

This page was built for publication: A modal logic for cyclic repeating

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