Funder
Российский Фонд Фундаментальных Исследований
Publisher
Springer Science and Business Media LLC
Subject
Linguistics and Language,Philosophy,Computer Science (miscellaneous)
Reference40 articles.
1. Alaev, P. E. (2012). Computably categorical Boolean algebras enriched by ideals and atoms. Annals of Pure and Applied Logic, 163(5), 485–499.
2. Ash, C. J., & Knight, J. F. (2000). Computable structures and the hyperarithmetical hierarchy, studies in Logic and the foundations of mathematics. Amsterdam: Elsevier Science B.V.
3. Balbes, R., & Dwinger, P. (1974). Distributive lattices. Columbia: Univ. Missouri Press.
4. Bazhenov, N. (2016). Categoricity spectra for polymodal algebras. Studia Logica, 104(6), 1083–1097.
5. Bazhenov, N. (2019). Computable contact algebras. Fundamenta Informaticae, 167(4), 257–269.