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

In recursion theory, hyperarithmetic theory is a generalization of Turing computability. It has close connections with definability in second-order arithmetic and with weak systems of set theory such as Kripke–Platek set theory. It is an important tool in effective descriptive set theory. The central focus of hyperarithmetic theory is the sets of natural numbers known as hyperarithmetic sets. There are three equivalent ways of defining this class of sets; the study of the relationships between these different definitions is one motivation for the study of hyperarithmetical theory.

Property Value
dbo:abstract
  • In recursion theory, hyperarithmetic theory is a generalization of Turing computability. It has close connections with definability in second-order arithmetic and with weak systems of set theory such as Kripke–Platek set theory. It is an important tool in effective descriptive set theory. The central focus of hyperarithmetic theory is the sets of natural numbers known as hyperarithmetic sets. There are three equivalent ways of defining this class of sets; the study of the relationships between these different definitions is one motivation for the study of hyperarithmetical theory. (en)
  • Na Teoria da Computabilidade, a Teoria hiperaritmética é uma generalização da Computabilidade de Turing. Possui ligações estreitas com definibilidade na aritmética de segunda ordem e com sistemas fracos da teoria dos conjuntos, como a Teoria dos Conjuntos Kripke-Platek. (pt)
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 12383591 (xsd:integer)
dbo:wikiPageLength
  • 13004 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 1116124706 (xsd:integer)
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dcterms:subject
gold:hypernym
rdfs:comment
  • In recursion theory, hyperarithmetic theory is a generalization of Turing computability. It has close connections with definability in second-order arithmetic and with weak systems of set theory such as Kripke–Platek set theory. It is an important tool in effective descriptive set theory. The central focus of hyperarithmetic theory is the sets of natural numbers known as hyperarithmetic sets. There are three equivalent ways of defining this class of sets; the study of the relationships between these different definitions is one motivation for the study of hyperarithmetical theory. (en)
  • Na Teoria da Computabilidade, a Teoria hiperaritmética é uma generalização da Computabilidade de Turing. Possui ligações estreitas com definibilidade na aritmética de segunda ordem e com sistemas fracos da teoria dos conjuntos, como a Teoria dos Conjuntos Kripke-Platek. (pt)
rdfs:label
  • Hyperarithmetical theory (en)
  • Teoria hiperaritmética (pt)
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