HTML Microdata document

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

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

Prefix	IRI
dct	http://purl.org/dc/terms/
dbo	http://dbpedia.org/ontology/
foaf	http://xmlns.com/foaf/0.1/
n15	https://global.dbpedia.org/id/
dbt	http://dbpedia.org/resource/Template:
rdfs	http://www.w3.org/2000/01/rdf-schema#
freebase	http://rdf.freebase.com/ns/
rdf	http://www.w3.org/1999/02/22-rdf-syntax-ns#
owl	http://www.w3.org/2002/07/owl#
wikipedia-en	http://en.wikipedia.org/wiki/
dbp	http://dbpedia.org/property/
dbc	http://dbpedia.org/resource/Category:
prov	http://www.w3.org/ns/prov#
xsdh	http://www.w3.org/2001/XMLSchema#
wikidata	http://www.wikidata.org/entity/
dbr	http://dbpedia.org/resource/

Subject Item: dbr:Adequate_pointclass
rdfs:label: Adequate pointclass
rdfs:comment: In the mathematical field of descriptive set theory, a pointclass can be called adequate if it contains all recursive pointsets and is closed under recursive substitution, bounded universal and existential quantification and preimages by recursive functions.
dct:subject: dbc:Descriptive_set_theory
dbo:wikiPageID: 10192324
dbo:wikiPageRevisionID: 745838014
dbo:wikiPageWikiLink: dbr:Pointclass dbc:Descriptive_set_theory dbr:Descriptive_set_theory dbr:Recursive_set dbr:Bounded_quantifier
owl:sameAs: wikidata:Q4682345 freebase:m.02q4q_t n15:4LXjC
dbp:wikiPageUsesTemplate: dbt:Settheory-stub dbt:Reflist
dbo:abstract: In the mathematical field of descriptive set theory, a pointclass can be called adequate if it contains all recursive pointsets and is closed under recursive substitution, bounded universal and existential quantification and preimages by recursive functions.
prov:wasDerivedFrom: wikipedia-en:Adequate_pointclass?oldid=745838014&ns=0
dbo:wikiPageLength: 985
foaf:isPrimaryTopicOf: wikipedia-en:Adequate_pointclass