Arithmetical hierarchy
In mathematical logic, the arithmetical hierarchy, arithmetic hierarchy or Kleene–Mostowski hierarchy (after mathematicians Stephen Cole Kleene and Andrzej Mostowski) classifies certain sets based on the complexity of formulas that define them. Any set that receives a classification is called arithmetical. The arithmetical hierarchy was invented independently by Kleene (1943) and Mostowski (1946).
Arithmetical hierarchy - Wikipedia Jump to content From Wikipedia, the free encyclopedia This article includes a list of references , related reading , or external links , but its sources remain unclear because it lacks inline citations . Please help improve this article by introducing more precise citations. ( June 2021 ) ( Learn how and when to remove this message ) Hierarchy of complexity classes for formulas defining sets An illustration of how the levels of the hierarchy interact and where some basic set categories lie within it. In mathematical logic , the arithmetical hierarchy , arithm
Explore this link on the map →saved by
related reading
- Complexity class - Wikipediaen.wikipedia.org
- Arithmetical hierarchy — LessWronglesswrong.com
- Chomsky hierarchy - Wikipediaen.wikipedia.org
- First-order logic - Wikipediaen.wikipedia.org
- Second-order arithmetic - Wikipediaen.wikipedia.org
- Gödel's incompleteness theorems - Wikipediaen.wikipedia.org
- Philosophy of Mathematics (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- Computational Complexity Theory (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- Complexity Zoocomplexityzoo.net
- Computably enumerable set - Wikipediaen.wikipedia.org
- Set Theory | Internet Encyclopedia of Philosophyiep.utm.edu
- Computational Complexityblog.computationalcomplexity.org