Computability of Algebraic and Definable Closure

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]

Abstract

Abstract is missing.