Pages that link to "Item:Q2506493"
From MaRDI portal
The following pages link to First-order logic with two variables and unary temporal logic (Q2506493):
Displaying 37 items.
- Temporal BI: proof system, semantics and translations (Q391122) (← links)
- On the almighty wand (Q418137) (← links)
- Complexity of two-variable dependence logic and IF-logic (Q476186) (← links)
- Relative expressive power of navigational querying on graphs (Q528686) (← links)
- Fragments of first-order logic over infinite words (Q537914) (← links)
- Propositional interval neighborhood logics: expressiveness, decidability, and undecidable extensions (Q636267) (← links)
- Bounded linear-time temporal logic: a proof-theoretic investigation (Q764266) (← links)
- All finitely axiomatizable tense logics of linear time flows are coNP-complete (Q817685) (← links)
- Notes on logics of metric spaces (Q878157) (← links)
- On decidability of LTL model checking for process rewrite systems (Q1006890) (← links)
- LARS: a logic-based framework for analytic reasoning over streams (Q1648076) (← links)
- ``Most of'' leads to undecidability: failure of adding frequencies to LTL (Q2233396) (← links)
- The light side of interval temporal logic: the Bernays-Schönfinkel fragment of CDT (Q2251124) (← links)
- \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\) (Q2500472) (← links)
- Expressiveness of Hybrid Temporal Logic on Data Words (Q2825412) (← links)
- Expressive Completeness for LTL With Modulo Counting and Group Quantifiers (Q2825418) (← links)
- Some modal aspects of XPath (Q2901192) (← links)
- On Expressive Powers of Timed Logics: Comparing Boundedness, Non-punctuality, and Deterministic Freezing (Q3090822) (← links)
- Two Variable vs. Linear Temporal Logic in Model Checking and Games (Q3090852) (← links)
- A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS (Q3538848) (← links)
- Characterization of Logics over Ranked Tree Languages (Q3540193) (← links)
- From Philosophical to Industrial Logics (Q3601803) (← links)
- Model Checking FO(R) over One-Counter Processes and beyond (Q3644768) (← links)
- Separation logics and modalities: a survey (Q4586138) (← links)
- Comparing the succinctness of monadic query languages over finite trees (Q4659888) (← links)
- Separating Without Any Ambiguity. (Q5002824) (← links)
- (Q5079753) (← links)
- (Q5090950) (← links)
- One-Dimensional Logic over Trees (Q5111281) (← links)
- (Q5129940) (← links)
- (Q5136301) (← links)
- On Decidability of LTL+Past Model Checking for Process Rewrite Systems (Q5179053) (← links)
- (Q5232899) (← links)
- Two-Variable Logic with Counting and Trees (Q5278191) (← links)
- Complexity of Two-Variable Logic on Finite Trees (Q5278193) (← links)
- From Monadic Logic to PSL (Q5452203) (← links)
- A Note on C² Interpreted over Finite Data-Words (Q6060103) (← links)
