Pages that link to "Item:Q890867"
From MaRDI portal
The following pages link to Generic complexity of first-order theories (Q890867):
Displaying 10 items.
- Generic complexity of Presburger arithmetic (Q848747) (← links)
- Dynamic notions of genericity and array noncomputability (Q1295423) (← links)
- On the generic existential theory of finite graphs (Q2212708) (← links)
- Generic undecidability of universal theories (Q2334766) (← links)
- The complexity of definability by open first-order formulas (Q3386916) (← links)
- The Exact Complexity of the First-Order Logic Definability Problem (Q5012557) (← links)
- Circuit complexity and the expressive power of generalized first-order formulas (Q5204302) (← links)
- (Q5858677) (← links)
- The Complexity of Decomposing Modal and First-Order Theories (Q5892176) (← links)
- Inductive Logic Programming (Q5897176) (← links)