Pages that link to "Item:Q1569817"
From MaRDI portal
The following pages link to On the number of sets definable by polynomials (Q1569817):
Displaying 7 items.
- Definability and fast quantifier elimination in algebraically closed fields (Q798314) (← links)
- An asymptotically tight bound on the number of semi-algebraically connected components of realizable sign conditions (Q987564) (← links)
- Vapnik-Chervonenkis density in some theories without the independence property. I (Q2790718) (← links)
- The quantifier complexity of polynomial-size iterated definitions in first-order logic (Q3066290) (← links)
- ON THE SIZE OF SETS IN A POLYNOMIAL VARIANT OF A PROBLEM OF DIOPHANTUS (Q3067873) (← links)
- The power of primitive positive definitions with polynomially many variables (Q3133171) (← links)
- Effective definability of Kolchin polynomials (Q5218192) (← links)