On computable aspects of algebraic and definable closure
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.
2006 ◽
Vol 2
(S239)
◽
pp. 77-79
◽
Keyword(s):
Keyword(s):
Keyword(s):
1957 ◽
Vol 30
(3)
◽
pp. 237-241
◽
Keyword(s):
2004 ◽
Vol 56
(4)
◽
pp. 673-698
◽
Keyword(s):
2016 ◽
Vol 19
(A)
◽
pp. 220-234
◽
Keyword(s):