Hyperarithmetical Theory
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.
Read more about Hyperarithmetical Theory: Hyperarithmetical Sets, Example: The Truth Set of Arithmetic, Fundamental Results, Relativized Hyperarithmeticity and Hyperdegrees, Generalizations
Famous quotes containing the word theory:
“... liberal intellectuals ... tend to have a classical theory of politics, in which the state has a monopoly of power; hoping that those in positions of authority may prove to be enlightened men, wielding power justly, they are natural, if cautious, allies of the “establishment.””
—Susan Sontag (b. 1933)