Computability of Algebraic and Definable Closure - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Nathanael L. Ackerman' in GoogleThis author has not been identified. Look up 'Cameron E. Freer' in GoogleThis author has not been identified. Look up 'Rehana Patel' in Google

runs on WebDSL