Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Tarski–Kuratowski_algorithm> ?p ?o. }
Showing items 1 to 12 of
12
with 100 items per page.
- Tarski–Kuratowski_algorithm abstract "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.".
- Tarski–Kuratowski_algorithm wikiPageID "2756430".
- Tarski–Kuratowski_algorithm wikiPageRevisionID "551279029".
- Tarski–Kuratowski_algorithm subject Category:Computability_theory.
- Tarski–Kuratowski_algorithm subject Category:Mathematical_logic_hierarchies.
- Tarski–Kuratowski_algorithm subject Category:Theory_of_computation.
- Tarski–Kuratowski_algorithm comment "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.".
- Tarski–Kuratowski_algorithm label "Tarski–Kuratowski algorithm".
- Tarski–Kuratowski_algorithm sameAs Tarski%E2%80%93Kuratowski_algorithm.
- Tarski–Kuratowski_algorithm sameAs Q7686764.
- Tarski–Kuratowski_algorithm sameAs Q7686764.
- Tarski–Kuratowski_algorithm wasDerivedFrom Tarski–Kuratowski_algorithm?oldid=551279029.