The following pages link to Computer Science Logic (Q5311284):
Displaying 16 items.
- Weak MSO with the unbounding quantifier (Q537919) (← links)
- Beyond \(\omega \)-regular languages: \(\omega T\)-regular expressions and their automata and logic counterparts (Q1989336) (← links)
- Parameterized linear temporal logics meet costs: still not costlier than LTL (Q2413483) (← links)
- Contribution of Warsaw logicians to computational logic (Q2422533) (← links)
- The Caucal hierarchy: interpretations in the (W)MSO+\(\mathsf{U}\) logic (Q2672657) (← links)
- Delay Games with WMSO+U Winning Conditions (Q2953690) (← links)
- Recursion Schemes and the WMSO+U Logic (Q3304152) (← links)
- (Q3384174) (← links)
- Trading Bounds for Memory in Games with Counters (Q3449476) (← links)
- Monadic Second Order Logic with Measure and Category Quantifiers (Q4637695) (← links)
- (Q5013884) (← links)
- (Q5109508) (← links)
- (Q5216303) (← links)
- Cost Automata, Safe Schemes, and Downward Closures (Q6044492) (← links)
- Positive First-order Logic on Words and Graphs (Q6135776) (← links)
- An interval temporal logic characterization of extended \(\omega\)-regular languages (Q6159024) (← links)
