Site Navigation
Categories:
Mathematical logic hierarchies
Recursion theory
Effective descriptive set theory
Hierarchy

Summary Of: Arithmetical hierarchy

The arithmetical hierarchy is important in... extend the arithmetical hierarchy to classify additional formulas and sets... The arithmetical hierarchy of sets of natural numbers... The arithmetical hierarchy of subsets of Cantor and Baire space... The arithmetical hierarchy assigns classifications to the formulas in the language of... The arithmetical hierarchy of sets of natural numbers... The arithmetical hierarchy of sets of natural numbers... A parallel definition is used to define the arithmetical hierarchy on finite Cartesian powers of the natural numbers... free number variables are used to define the arithmetical hierarchy on sets of... The arithmetical hierarchy of subsets of Cantor and Baire space... The arithmetical hierarchy of subsets of Cantor and Baire space... A parallel definition is used to define the arithmetical hierarchy on finite Cartesian powers of Baire space or Cantor space... The arithmetical hierarchy can be defined on any... It is possible to define the arithmetical hierarchy of formulas using a language extended with a function symbol for each... The lightface Borel hierarchy extends the arithmetical hierarchy to include additional Borel sets... The following properties hold for the arithmetical hierarchy of sets of natural numbers and the arithmetical hierarchy of subsets of Cantor or Baire... establishes a close connection between the arithmetical hierarchy of sets of natural numbers and the... version of the arithmetical hierarchy in which polynomial length bounds are placed on the numbers involved...

Encyclodia Page On: Arithmetical hierarchy

These Are Links To Other Documents
mathematical logic | recursion theory | effective descriptive set theory | Peano arithmetic | Tarski-Kuratowski algorithm | hyperarithmetical hierarchy | analytical hierarchy | first-order arithmetic | lightface | bounded quantifiers | prenex normal form | recursive | Turing reducibility | Cantor space | Baire space | second-order arithmetic | Cantor space | characteristic function | Borel sets | primitive recursive function | analytical hierarchy | recursively enumerable sets | Borel set | unions | intersections | oracle machine | halting problem | Post's theorem | Turing degrees | Turing jump | many-one complete | Turing complete | polynomial hierarchy | Recursion theory | Effective descriptive set theory | Analytical hierarchy | Interpretability logic | Hierarchy (mathematics) | ISBN 0-444-70199-0 | Categories | Mathematical logic hierarchies | Recursion theory | Effective descriptive set theory | Hierarchy |
This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Arithmetical hierarchy".