|
|
|
|
Литература
|
|
| |
| 1. |
A. Bès, P. Cégielski, “Weakly maximal decidable structures”, RAIRO – Theor. Inf. Appl., 42:1 (2008), 137–135   |
| 2. |
A. Blumensath, Locality and Modular Ehrenfeucht-Fraisse Games, Preprint, 2006 |
| 3. |
Calvin C. Elgot, Michael O. Rabin, “Decidability and undecidability of extensions of second (first) order
theory of (generalized) successor”, J. Symb. Log., 31:2 (1966), 169–181 |
| 4. |
H. Gaifman, “On local and non-local properties”, Logic Colloquium 81, Proc. Herbrand Symp. (Marseille, 1981), Stud. Logic Found. Math., 107, North-Holland, Amsterdam, 1982, 105–135 |
| 5. |
C. H. Langford, “Theorem on deducibility (second paper)”, Annals of Math., 2 (1927), 459–471  |
| 6. |
L. Libkin, Elements of Finite Model Theory, Springer, Berlin, 2004 |
| 7. |
M. Presburger, “Über de vollständigkeit eines gewissen systems der arithmetic
ganzer zahlen, in welchen, die addition als einzige operation hervortritt”, Comptes Rendus du Premier Congrès des Mathématicienes des Pays
Slaves, Warsaw, 1927, 92–101 |
| 8. |
Alexei L. Semenov, “Decidability of monadic theories”, Mathematical Foundations of Computer Science (Prague, 1984), Lecture Notes in Computer Science, 176, eds. Michal Chytil,Václav Koubek, Springer, Berlin, 1984, 162–175 |
| 9. |
Valentina S. Harizanov, “Computably-theoretic complexity of countable structures”, Bulletin of Symbolic Logic, 8 (2002), 457–477 |
| 10. |
S. Soprunov, “Decidable expansions of structures”, Vopr. Kibern., 134 (1988), 175–179 |
