\(R\)-generability, and definability in branching time logics

DOI10.1016/0020-0190(92)90173-SzbMath0766.03009OpenAlexW1996717414MaRDI QIDQ1197983

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

definabilitycomputation theory\(\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)

Related Items (1)

An axiomatization of full Computation Tree Logic

Cites Work

• Process logic: Expressiveness, decidability, completeness
• Alternative semantics for temporal logics
• The power of the future perfect in program logics
• “Sometimes” and “not never” revisited
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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