The question has relevance for constructing Scott sets with certain extra desirable properties.
Suppose that $\mathfrak X$ is a countable *arithmetically closed* family of subsets of $\mathbb N$: whenever $B\in \mathfrak X$ and $C$ is definable in $\langle \mathbb N,+,\cdot, <,B, 0,1\rangle$, then $C\in\mathfrak X$. 


Let us fix some $C\notin\mathfrak X$. I would like to find a set $A$ that is almost contained in either $B$ or $B^c$ for every $B\in\mathfrak X$, which has the property that $C$ is not in the arithmetic closure of $\mathfrak X$ with $A$. Thus, closing $\mathfrak X$ and $A$ under definability does not introduce $C$. I am willing to add such an $A$ by forcing (for a ground model set $C$) but I am inclining more and more towards a counterexample. Is there an arithmetically closed family $\mathfrak X$ and a set $C\notin\mathfrak X$ so that an $A$ almost contained in every element of $\mathfrak X$ or its complement always "codes in" $C$? 



A well-behaved $A$ that is almost contained in every element of some filter for a countable arithmetically closed family $\mathfrak X$
In my paper, *A variant of Mathias forcing that preserves $\mathsf{ACA}\_0$* [Archive for Mathematical Logic 51 (2012), 751–780; [arXiv:1110.6559](http://arxiv.org/abs/1110.6559), [doi:10.1007/s00153-012-0297-4](http://dx.doi.org/10.1007/s00153-012-0297-4)], I show that $F\_\sigma$-Mathias forcing preserves $\mathsf{ACA}\_0$. When restricted to $\omega$-models the main preservation theorem gives:


**Theorem.** If $\mathfrak{X}$ is an arithmetically closed Turing ideal and $G$ is $F\_\sigma$-Mathias generic over $\mathfrak{X}$, then the Turing ideal generated by $\mathfrak{X}\cup\{G\}$ is also arithmetically closed.


The meaning of "$F\_\sigma$-Mathias generic over $\mathfrak{X}$" is that the forcing consists $F\_\sigma$-Mathias conditions coded in $\mathfrak{X}$ and that the generic $G$ should meet all of the dense sets that are definable over $\mathfrak{X}$ in the language of second-order arithmetic. (As usual, there is some flexibility in the second requirement.)


To derive the above from Theorem 4.3 of my paper, observe that the names I used are a way of formalizing Turing functionals with built-in oracles from $\mathfrak{X}$. Therefore, the evaluation of a $G$-total name is a total computable function with respect to some oracle $G \oplus X$ where $X \in \mathfrak{X}$, and all such functions can be represented by a $G$-total name in this way. It follows that the evaluation of all $G$-total names, which is how I define the generic extension, is simply the Turing ideal generated by $\mathfrak{X}\cup\{G\}$.


The result you want then follows from the following:


**Lemma.** For every partial name $F$ coded in $\mathfrak{X}$ the collection of $\mathfrak{X}$-coded conditions $(a,A,\mu)$ such that, for some $x$, $(a,A,\mu)$ forces that $F(x) \neq C(x)$ is dense.


Indeed, we may assume that $(a,A,\mu)$ forces that $F$ is total, otherwise some extension forces that $F(x)$ is undefined for some $x$. Then, if $(a,A,\mu)$ does not decide all values of $F$, then some extension will decide a value $F(x)$ to be different from $C(x)$. Finally, if $(a,A,\mu)$ decides all values of $F$ then the resulting evaluation of $F$ is computable from $F$ and $(a,A,\mu)$. Therefore, $F \neq C$ since $C \notin \mathfrak{X}$.


Note that the above is really a meta-lemma since $F(x) \neq C(x)$ is expressible in $\mathfrak{X}$ for fixed input $x$ but not for all inputs at once. Nevertheless, the lemma gives a family of open dense sets for $F\_\sigma$-Mathias forcing over $\mathfrak{X}$ and any generic $G$ that meets all of these dense sets (and all those that are definable from $\mathfrak{X}$) will be as required by the theorem: the arithmetic closure of $\mathfrak{X}\cup\{G\}$ will not contain $C$.


Note that the same result cannot be achieved with ordinary Mathias forcing since Blass has shown that every Mathias generic set computes all hyperarithmetic reals.




---


An earlier version of this answer outlined a tweaking of the cone avoiding result at the end of my paper to achieve the same goal. While that solution did work, it introduced some unnecessary complexity since the point of that result is that one can still arrange that the generic $G$ does not compute $C$ even if $C \in \mathfrak{X}$, provided that $C$ is not computable.


