The Comparison of the Expressive Power of First-Order Dynamic Logics. - Alexei P. Stolboushkin; Michael A. Taitslin (Theor. Comput. Sci., 1983)

Deterministic Dynamic Logic is Strictly Weaker than Dynamic Logic - Alexei P. Stolboushkin; Michael A. Taitslin (Inf. Control., 1983)

A Logic for Data Description. - Dmitry A. Archangelsky; Mikhail A. Taitslin (Logic at Botik, 1989)

Modular Linear Logic. - Dmitry A. Archangelsky; Mikhail A. Taitslin (LFCS, 1992)

The Other Linear Logic (Invited Paper). - Mikhail A. Taitslin; D. Arkhangelsky (Formal Methods in Programming and Their Applications, 1993)

Limitations of the Program Memory and the Expressive Power of Dynamic Logics - Ilmir Kh. Musikaev; Michael A. Taitslin (Inf. Comput., 1993)

Is First Order Contained in an Initial Segment of PTIME? - Alexei P. Stolboushkin; Michael A. Taitslin (CSL, 1994)

Concurrency Problem for Horn Fragment of Girard's Linear Logic. - Dmitry A. Archangelsky; Michael I. Dekhtyar; Evgeny Kruglov; Ilmir Kh. Musikaev; Mikhail A. Taitslin (LFCS, 1994)

Linear Logic with Fixed Resources. - Dmitry A. Archangelsky; Mikhail A. Taitslin (Ann. Pure Appl. Log., 1994)

A Selection of Papers Presented at the Symposium "Logic at Tver '92" - Preface. - Anil Nerode; Michael A. Taitslin (Ann. Pure Appl. Log., 1994)

Flat Backtracking Prolog for Databases: A Formal Semantics, the Computational Complexity and the Expressibility. - Ilmir Kh. Musikaev; Michael A. Taitslin (Int. J. Found. Comput. Sci., 1995)

Linear vs. Order Contstrained Queries Over Rational Databases. - Alexei P. Stolboushkin; Michael A. Taitslin (PODS, 1996)

Linear Logic for Nets with Bounded Resources. - Dmitry A. Archangelsky; Michael I. Dekhtyar; Mikhail A. Taitslin (Ann. Pure Appl. Log., 1996)

Generic Queries over Quasy-o-minimal Domains. - Oleg V. Belegradek; Alexei P. Stolboushkin; Michael A. Taitslin (LFCS, 1997)

A Logic for Information Systems. - Dmitry A. Archangelsky; Mikhail A. Taitslin (Stud Logica, 1997)

Safe Stratified Datalog with Integer Order Does Not Have Syntax. - Alexei P. Stolboushkin; Michael A. Taitslin (ACM Trans. Database Syst., 1998)

Normalizable linear orders and generic computations in finite models. - Alexei P. Stolboushkin; Michael A. Taitslin (Arch. Math. Log., 1999)

Extended Order-Generic Queries. - Oleg V. Belegradek; Alexei P. Stolboushkin; Michael A. Taitslin (Ann. Pure Appl. Log., 1999)

Finite Queries Do Not Have Effective Syntax. - Alexei P. Stolboushkin; Michael A. Taitslin (Inf. Comput., 1999)

A general condition for collapse results. - Michael A. Taitslin (Ann. Pure Appl. Log., 2001)