Pages that link to "Item:Q1263576"
From MaRDI portal
The following pages link to First-order definability on finite structures (Q1263576):
Displaying 25 items.
- Minimal first-order structures (Q639691) (← links)
- Lower bounds for recognizing small cliques on CRCW PRAM's (Q919820) (← links)
- Some lower bounds in parameterized \(\mathrm{AC}^{0}\) (Q2417855) (← links)
- Typed Monoids – An Eilenberg-Like Theorem for Non Regular Languages (Q3014933) (← links)
- On first-order definable colorings (Q3194868) (← links)
- (Q3377767) (← links)
- The complexity of definability by open first-order formulas (Q3386916) (← links)
- First-order Definable Retraction Problems for Posets and Reflexive Graphs (Q3437257) (← links)
- Definability by constant-depth polynomial-size circuits (Q3767263) (← links)
- (Q3770495) (← links)
- First-Order Queries on Finite Structures Over the Reals (Q4210130) (← links)
- (Q4231780) (← links)
- (Q4305492) (← links)
- Formulas versus Circuits for Small Distance Connectivity (Q4554075) (← links)
- (Q4636561) (← links)
- (Q4638077) (← links)
- On Existentially First-Order Definable Languages and Their Relation to NP (Q4718893) (← links)
- An elementary definability theorem for first order logic (Q4934027) (← links)
- The complexity of graph connectivity (Q5096823) (← links)
- Slicewise Definability in First-Order Logic with Bounded Quantifier Rank. (Q5111186) (← links)
- On first-order sentences without finite models (Q5311726) (← links)
- First-order and counting theories of<i>ω</i>-automatic structures (Q5387304) (← links)
- The first-order structure of weakly Dedekind-finite set (Q5486247) (← links)
- Positive predicate structures for continuous data (Q5740676) (← links)
- A list of arithmetical structures complete with respect to the first-order definability (Q5941257) (← links)
