Hyperarithmetical theory
id:
hyperarithmetical-theory-292-3043342
title:
Hyperarithmetical theory
text:
In computability 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 betwe
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Hyperarithmetical_theory
date created:
date modified:
2024-04-02T15:00:46Z
main entity:
{"identifier":"Q17028365","url":"https://www.wikidata.org/entity/Q17028365"}
image:
fields total:
13
integrity:
13