Pages that link to "Item:Q2638188"
From MaRDI portal
The following pages link to Complexity of modal logics with Presburger constraints (Q2638188):
Displayed 7 items.
- On regular paths with counting and data tests (Q1744429) (← links)
- One-variable logic meets Presburger arithmetic (Q2007734) (← links)
- Mu-calculus satisfiability with arithmetic constraints (Q2226964) (← links)
- Reasoning with Global Assumptions in Arithmetic Modal Logics (Q2947894) (← links)
- On Composing Finite Forests with Modal Logics (Q5886519) (← links)
- Presburger Büchi tree automata with applications to logics with expressive counting (Q6160751) (← links)
- INTERLEAVING LOGIC AND COUNTING (Q6199174) (← links)