http://dbpedia.org/ontology/abstract
|
In the mathematical field of descriptive s … 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.tion and preimages by recursive functions.
|
http://dbpedia.org/ontology/wikiPageID
|
10192324
|
http://dbpedia.org/ontology/wikiPageLength
|
985
|
http://dbpedia.org/ontology/wikiPageRevisionID
|
745838014
|
http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Bounded_quantifier +
, http://dbpedia.org/resource/Category:Descriptive_set_theory +
, http://dbpedia.org/resource/Recursive_set +
, http://dbpedia.org/resource/Pointclass +
, http://dbpedia.org/resource/Descriptive_set_theory +
|
http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Settheory-stub +
|
http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Descriptive_set_theory +
|
http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Adequate_pointclass?oldid=745838014&ns=0 +
|
http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Adequate_pointclass +
|
owl:sameAs |
https://global.dbpedia.org/id/4LXjC +
, http://dbpedia.org/resource/Adequate_pointclass +
, http://www.wikidata.org/entity/Q4682345 +
, http://rdf.freebase.com/ns/m.02q4q_t +
|
rdfs:comment |
In the mathematical field of descriptive s … 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.tion and preimages by recursive functions.
|
rdfs:label |
Adequate pointclass
|