|
|
|
|
Список литературы
|
|
| |
| 1. |
Y.V. Matiyasevich, “Enumerable sets are diophantine”, Sov. Math., Dokl., 11 (1970), 354–358   |
| 2. |
E.W. Mayr, A.R. Meyer, “The complexity of the word problems for commutative semigroups and polynomial ideals”, Adv. Math., 46:3 (1982), 305–329  |
| 3. |
S.A. Cook, “The complexity of theorem-proving procedures”, Proc. 3rd ann. ACM Sympos. Theory Computing (Shaker Heights, Ohio, 1971), ACM, 1971, 151–158 |
| 4. |
E.Y. Daniyarova, A.G. Myasnikov, V.N. Remeslennikov, “Algebraic geometry over algebraic structures”, Algebra Logic, 57:6 (2019), 414–428  |
| 5. |
A.Y. Nikitin, A.N. Rybalov, “On complexity of the satisfiability problem of systems over finite posets”, Prikl. Diskretn. Mat., 39 (2018), 94–98 |
| 6. |
A.N. Rybalov, “On complexity of the existential and universal theories of finite fields”, Prikl. Diskretn. Mat., 45 (2019), 85–89 |
| 7. |
A.V. Ilev, “Decidability of universal theories and axiomatizability of hereditary classes of graphs”, Trudy Inst. Mat. i Mekh. UrO RAN, 22, no. 1, 2016, 100–111 |
| 8. |
A.V. Ilev, V.N. Remeslennikov, “Study of the compatibility of systems of equations over graphs and finding their general solutions”, Vestnik Omskogo Universiteta, 4(86) (2017), 26–32 |
| 9. |
A.V. Il'ev, V.P. Il'ev, “Algorithms for solving systems of equations over various classes of finite graphs”, Prikl. Diskretn. Mat., 53 (2021), 89–102 |
| 10. |
A.V. Iliev, “On axiomatizability of hereditary classes of graphs and matroids”, Sib. Èlectron. Mat. Izv., 13 (2016), 137–147 |
| 11. |
A.V. Il'ev, V.P. Il'ev, “On axiomatizability and decidability of universal theories of hereditary classes of matroids”, J. Physics: Conf. Ser., 2019, 012056 |
| 12. |
A.V. Il'ev, V.P. Il'ev, “On axiomatizability of the class of finitary matroids and decidability of their universal theory”, Sib. Èlectron. Mat. Izv., 17 (2020), 1730–1740 |
| 13. |
H. Whitney, “On the abstract properties of linear dependence”, Am. J. Math., 57 (1935), 509–533 |
| 14. |
M.R. Garey, D.S. Johnson, Computers and intractability. A guide to the theory of NP-completeness, W.H. Freeman and Co, San Francisco, 1979 |
