Vol. 9, No. 3, 2020
Download this issue
For screen
For printing
Recent Issues
Volume 10, Issue 1
Volume 9, Issue 4
Volume 9, Issue 3
Volume 9, Issue 2
Volume 9, Issue 1
Volume 8, Issue 4
Volume 8, Issue 3
Volume 8, Issue 2
Volume 8, Issue 1
The Journal
About the Journal
Editorial Board
Subscriptions
Submission Guidelines
Submission Form
Policies for Authors
Ethics Statement
founded and published with the
scientific support and advice of the
Moscow Institute of
Physics and Technology
ISSN (electronic): 2640-7361
ISSN (print): 2220-5438
Previously Published
Author Index
To Appear
Other MSP Journals
Thematic Issue on
Complexity
DOI:
10.2140/moscow.2020.9-3
Contents
Provenance analysis for logic and games
203–228
Erich Grädel and Val Tannen
Generalizations of $k$-dimensional Weisfeiler–Leman stabilization
229–252
Anuj Dawar and Danny Vagnozzi
On defining linear orders by automata
253–291
Bruno Courcelle, Irène Durand and Michael Raskin
First-order definitions of subgraph isomorphism through the adjacency and order relations
293–302
Oleg Grigoryan, Mikhail Makarov and Maksim Zhukovskii
On limit points of spectra of first-order sentences with quantifier depth 4
303–331
Yury Yarovikov
Weakly distinguishing graph polynomials on addable properties
333–349
Johann A. Makowsky and Vsevolod Rakita
© Copyright 2020 Mathematical Sciences Publishers. All rights reserved.