The following pages link to (Q4539599):
Displayed 19 items.
- Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA (Q631077) (← links)
- On the undecidability of logics with converse, nominals, recursion and counting (Q814615) (← links)
- On model checking multiple hybrid views (Q947781) (← links)
- Completeness for the modal \(\mu\)-calculus: separating the combinatorics from the dynamics (Q1749477) (← links)
- Global view on reactivity: switch graphs and their logics (Q1935598) (← links)
- On the expressive power of hybrid branching-time logics (Q1989342) (← links)
- Model checking for hybrid branching-time logics (Q2291813) (← links)
- ExpTime tableaux with global caching for hybrid PDL (Q2303231) (← links)
- A goal-directed decision procedure for hybrid PDL (Q2351150) (← links)
- A logic of reachable patterns in linked data-structures (Q2643337) (← links)
- Clausal Tableaux for Hybrid PDL (Q2825411) (← links)
- Hilbert-Style Axiomatization for Hybrid XPath with Data (Q2835860) (← links)
- Modal Expressiveness of Graph Properties (Q2866735) (← links)
- On the Hybrid Extension of CTL and CTL + (Q3182944) (← links)
- Enriched μ–Calculus Pushdown Module Checking (Q3498485) (← links)
- Reasoning and Query Answering in Description Logics (Q4647812) (← links)
- (Q5079784) (← links)
- (Q5155666) (← links)
- Terminating Tableaux for Hybrid Logic with Eventualities (Q5747764) (← links)