We develop a transfer principle of structural Ramsey theory from finite structures to ultraproducts. We show that under certain mild conditions, when a class of finite structures has finite small Ramsey degrees, under the (Generalized) Continuum Hypothesis the ultraproduct has finite big Ramsey degrees for internal colorings. The necessity of restricting to internal colorings is demonstrated by the example of the ultraproduct of finite linear orders. Under CH, this ultraproduct L⁎ has, as a spine, η1, an uncountable analogue of the order type of rationals η. Finite big Ramsey degrees for η were exactly calculated by Devlin in [5]. It is immediate from [39] that η1 fails to have finite big Ramsey degrees. Moreover, we extend Devlin's coloring to η1 to show that it witnesses big Ramsey degrees of finite tuples in η on every copy of η in η1, and consequently in L⁎. This work gives additional confirmation that ultraproducts are a suitable environment for studying Ramsey properties of finite and infinite structures.

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.