Alexei P. Stolboushkin

Available identifiers

zbMath Open stolboushkin.alexei-pMaRDI QIDQ1302300

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q4474843	2004-07-21	Paper
Finite queries do not have effective syntax.	2003-01-14	Paper
https://portal.mardi4nfdi.de/entity/Q4249219	2002-01-31	Paper
Databases over a fixed infinite universe	2001-04-26	Paper
Extended order-generic queries	2001-03-13	Paper
Normalizable linear orders and generic computations in finite models	1999-10-05	Paper
https://portal.mardi4nfdi.de/entity/Q4381423	1998-08-13	Paper
https://portal.mardi4nfdi.de/entity/Q4376044	1998-03-24	Paper
y= 2xVS.y= 3x	1997-09-28	Paper
ON THE COMPUTING POWER OF PROGRAMS WITH SETS	1993-01-16	Paper
Positive program logics in systems with arithmetic	1984-01-01	Paper
Deterministic dynamic logic is strictly weaker than dynamic logic	1983-01-01	Paper
The comparison of the expressive power of first-order dynamic logics	1983-01-01	Paper

Research outcomes over time

This page was built for person: Alexei P. Stolboushkin