Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Tarski–Kuratowski_algorithm> ?p ?o }
Showing triples 1 to 32 of
32
with 100 triples 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 wikiPageLength "1174".
- Tarski–Kuratowski_algorithm wikiPageOutDegree "13".
- Tarski–Kuratowski_algorithm wikiPageRevisionID "551279029".
- Tarski–Kuratowski_algorithm wikiPageWikiLink Alfred_Tarski.
- Tarski–Kuratowski_algorithm wikiPageWikiLink Analytical_hierarchy.
- Tarski–Kuratowski_algorithm wikiPageWikiLink Arithmetical_hierarchy.
- Tarski–Kuratowski_algorithm wikiPageWikiLink Category:Computability_theory.
- Tarski–Kuratowski_algorithm wikiPageWikiLink Category:Mathematical_logic_hierarchies.
- Tarski–Kuratowski_algorithm wikiPageWikiLink Category:Theory_of_computation.
- Tarski–Kuratowski_algorithm wikiPageWikiLink Computability_theory.
- Tarski–Kuratowski_algorithm wikiPageWikiLink Existential_quantification.
- Tarski–Kuratowski_algorithm wikiPageWikiLink Kazimierz_Kuratowski.
- Tarski–Kuratowski_algorithm wikiPageWikiLink Mathematical_logic.
- Tarski–Kuratowski_algorithm wikiPageWikiLink Non-deterministic_algorithm.
- Tarski–Kuratowski_algorithm wikiPageWikiLink Nondeterministic_algorithm.
- Tarski–Kuratowski_algorithm wikiPageWikiLink Prenex_normal_form.
- Tarski–Kuratowski_algorithm wikiPageWikiLink Universal_quantification.
- Tarski–Kuratowski_algorithm wikiPageWikiLinkText "Tarski–Kuratowski algorithm".
- Tarski–Kuratowski_algorithm hasPhotoCollection Tarski–Kuratowski_algorithm.
- Tarski–Kuratowski_algorithm wikiPageUsesTemplate Template:Mathlogic-stub.
- 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 m.080yml.
- Tarski–Kuratowski_algorithm sameAs Q7686764.
- Tarski–Kuratowski_algorithm sameAs Q7686764.
- Tarski–Kuratowski_algorithm wasDerivedFrom Tarski–Kuratowski_algorithm?oldid=551279029.
- Tarski–Kuratowski_algorithm isPrimaryTopicOf Tarski–Kuratowski_algorithm.