Publisher
Springer Science and Business Media LLC
Reference4 articles.
1. N. T. Kogabaev, “Complexity of the problem of being equivalent to Horn formulas,” Algebra and Logic, 60, No. 6, 380-388 (2021).
2. N. T. Kogabaev, “Complexity of the problem of being equivalent to Horn formulas. II,” Algebra and Logic, 61, No. 4, 318-327 (2022).
3. Yu. L. Ershov and E. A. Palyutin, Mathematical Logic [in Russian], 6th edn., Fizmatlit, Moscow (2011).
4. Yu. L. Ershov, Problems of Decidability and Constructive Models [in Russian], Nauka, Moscow (1980).