Michael A. Taitslin

Publication Activity (10 Years)

Years Active: 1983-2001
Publications (10 Years): 0

Publications

Michael A. Taitslin
A general condition for collapse results. Ann. Pure Appl. Log. 113 (1-3) (2001)
Alexei P. Stolboushkin, Michael A. Taitslin
Finite Queries Do Not Have Effective Syntax. Inf. Comput. 153 (1) (1999)
Oleg V. Belegradek, Alexei P. Stolboushkin, Michael A. Taitslin
Extended Order-Generic Queries. Ann. Pure Appl. Log. 97 (1-3) (1999)
Alexei P. Stolboushkin, Michael A. Taitslin
Normalizable linear orders and generic computations in finite models. Arch. Math. Log. 38 (4-5) (1999)
Alexei P. Stolboushkin, Michael A. Taitslin
Safe Stratified Datalog with Integer Order Does Not Have Syntax. ACM Trans. Database Syst. 23 (1) (1998)
Oleg V. Belegradek, Alexei P. Stolboushkin, Michael A. Taitslin
Generic Queries over Quasy-o-minimal Domains. LFCS (1997)
Alexei P. Stolboushkin, Michael A. Taitslin
Linear vs. Order Contstrained Queries Over Rational Databases. PODS (1996)
Ilmir Kh. Musikaev, Michael A. Taitslin
Flat Backtracking Prolog for Databases: A Formal Semantics, the Computational Complexity and the Expressibility. Int. J. Found. Comput. Sci. 6 (1) (1995)
Alexei P. Stolboushkin, Michael A. Taitslin
Finite Queries do not Have Effective Syntax. PODS (1995)
Alexei P. Stolboushkin, Michael A. Taitslin
Is First Order Contained in an Initial Segment of PTIME? CSL (1994)
Anil Nerode, Michael A. Taitslin
A Selection of Papers Presented at the Symposium "Logic at Tver '92" - Preface. Ann. Pure Appl. Log. 67 (1-3) (1994)
Ilmir Kh. Musikaev, Michael A. Taitslin
Limitations of the Program Memory and the Expressive Power of Dynamic Logics Inf. Comput. 103 (2) (1993)
Alexei P. Stolboushkin, Michael A. Taitslin
The Comparison of the Expressive Power of First-Order Dynamic Logics. Theor. Comput. Sci. 27 (1983)
Alexei P. Stolboushkin, Michael A. Taitslin
Deterministic Dynamic Logic is Strictly Weaker than Dynamic Logic Inf. Control. 57 (1) (1983)