Answers are grounded in this paper and cite their sources.
We consider the logic QCTL, a first-order exten- sion of CTL defined as a logic of Kripke frames for CTL. We study the question about recursive enumerability of its fragments specified by a set of temporal modalities we use. Then we discuss some questions concerned axiomatizability and Kripke completeness.
No takes yet. Share an insight, caveat, or question.
Kotikova et al. (2013) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: