Pages that link to "Item:Q1193408"
From MaRDI portal
The following pages link to Capturing complexity classes by fragments of second-order logic (Q1193408):
Displaying 19 items.
- A logical approach to locality in pictures languages (Q295631) (← links)
- Quantified constraint satisfaction and the polynomially generated powers property (Q539977) (← links)
- Expressive power and abstraction in Essence (Q941820) (← links)
- On the complexity of single-rule datalog queries. (Q1401945) (← links)
- A second-order system for polytime reasoning based on Grädel's theorem. (Q1412837) (← links)
- Arithmetical definability and computational complexity (Q1885035) (← links)
- Syntactic expressions to express NP-hard optimization problems and problems with zero duality gap (Q2868930) (← links)
- Existential Fixed-Point Logic as a Fragment of Second-Order Logic (Q2947165) (← links)
- Quantified Constraint Satisfaction and the Polynomially Generated Powers Property (Q3519502) (← links)
- 2000 Annual Meeting of the Association for Symbolic Logic (Q4527937) (← links)
- Tailoring recursion for complexity (Q4632420) (← links)
- Tailoring recursion for complexity (Q4858828) (← links)
- Complexity and expressive power of second‐order extended Horn logic (Q4915214) (← links)
- (Q5013879) (← links)
- The Expressive Power of Higher-Order Datalog (Q5108510) (← links)
- Expressivity and Complexity of Dependence Logic (Q5213639) (← links)
- Rewriting Conjunctive Queries over Description Logic Knowledge Bases (Q5504588) (← links)
- Inductive definitions in logic versus programs of real-time cellular automata (Q6122593) (← links)
- Capturing the polynomial hierarchy by second-order revised Krom logic (Q6135775) (← links)
