R-generability, and definability in branching time logics

DOI10.1016/0020-0190(92)90173-SzbMATH Open0766.03009OpenAlexW1996717414MaRDI QIDQ1197983FDOQ1197983

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

Recommendations

• Alternative semantics for temporal logics
• Branching-time logics with path relativisation
• The temporal logic of branching time
• scientific article; zbMATH DE number 2084388
• Branching-time logics and fairness, revisited

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• “Sometimes” and “not never” revisited
• Title not available (Why is that?)
• Alternative semantics for temporal logics
• The power of the future perfect in program logics
• Title not available (Why is that?)
• Process logic: Expressiveness, decidability, completeness

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)