Mikhail G. Peretyat'kin. The Tarski-Lindenbaum Algebra of the Class of All Strongly Constructivizable Countable Saturated Models. In Paola Bonizzoni, Vasco Brattka, Benedikt Löwe, editors, The Nature of Computation. Logic, Algorithms, Applications - 9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013. Proceedings. Volume 7921 of Lecture Notes in Computer Science, pages 342-352, Springer, 2013. [doi]
@inproceedings{Peretyatkin13,
title = {The Tarski-Lindenbaum Algebra of the Class of All Strongly Constructivizable Countable Saturated Models},
author = {Mikhail G. Peretyat'kin},
year = {2013},
doi = {10.1007/978-3-642-39053-1_41},
url = {http://dx.doi.org/10.1007/978-3-642-39053-1_41},
researchr = {https://researchr.org/publication/Peretyatkin13},
cites = {0},
citedby = {0},
pages = {342-352},
booktitle = {The Nature of Computation. Logic, Algorithms, Applications - 9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013. Proceedings},
editor = {Paola Bonizzoni and Vasco Brattka and Benedikt Löwe},
volume = {7921},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-39052-4},
}