default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael A. Taitslin
Person information
- affiliation: Tver State University, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2001
[j13]Michael A. Taitslin:
A general condition for collapse results. Ann. Pure Appl. Log. 113(1-3): 323-330 (2001)
1990 – 1999
- 1999
- [j12]Alexei P. Stolboushkin, Michael A. Taitslin:
Normalizable linear orders and generic computations in finite models. Arch. Math. Log. 38(4-5): 257-271 (1999) - [j11]Oleg V. Belegradek, Alexei P. Stolboushkin, Michael A. Taitslin:
Extended Order-Generic Queries. Ann. Pure Appl. Log. 97(1-3): 85-125 (1999) - [j10]Alexei P. Stolboushkin, Michael A. Taitslin:
Finite Queries Do Not Have Effective Syntax. Inf. Comput. 153(1): 99-116 (1999) - 1998
- [j9]Alexei P. Stolboushkin, Michael A. Taitslin:
Safe Stratified Datalog with Integer Order Does Not Have Syntax. ACM Trans. Database Syst. 23(1): 100-109 (1998) - 1997
- [j8]Dmitry A. Archangelsky, Mikhail A. Taitslin:
A Logic for Information Systems. Stud Logica 58(1): 3-16 (1997) - [c8]Oleg V. Belegradek, Alexei P. Stolboushkin, Michael A. Taitslin:
Generic Queries over Quasy-o-minimal Domains. LFCS 1997: 21-32 - 1996
- [j7]Dmitry A. Archangelsky, Michael I. Dekhtyar, Mikhail A. Taitslin:
Linear Logic for Nets with Bounded Resources. Ann. Pure Appl. Log. 78(1-3): 3-28 (1996) - [c7]Alexei P. Stolboushkin, Michael A. Taitslin:
Linear vs. Order Contstrained Queries Over Rational Databases. PODS 1996: 17-27 - 1995
- [j6]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): 11-26 (1995) - [c6]Alexei P. Stolboushkin, Michael A. Taitslin:
Finite Queries do not Have Effective Syntax. PODS 1995: 277-285 - 1994
- [j5]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): 1 (1994) - [j4]Dmitry A. Archangelsky, Mikhail A. Taitslin:
Linear Logic with Fixed Resources. Ann. Pure Appl. Log. 67(1-3): 3-28 (1994) - [c5]Alexei P. Stolboushkin, Michael A. Taitslin:
Is First Order Contained in an Initial Segment of PTIME? CSL 1994: 242-248 - [c4]Dmitry A. Archangelsky, Michael I. Dekhtyar, Evgeny Kruglov, Ilmir Kh. Musikaev, Mikhail A. Taitslin:
Concurrency Problem for Horn Fragment of Girard's Linear Logic. LFCS 1994: 18-22 - 1993
- [j3]Ilmir Kh. Musikaev, Michael A. Taitslin:
Limitations of the Program Memory and the Expressive Power of Dynamic Logics. Inf. Comput. 103(2): 195-203 (1993) - [c3]Mikhail A. Taitslin, D. Arkhangelsky:
The Other Linear Logic (Invited Paper). Formal Methods in Programming and Their Applications 1993: 251-255 - 1992
- [c2]Dmitry A. Archangelsky, Mikhail A. Taitslin:
Modular Linear Logic. LFCS 1992: 1-8 - [e2]Anil Nerode, Michael A. Taitslin:
Logical Foundations of Computer Science - Tver '92, Second International Symposium, Tver, Russia, July 20-24, 1992, Proceedings. Lecture Notes in Computer Science 620, Springer 1992, ISBN 3-540-55707-5 [contents]
1980 – 1989
- 1989
- [c1]Dmitry A. Archangelsky, Mikhail A. Taitslin:
A Logic for Data Description. Logic at Botik 1989: 2-11 - [e1]Albert R. Meyer, Michael A. Taitslin:
Logic at Botik '89, Symposium on Logical Foundations of Computer Science, Pereslav-Zalessky, USSR, July 3-8, 1989, Proceedings. Lecture Notes in Computer Science 363, Springer 1989, ISBN 3-540-51237-3 [contents] - 1983
- [j2]Alexei P. Stolboushkin, Michael A. Taitslin:
Deterministic Dynamic Logic is Strictly Weaker than Dynamic Logic. Inf. Control. 57(1): 48-55 (1983) - [j1]Alexei P. Stolboushkin, Michael A. Taitslin:
The Comparison of the Expressive Power of First-Order Dynamic Logics. Theor. Comput. Sci. 27: 197-209 (1983)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
