User blog comment:DontDrinkH20/Some ZFC-Definable very big LCOs - uncomputable?/@comment-35470197-20180830044905/@comment-36540075-20180830050228

Oh, I could use a number of formalizations. For example, using colored trees to describe every formula, and then defining a truth predicate for them because they are all bounded in \(V_\alpha\). Since \(V_\alpha\) is a definable function on \(\alpha\), \(\theta_\alpha\) is also.