@article{ackerman_freer_patel_2020,
title={On computable aspects of algebraic and definable closure},
DOI={10.1093/logcom/exaa070},
abstractNote={Abstract
We investigate the computability of algebraic closure and definable closure with respect to a collection of formulas. We show that for a computable collection of formulas of quantifier rank at most $n$, in any given computable structure, both algebraic and definable closure with respect to that collection are $\varSigma ^0_{n+2}$ sets. We further show that these bounds are tight.},
publisher={Oxford University Press (OUP)},
author={Ackerman, Nathanael and Freer, Cameron and Patel, Rehana},
year={2020},
month={Dec}
}