We investigate the complexity of several classical model theoretic theorems about prime and atomic models and omitting types. Some are provable in RCA, and others are equivalent to ACA. One, that every atomic theory has an atomic model, is not provable in RCA but is incomparable with WKL, more than conservative over RCA and strictly weaker than all the combinatorial principles of Hirschfeldt and Shore (2007) that are not conservative over RCA. A priority argument with Shore blocking shows that it is also -conservative over B . We also provide a theorem provable by a finite injury priority argument that is conservative over I but implies I over B , and a type omitting theorem that is equivalent to the principle that for every there is a set that is hyperimmune relative to . Finally, we give a version of the atomic model theorem that is equivalent to the principle that for every there is a set that is not recursive in , and is thus in a sense the weakest possible natural principle not true in the -model consisting of the recursive sets.