We introduce ocLTL, the case of LTL+P modulo {\omega}-categorical theories. We reduce its realizability and synthesis problems into the corresponding problems in propositional LTL+P. The core of the reduction replaces each data subformula with a finite disjunction over complete types. The complexity remains 2-EXPTIME with an additional blowup that depends only on the theory but not the formula. We demonstrate an application of this framework that is related to atomless Boolean algebras and Lindenbaum-Tarski algebras while drawing a connection to AI safety.