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:
“Hygiene is the corruption of medicine by morality. It is impossible to find a hygienest who does not debase his theory of the healthful with a theory of the virtuous.... The true aim of medicine is not to make men virtuous; it is to safeguard and rescue them from the consequences of their vices.”
—H.L. (Henry Lewis)