Pages that link to "Item:Q5012557"
From MaRDI portal
The following pages link to The Exact Complexity of the First-Order Logic Definability Problem (Q5012557):
Displaying 15 items.
- Arithmetic complexity of first-order definable subsets of recursive Boolean algebras (Q1284381) (← links)
- Deciding open definability via subisomorphisms (Q1799273) (← links)
- Definability, decidability, complexity (Q1817073) (← links)
- Logical separability of labeled data examples under ontologies (Q2093388) (← links)
- Deciding quantifier-free definability in finite algebraic structures (Q2219074) (← links)
- Regularizing conjunctive features for classification (Q2662672) (← links)
- Complexity of existential positive first-order logic (Q2843995) (← links)
- The limits of decidability for first order logic on CPDA graphs (Q2904796) (← links)
- The complexity of definability by open first-order formulas (Q3386916) (← links)
- (Q4231780) (← links)
- (Q4503908) (← links)
- Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time (Q4608731) (← links)
- Completeness for First-order Properties on Sparse Structures with Algorithmic Applications (Q4629991) (← links)
- On Existentially First-Order Definable Languages and Their Relation to NP (Q4718893) (← links)
- Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time (Q5278405) (← links)