Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Tarski–Kuratowski algorithm
open-in-new
<p>In <a href="/facts/Computability_theory/cqDfXwdf">computability theory</a> and <a href="/facts/Mathematical_logic/SaI7Y3wN">mathematical logic</a> the Tarski–Kuratowski algorithm is a <a href="/facts/Non-deterministic_algorithm/UubLdp3D">non-deterministic algorithm</a> that produces an <a href="/facts/Upper_bound/YJje9oC2">upper bound</a> for the complexity of a given formula in the <a href="/facts/Arithmetical_hierarchy/rQptcBFK">arithmetical hierarchy</a> and <a href="/facts/Analytical_hierarchy/C9r61LzA">analytical hierarchy</a>. </p><p>The algorithm is named after <a href="/facts/Alfred_Tarski/7h6NySAj">Alfred Tarski</a> and <a href="/facts/Kazimierz_Kuratowski/8xoKvo5b">Kazimierz Kuratowski</a>. </p>