Effective prime uniqueness
Peter A. Cholak, Charlie McCoy · Proceedings of the American Mathematical Society · 2017
Assuming the obvious definitions below, we show that a decidable model that is effectively prime is also effectively atomic. This implies that two effectively prime (decidable) models are computably isomorphic. This is in contrast to the theorem that there are two atomic decidable models which are not computably isomorphic. We end with a section describing the implications of this result in reverse mathematics.