R-generability, and definability in branching time logics

DOI10.1016/0020-0190(92)90173-SMaRDI QIDQ1197983zbMATH OpenOpenAlexFDO

Authors Mads Dam

Publication date 16 January 1993

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(92)90173-s

zbMATH Keywords

computation theorydefinability\(\text{CTL}^*\)computation paths\(R\)-generabilitybranching time temporal logics

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Modal logic (including the logic of norms) (03B45)

Recommendations

• Alternative semantics for temporal logics
• Branching-time logics with path relativisation
• The temporal logic of branching time
• Publication:4475142
• Branching-time logics and fairness, revisited

Cites work

• scientific article; zbMATH DE number 3876574 (Why is no real title available?)
• scientific article; zbMATH DE number 1028833 (Why is no real title available?)
• scientific article; zbMATH DE number 4119603 (Why is no real title available?)
• scientific article; zbMATH DE number 4119650 (Why is no real title available?)
• Alternative semantics for temporal logics
• Process logic: Expressiveness, decidability, completeness
• The power of the future perfect in program logics
• “Sometimes” and “not never” revisited

Cited in

(1)

• An axiomatization of full computation tree logic

This page was built for publication: \(R\)-generability, and definability in branching time logics

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