Pages that link to "Item:Q2946653"
From MaRDI portal
The following pages link to The Complexity of Positive First-Order Logic without Equality (Q2946653):
Displaying 8 items.
- The complexity of equivalence, entailment, and minimization in existential positive logic (Q473196) (← links)
- Complexity of existential positive first-order logic (Q2843995) (← links)
- On the Complexity of the Model Checking Problem (Q3176188) (← links)
- Positive Arithmetic Without Exchange Is a Subclassical Logic (Q3498443) (← links)
- The lattice and semigroup structure of multipermutations (Q5063206) (← links)
- The Complexity of Quantified Constraints Using the Algebraic Formulation (Q5111241) (← links)
- On the complexity of existential positive queries (Q5410336) (← links)
- The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation (Q5875947) (← links)