Pages that link to "Item:Q5738962"
From MaRDI portal
The following pages link to Back and forth between guarded and modal logics (Q5738962):
Displaying 18 items.
- Finite satisfiability for guarded fixpoint logic (Q436331) (← links)
- On the complexity of division and set joins in the relational algebra (Q882434) (← links)
- Modal and guarded characterisation theorems over finite transition systems (Q1886323) (← links)
- Bisimulation invariant monadic-second order logic in the finite (Q2182315) (← links)
- On generalized van Benthem-type characterizations (Q2358625) (← links)
- A general tableau method for propositional interval temporal logics: theory and implementation (Q2506829) (← links)
- Back and Forth between Rules and SE-Models (Q3003253) (← links)
- The mu-calculus and Model Checking (Q3176384) (← links)
- Provenance Circuits for Trees and Treelike Instances (Q3449465) (← links)
- The Descriptive Complexity of Parity Games (Q3540190) (← links)
- Separating Graph Logic from MSO (Q3617721) (← links)
- Repetitions and permutations of columns in the semijoin algebra (Q3625687) (← links)
- SOME MODEL THEORY OF GUARDED NEGATION (Q4647097) (← links)
- Bisimulation Invariant Monadic-Second Order Logic in the Finite (Q5002802) (← links)
- (Q5232911) (← links)
- Where First-Order and Monadic Second-Order Logic Coincide (Q5278195) (← links)
- On Monotonic Determinacy and Rewritability for Recursive Queries and Views (Q5886523) (← links)
- Preservation theorems for Tarski's relation algebra (Q6635502) (← links)