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:
“The theory of the Communists may be summed up in the single sentence: Abolition of private property.”
—Karl Marx (1818–1883)