Research Training Network in Model Theory
Publications > Preprint server > Preprint Number 1914

Preprint Number 1914

Previous Next Preprint server

1914. Nathanael Ackerman, Cameron Freer, Rehana Patel
On computable aspects of algebraic and definable closure

Submission date: 28 January 2021


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 Σ^0_{n+2} sets. We further show that these bounds are tight.

Mathematics Subject Classification:

Keywords and phrases:

Full text arXiv 2101.11849: pdf, ps.

Last updated: March 23 2021 09:21 Please send your corrections to: