The following pages link to Alexei P. Stolboushkin (Q1302300):
Displaying 14 items.
- (Q174145) (redirect page) (← links)
- The comparison of the expressive power of first-order dynamic logics (Q791517) (← links)
- Extended order-generic queries (Q1302301) (← links)
- Normalizable linear orders and generic computations in finite models (Q1306793) (← links)
- Finite queries do not have effective syntax. (Q1854305) (← links)
- Deterministic dynamic logic is strictly weaker than dynamic logic (Q3323259) (← links)
- Positive program logics in systems with arithmetic (Q3718148) (← links)
- ON THE COMPUTING POWER OF PROGRAMS WITH SETS (Q4020486) (← links)
- (Q4249219) (← links)
- <i>y</i>= 2<i>x</i>VS.<i>y</i>= 3<i>x</i> (Q4358061) (← links)
- (Q4376044) (← links)
- (Q4381423) (← links)
- (Q4474843) (← links)
- Databases over a fixed infinite universe (Q5930851) (← links)
