The following pages link to Computer Science Logic (Q5394585):
Displaying 17 items.
- On the complexity of the two-variable guarded fragment with transitive guards (Q859827) (← links)
- Propositional epistemic logics with quantification over agents of knowledge (Q1743999) (← links)
- The fluted fragment with transitive relations (Q2238133) (← links)
- Guards, bounds, and generalized semantics (Q2567341) (← links)
- Guarded fragments with constants (Q2567342) (← links)
- Small substructures and decidability issues for first-order logic with two variables (Q2915891) (← links)
- Equivalence closure in the two-variable guarded fragment (Q3133154) (← links)
- (Q4736875) (← links)
- (Q5092374) (← links)
- (Q5092376) (← links)
- Finite satisfiability for two‐variable, first‐order logic with one transitive relation is decidable (Q5109226) (← links)
- Complexity of Two-Variable Logic on Finite Trees (Q5278193) (← links)
- On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity (Q5387847) (← links)
- Logics in Artificial Intelligence (Q5394138) (← links)
- Epistemic logics with quantification over epistemic operators: decidability and expressiveness (Q6054107) (← links)
- On the satisfiability of local first-order logics with data (Q6597951) (← links)
- Craig interpolation for decidable first-order fragments (Q6629523) (← links)
