- Algorithm
- References
In computability theory and mathematical logic the Tarski–Kuratowski algorithm is a non-deterministic algorithm which 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.
Algorithm
The Tarski–Kuratowski algorithm for the arithmetical hierarchy consists of the following steps:
- Convert the formula to prenex normal form. (This is the non-deterministic part of the algorithm, as there may be more than one valid prenex normal form for the given formula.)
- If the formula is quantifier-free, it is in
and 
. - Otherwise, count the number of alternations of quantifiers; call this k.
- If the first quantifier is ∃, the formula is in
. - If the first quantifier is ∀, the formula is in
.
References
- Rogers, H. The Theory of Recursive Functions and Effective Computability, MIT Press. {{ISBN|0-262-68052-1}}; {{ISBN|0-07-053522-1}}
3 : Mathematical logic hierarchies|Computability theory|Theory of computation
- 2012 FC Bunyodkor season
- 2012 FC Dallas season
- 2012 FC Edmonton season
- 2012 FC Gifu season
- 2012 FC Indiana season
- 2012 FC Machida Zelvia season
- 2012 FC Nasaf season
- 2012 FC Pakhtakor season
- 2012 FC Seoul season
- 2012 FC Tofaga season
- 2012 FC Tokyo season
- 2012 FDJ season
- 2012 FDJ–BigMat season
- 2012 Fed Cup
- 2012 Fed Cup Americas Zone
- 2012 Fed Cup Americas Zone Group II - Pool A
- 2012 Fed Cup Americas Zone Group II - Pool B
- 2012 Fed Cup Americas Zone Group II – Play-offs
- 2012 Fed Cup Americas Zone Group II – Pool A
- 2012 Fed Cup Americas Zone Group II – Pool B
- 2012 Fed Cup Americas Zone Group I – Play-offs
- 2012 Fed Cup Americas Zone Group I – Pool A
- 2012 Fed Cup Americas Zone Group I – Pool B
- 2012 Fed Cup Asia/Oceania Group II – Pool A
- 2012 Fed Cup Asia/Oceania Group II – Pool B