JOURNAL ARTICLE
First-order logics of branching time
Ekaterina KotikovaMikhail Rybakov
Year: 2013 Journal: Logical Investigations Vol: 19 Pages: 68-99
Abstract
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.
Keywords:
Kripke structure CTL* Computation tree logic Kripke semantics Completeness (order theory) Branching (polymer chemistry) Temporal logic Computer science Set (abstract data type) Intermediate logic Atomic sentence Modal logic Mathematics Discrete mathematics Theoretical computer science Programming language Artificial intelligence Description logic Medicine Modal Chemistry
Metrics
2
Cited By
0.00
FWCI (Field Weighted Citation Impact)
10
Refs
0.27
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Citation History
Topics
Logic, programming, and type systems
Physical Sciences → Computer Science → Artificial Intelligence
Logic, Reasoning, and Knowledge
Physical Sciences → Computer Science → Artificial Intelligence
Advanced Algebra and Logic
Physical Sciences → Computer Science → Computational Theory and Mathematics
Related Documents
BOOK-CHAPTER
Branching-Time Temporal Logics
Stéphane DemriValentin GorankoMartin Lange
Cambridge University Press eBooks Year: 2016 Pages: 209-270
JOURNAL ARTICLE
Decidable and undecidable fragments of first-order branching temporal logics
Ian HodkinsonFrank WolterMichael Zakharyaschev
Year: 2003 Pages: 393-402
JOURNAL ARTICLE
The power of first-order quantification over states in branching and linear time temporal logics
Krishnendu ChatterjeePallab DasguptaP. P. Chakrabarti
Journal: Information Processing Letters Year: 2004 Vol: 91 (5)Pages: 201-210