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

In mathematical logic, the Borel hierarchy is a stratification of the Borel algebra generated by the open subsets of a Polish space; elements of this algebra are called Borel sets. Each Borel set is assigned a unique countable ordinal number called the rank of the Borel set. The Borel hierarchy is of particular interest in descriptive set theory. One common use of the Borel hierarchy is to prove facts about the Borel sets using transfinite induction on rank. Properties of sets of small finite ranks are important in measure theory and analysis.

Property Value
dbo:abstract
  • In mathematical logic, the Borel hierarchy is a stratification of the Borel algebra generated by the open subsets of a Polish space; elements of this algebra are called Borel sets. Each Borel set is assigned a unique countable ordinal number called the rank of the Borel set. The Borel hierarchy is of particular interest in descriptive set theory. One common use of the Borel hierarchy is to prove facts about the Borel sets using transfinite induction on rank. Properties of sets of small finite ranks are important in measure theory and analysis. (en)
  • In der Mathematik und insbesondere der deskriptiven Mengenlehre ist die Borel-Hierarchie eine stufenweise Aufteilung der Borelschen σ-Algebra zu einem polnischen Raum. Sie stellt einen konstruktiven Aufbau aller Borel-Mengen dar. Ist eine Eigenschaft über alle Borel-Mengen zu beweisen, ist dies oft mittels transfiniter Induktion über alle Ebenen der Borel-Hierarchie möglich. (de)
  • La hiérarchie de Borel désigne une description de la tribu des boréliens d'un espace topologique X comme une réunion croissante d'ensembles de parties de X, indexée par le premier ordinal non dénombrable. (fr)
dbo:wikiPageID
  • 5539282 (xsd:integer)
dbo:wikiPageLength
  • 9385 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 951750136 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdf:type
rdfs:comment
  • In mathematical logic, the Borel hierarchy is a stratification of the Borel algebra generated by the open subsets of a Polish space; elements of this algebra are called Borel sets. Each Borel set is assigned a unique countable ordinal number called the rank of the Borel set. The Borel hierarchy is of particular interest in descriptive set theory. One common use of the Borel hierarchy is to prove facts about the Borel sets using transfinite induction on rank. Properties of sets of small finite ranks are important in measure theory and analysis. (en)
  • In der Mathematik und insbesondere der deskriptiven Mengenlehre ist die Borel-Hierarchie eine stufenweise Aufteilung der Borelschen σ-Algebra zu einem polnischen Raum. Sie stellt einen konstruktiven Aufbau aller Borel-Mengen dar. Ist eine Eigenschaft über alle Borel-Mengen zu beweisen, ist dies oft mittels transfiniter Induktion über alle Ebenen der Borel-Hierarchie möglich. (de)
  • La hiérarchie de Borel désigne une description de la tribu des boréliens d'un espace topologique X comme une réunion croissante d'ensembles de parties de X, indexée par le premier ordinal non dénombrable. (fr)
rdfs:label
  • Borel-Hierarchie (de)
  • Borel hierarchy (en)
  • Hiérarchie de Borel (fr)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
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