|
|
| Line 1: |
Line 1: |
| {{otheruses4|the classification of sets|making complex decisions|Analytic Hierarchy Process}}
| | Pleased to meet you! Some of my name is Eusebio and I think it music quite good when say it. As a man what While i really like is coming off as but I'm thinking across starting something new. I work as an order clerk. My house is then in South Carolina in addition to I don't plan changing it. You will find my website here: http://circuspartypanama.com<br><br>My weblog [http://circuspartypanama.com clash of clans hacker download] |
| In [[mathematical logic]] and [[descriptive set theory]], the '''analytical hierarchy''' is an extension of the [[arithmetical hierarchy]]. The analytical hierarchy of formulas includes formulas in the language of [[second-order arithmetic]], which can have quantifiers over both the set of [[natural numbers]], <math>\mathbb{N}</math>, and over functions from <math>\mathbb{N}</math> to <math>\mathbb{N}</math>. The analytical hierarchy of sets classifies sets by the formulas that can be used to define them; it is the [[lightface]] version of the [[projective hierarchy]].
| |
| | |
| == The analytical hierarchy of formulas ==
| |
| The notation <math>\Sigma^1_0 = \Pi^1_0 = \Delta^1_0</math>
| |
| indicates the class of formulas in the language of [[second-order arithmetic]] with no set quantifiers. This language does not contain set parameters. The Greek letters here are [[lightface]] symbols, which indicate this choice of language. Each corresponding [[Boldface (mathematics)|boldface]] symbol denotes the corresponding class of formulas in the extended language with a parameter for each [[real number|real]]; see [[projective hierarchy]] for details.
| |
| | |
| A formula in the language of second-order arithmetic is defined to be <math>\Sigma^1_{n+1}</math> if it is [[logical equivalence|logically equivalent]] to a formula of the form <math>\exists X_1\cdots \exists X_k \psi</math> where <math>\psi</math> is <math>\Pi^1_{n}</math>. A formula is defined to be <math>\Pi^1_{n+1}</math> if it is logically equivalent to a formula of the form <math>\forall X_1\cdots \forall X_k \psi</math> where <math>\psi</math> is <math>\Sigma^1_{n}</math>. This inductive definition defines the classes <math>\Sigma^1_n</math> and <math>\Pi^1_n</math> for every natural number <math>n</math>.
| |
| | |
| Because every formula has a [[prenex normal form]], every formula in the language of second-order arithmetic is <math>\Sigma^1_n</math> or <math>\Pi^1_n</math> for some <math>n</math>. Because meaningless quantifiers can be added to any formula, once a formula is given the classification <math>\Sigma^1_n</math> or <math>\Pi^1_n</math> for some <math>n</math> it will be given the classifications <math>\Sigma^1_m</math> and <math>\Pi^1_m</math> for all <math>m</math> greater than <math>n</math>.
| |
| | |
| == The analytical hierarchy of sets of natural numbers ==
| |
| A set of natural numbers is assigned the classification <math>\Sigma^1_n</math> if it is definable by a <math>\Sigma^1_n</math> formula. The set is assigned the classification <math>\Pi^1_n</math> if it is definable by a <math>\Pi^1_n</math> formula. If the set is both <math>\Sigma^1_n</math> and <math>\Pi^1_n</math> then it is given the additional classification <math>\Delta^1_n</math>.
| |
| | |
| The <math>\Delta^1_1</math> sets are called '''hyperarithmetical'''. An alternate classification of these sets by way of iterated computable functionals is provided by [[hyperarithmetical theory]].
| |
| | |
| == The analytical hierarchy on subsets of Cantor and Baire space ==
| |
| | |
| The analytical hierarchy can be defined on any [[effective Polish space]]; the definition is particularly simple for Cantor and Baire space because they fit with the language of ordinary second-order arithmetic. [[Cantor space]] is the set of all infinite sequences of 0s and 1s; [[Baire space (set theory)|Baire space]] is the set of all infinite sequences of natural numbers. These are both [[Polish space]]s.
| |
| | |
| The ordinary axiomatization of [[second-order arithmetic]] uses a set-based language in which the set quantifiers can naturally be viewed as quantifying over Cantor space. A subset of Cantor space is assigned the classification <math>\Sigma^1_n</math> if it is definable by a <math>\Sigma^1_n</math> formula. The set is assigned the classification <math>\Pi^1_n</math> if it is definable by a <math>\Pi^1_n</math> formula. If the set is both <math>\Sigma^1_n</math> and <math>\Pi^1_n</math> then it is given the additional classification <math>\Delta^1_n</math>.
| |
| | |
| A subset of Baire space has a corresponding subset of Cantor space under the map that takes each function from <math>\omega</math> to <math>\omega</math> to the characteristic function of its graph. A subset of Baire space is given the classification <math>\Sigma^1_n</math>, <math>\Pi^1_n</math>, or <math>\Delta^1_n</math> if and only if the corresponding subset of Cantor space has the same classification. An equivalent definition of the analytical hierarchy on Baire space is given by defining the analytical hierarchy of formulas using a functional version of second-order arithmetic; then the analytical hierarchy on subsets of Cantor space can be defined from the hierarchy on Baire space. This alternate definition gives exactly the same classifications as the first definition.
| |
| | |
| Because Cantor space is homeomorphic to any finite Cartesian power of itself, and Baire space is homeomorphic to any finite Cartesian power of itself, the analytical hierarchy applies equally well to finite Cartesian power of one of these spaces.
| |
| A similar extension is possible for countable powers and to products of powers of Cantor space and powers of Baire space.
| |
| | |
| == Extensions ==
| |
| | |
| As is the case with the [[arithmetical hierarchy]], a relativized version of the analytical hierarchy can be defined. The language is extended to add a constant set symbol ''A''. A formula in the extended language is inductively defined to be <math>\Sigma^{1,A}_n</math> or <math>\Pi^{1,A}_n</math> using the same inductive definition as above. Given a set <math>Y</math>, a set is defined to be <math>\Sigma^{1,Y}_n</math> if it is definable by a <math>\Sigma^{1,A}_n</math> formula in which the symbol <math>A</math> is interpreted as <math>Y</math>; similar definitions for <math>\Pi^{1,Y}_n</math> and <math>\Delta^{1,Y}_n</math> apply. The sets that are <math>\Sigma^{1,Y}_n</math> or <math>\Pi^{1,Y}_n</math>, for any parameter ''Y'', are classified in the [[projective hierarchy]].
| |
| | |
| == Examples ==
| |
| | |
| * The set of all natural numbers which are indices of computable ordinals is a <math>\Pi^1_1</math> set which is not <math>\Sigma^1_1</math>.
| |
| | |
| * The set of elements of Cantor space which are the characteristic functions of well orderings of <math>\omega</math> is a <math>\Pi^1_1</math> set which is not <math>\Sigma^1_1</math>. In fact, this set is not <math>\Sigma^{1,Y}_1</math> for any element <math>Y</math> of Baire space.
| |
| | |
| * If the [[axiom of constructibility]] holds then there is a subset of the product of the Baire space with itself which is <math>\Delta^1_2</math> and is the graph of a [[well ordering]] of Baire space. If the axiom holds then there is also a <math>\Delta^1_2</math> well ordering of Cantor space.
| |
| | |
| == Properties ==
| |
| | |
| For each <math>n</math> we have the following strict containments:
| |
| | |
| :<math>\Pi^1_n \subset \Sigma^1_{n+1}</math>,
| |
| :<math>\Pi^1_n \subset \Pi^1_{n+1}</math>,
| |
| :<math>\Sigma^1_n \subset \Pi^1_{n+1}</math>, | |
| :<math>\Sigma^1_n \subset \Sigma^1_{n+1}</math>.
| |
| | |
| A set that is in <math>\Sigma^1_n</math> for some ''n'' is said to be '''analytical'''. Care is required to distinguish this usage from the term [[analytic set]] which has a different meaning.
| |
| | |
| ==External links==
| |
| | |
| *[http://planetmath.org/encyclopedia/AnalyticHierarchy.html PlanetMath page]
| |
| | |
| == References ==
| |
| | |
| * {{cite book | author=Rogers, H. | title= Theory of recursive functions and effective computability|
| |
| publisher=McGraw-Hill | year=1967}}
| |
| * {{cite book | author=Kechris, A. | title= Classical Descriptive Set Theory |
| |
| publisher=Springer | year=1995 | isbn = 0-387-94374-9| edition=Graduate Texts in Mathematics 156}}
| |
| | |
| [[Category:Computability theory]]
| |
| [[Category:Effective descriptive set theory]]
| |
| [[Category:Hierarchy]]
| |
| [[Category:Mathematical logic hierarchies]]
| |
Pleased to meet you! Some of my name is Eusebio and I think it music quite good when say it. As a man what While i really like is coming off as but I'm thinking across starting something new. I work as an order clerk. My house is then in South Carolina in addition to I don't plan changing it. You will find my website here: http://circuspartypanama.com
My weblog clash of clans hacker download