About: Tarski–Kuratowski algorithm

An Entity of Type: software, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

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.

Property Value
dbo:abstract
  • 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. (en)
dbo:wikiPageID
  • 2756430 (xsd:integer)
dbo:wikiPageLength
  • 1381 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1026662420 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • 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. (en)
rdfs:label
  • Tarski–Kuratowski algorithm (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License