Nathanael L. Ackerman, Cameron E. Freer, Rehana Patel. Computability of Algebraic and Definable Closure. In Sergei N. Artëmov, Anil Nerode, editors, Logical Foundations of Computer Science - International Symposium, LFCS 2020, Deerfield Beach, FL, USA, January 4-7, 2020, Proceedings. Volume 11972 of Lecture Notes in Computer Science, pages 1-11, Springer, 2020. [doi]
@inproceedings{AckermanFP20,
title = {Computability of Algebraic and Definable Closure},
author = {Nathanael L. Ackerman and Cameron E. Freer and Rehana Patel},
year = {2020},
doi = {10.1007/978-3-030-36755-8_1},
url = {https://doi.org/10.1007/978-3-030-36755-8_1},
researchr = {https://researchr.org/publication/AckermanFP20},
cites = {0},
citedby = {0},
pages = {1-11},
booktitle = {Logical Foundations of Computer Science - International Symposium, LFCS 2020, Deerfield Beach, FL, USA, January 4-7, 2020, Proceedings},
editor = {Sergei N. Artëmov and Anil Nerode},
volume = {11972},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-030-36755-8},
}