Pages that link to "Item:Q3386916"
From MaRDI portal
The following pages link to The complexity of definability by open first-order formulas (Q3386916):
Displaying 5 items.
- Deciding open definability via subisomorphisms (Q1799273) (← links)
- Definability, decidability, complexity (Q1817073) (← links)
- Deciding quantifier-free definability in finite algebraic structures (Q2219074) (← links)
- (Q3770495) (← links)
- The Exact Complexity of the First-Order Logic Definability Problem (Q5012557) (← links)