Tarski-Kuratowski algorithm

Today it means: A nondeterministic algorithm that produces an upper bound for the complexity of a given formula in the arithmetical hierarchy and analytical hierarchy. Full definition →