1. Nikitchenko, M., Shkilniak, S.: Mathematical logic and theory of algorithms. Publishing house of Taras Shevchenko National University of Kyiv, Kyiv. In Ukrainian (2008)
2. Nikitchenko, M., Chentsov, A.: Basics of intensionalized data: presets, sets, and nominats. Comput. Sci. J. Moldova, vol. 20, no. 3(60), pp. 334–365 (2012)
3. Nikitchenko, M., Tymofieiev, V.: Satisfiability in composition-nominative logics. Cent. Eur. J. Comput. Sci. 2(3), 194–213 (2012)
4. Ivanov, I., Nikitchenko, M., Abraham, U.: Event-based proof of the mutual exclusion property of Peterson’s algorithm. Formaliz. Math. 23(4), 325–331 (2015). https://doi.org/10.1515/forma-2015-0026
5. Nikitchenko, M., Ivanov, I., Kornilowicz, A., Kryvolap, A.: Extended Floyd–Hoare logic over relational nominative data. CCIS, vol. 826, pp. 41–64, Springer, Cham. (2018)