This HTML5 document contains 47 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n9https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:List_of_algorithms
dbo:wikiPageWikiLink
dbr:Tarski–Kuratowski_algorithm
Subject Item
dbr:Arithmetical_hierarchy
dbo:wikiPageWikiLink
dbr:Tarski–Kuratowski_algorithm
Subject Item
dbr:Kazimierz_Kuratowski
dbo:wikiPageWikiLink
dbr:Tarski–Kuratowski_algorithm
Subject Item
dbr:List_of_things_named_after_Alfred_Tarski
dbo:wikiPageWikiLink
dbr:Tarski–Kuratowski_algorithm
Subject Item
dbr:Tarski-Kuratowski_algorithm
dbo:wikiPageWikiLink
dbr:Tarski–Kuratowski_algorithm
dbo:wikiPageRedirects
dbr:Tarski–Kuratowski_algorithm
Subject Item
dbr:Tarski–Kuratowski_algorithm
rdf:type
yago:Arrangement107938773 yago:Series108457976 dbo:Software yago:Hierarchy108377806 yago:WikicatMathematicalLogicHierarchies yago:Group100031264 yago:Ordering108456993 yago:Abstraction100002137
rdfs:label
Tarski–Kuratowski algorithm
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.
dcterms:subject
dbc:Computability_theory dbc:Theory_of_computation dbc:Mathematical_logic_hierarchies
dbo:wikiPageID
2756430
dbo:wikiPageRevisionID
1026662420
dbo:wikiPageWikiLink
dbc:Computability_theory dbr:Non-deterministic_algorithm dbr:Existential_quantification dbr:Hartley_Rogers_Jr. dbr:Mathematical_logic dbr:Arithmetical_hierarchy dbc:Theory_of_computation dbr:Alfred_Tarski dbr:Prenex_normal_form dbr:Analytical_hierarchy dbr:Computability_theory dbr:Kazimierz_Kuratowski dbc:Mathematical_logic_hierarchies dbr:Universal_quantification dbr:Upper_bound
owl:sameAs
n9:4w5TM freebase:m.080yml wikidata:Q7686764
dbp:wikiPageUsesTemplate
dbt:Mathlogic-stub dbt:ISBN
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.
gold:hypernym
dbr:Algorithm
prov:wasDerivedFrom
wikipedia-en:Tarski–Kuratowski_algorithm?oldid=1026662420&ns=0
dbo:wikiPageLength
1381
foaf:isPrimaryTopicOf
wikipedia-en:Tarski–Kuratowski_algorithm
Subject Item
wikipedia-en:Tarski–Kuratowski_algorithm
foaf:primaryTopic
dbr:Tarski–Kuratowski_algorithm