Magnetic complex reluctance

In computability theory and mathematical logic the Tarski–Kuratowski algorithm is a non-deterministic algorithm which provides an upper bound for the complexity of formulas in the arithmetical hierarchy and analytical hierarchy.

The algorithm is named after Alfred Tarski and Kazimierz Kuratowski.

Algorithm

The Tarski–Kuratowski algorithm for the arithmetical hierarchy:

1. Convert the formula to prenex normal form.
2. If the formula is quantifier-free, it is in ${\mathrm{\Sigma }}_0^0$ and ${\mathrm{\Pi }}_0^0$.
3. Otherwise, count the number of alternations of quantifiers; call this k.
4. If the first quantifier is ∃, the formula is in ${\mathrm{\Sigma }}_{k+1}^0$.
5. If the first quantifier is ∀, the formula is in ${\mathrm{\Pi }}_{k+1}^0$.

References

• Rogers, H. The Theory of Recursive Functions and Effective Computability, MIT Press. ISBN 0-262-68052-1; ISBN 0-07-053522-1

Template:Mathlogic-stub