Michael A. Taitslin

According to our database, Michael A. Taitslin authored at least 20 papers between 1983 and 2001.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2001

A general condition for collapse results.

Michael A. Taitslin

Ann. Pure Appl. Log., 2001

1999

Finite Queries Do Not Have Effective Syntax.

Alexei P. Stolboushkin, Michael A. Taitslin

Inf. Comput., 1999

Extended Order-Generic Queries.

Oleg V. Belegradek, Alexei P. Stolboushkin, Michael A. Taitslin

Ann. Pure Appl. Log., 1999

Normalizable linear orders and generic computations in finite models.

Alexei P. Stolboushkin, Michael A. Taitslin

Arch. Math. Log., 1999

1998

Safe Stratified Datalog with Integer Order Does Not Have Syntax.

Alexei P. Stolboushkin, Michael A. Taitslin

ACM Trans. Database Syst., 1998

1997

A Logic for Information Systems.

Dmitry A. Archangelsky, Mikhail A. Taitslin

Stud Logica, 1997

Generic Queries over Quasy-o-minimal Domains.

Oleg V. Belegradek, Alexei P. Stolboushkin, Michael A. Taitslin

Proceedings of the Logical Foundations of Computer Science, 4th International Symposium, 1997

1996

Linear Logic for Nets with Bounded Resources.

Dmitry A. Archangelsky, Michael I. Dekhtyar, Mikhail A. Taitslin

Ann. Pure Appl. Log., 1996

Linear vs. Order Contstrained Queries Over Rational Databases.

Alexei P. Stolboushkin, Michael A. Taitslin

Proceedings of the Fifteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1996

1995

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

1994

A Selection of Papers Presented at the Symposium "Logic at Tver '92" - Preface.

Anil Nerode, Michael A. Taitslin

Ann. Pure Appl. Log., 1994

Linear Logic with Fixed Resources.

Dmitry A. Archangelsky, Mikhail A. Taitslin

Ann. Pure Appl. Log., 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

Proceedings of the Logical Foundations of Computer Science, Third International Symposium, 1994

Is First Order Contained in an Initial Segment of PTIME?

Alexei P. Stolboushkin, Michael A. Taitslin

Proceedings of the Computer Science Logic, 8th International Workshop, 1994

1993

Limitations of the Program Memory and the Expressive Power of Dynamic Logics

Ilmir Kh. Musikaev, Michael A. Taitslin

Inf. Comput., April, 1993

The Other Linear Logic (Invited Paper).

Mikhail A. Taitslin, D. Arkhangelsky

Proceedings of the Formal Methods in Programming and Their Applications, International Conference, Akademgorodok, Novosibirsk, Russia, June 28, 1993

1992

Modular Linear Logic.

Dmitry A. Archangelsky, Mikhail A. Taitslin

Proceedings of the Logical Foundations of Computer Science, 1992

1989

A Logic for Data Description.

Dmitry A. Archangelsky, Mikhail A. Taitslin

Proceedings of the Logic at Botik '89, 1989

1983

Deterministic Dynamic Logic is Strictly Weaker than Dynamic Logic

Alexei P. Stolboushkin, Michael A. Taitslin

Inf. Control., April, 1983

The Comparison of the Expressive Power of First-Order Dynamic Logics.

Alexei P. Stolboushkin, Michael A. Taitslin

Theor. Comput. Sci., 1983