In computability theory and mathematical logic the TarskiâKuratowski algorithm is a non-deterministic algorithm that produces an upper bound for the complexity of a given formula in the arithmetical hierarchy and analytical hierarchy.
The algorithm is named after Alfred Tarski and Kazimierz Kuratowski.
The TarskiâKuratowski algorithm for the arithmetical hierarchy consists of the following steps:
In computability theory and mathematical logic the TarskiâKuratowski algorithm is a non-deterministic algorithm that produces an upper bound for the complexity of a given formula in the arithmetical hierarchy and analytical hierarchy.
The algorithm is named after Alfred Tarski and Kazimierz Kuratowski.
The TarskiâKuratowski algorithm for the arithmetical hierarchy consists of the following steps: