Effective descriptive set theory

Effective descriptive set theory is the branch of descriptive set theory dealing with sets of reals having lightface definitions; that is, definitions that do not require an arbitrary real parameter (Moschovakis 1980). Thus effective descriptive set theory combines descriptive set theory with recursion theory.

Constructions

Effective Polish space

Main page: Effective Polish space

An effective Polish space is a complete separable metric space that has a computable presentation. Such spaces are studied in both effective descriptive set theory and in constructive analysis. In particular, standard examples of Polish spaces such as the real line, the Cantor set and the Baire space are all effective Polish spaces.

Arithmetical hierarchy

Main page: Arithmetical hierarchy

The arithmetical hierarchy, arithmetic hierarchy or Kleene–Mostowski hierarchy classifies certain sets based on the complexity of formulas that define them. Any set that receives a classification is called "arithmetical".

More formally, the arithmetical hierarchy assigns classifications to the formulas in the language of first-order arithmetic. The classifications are denoted [math]\displaystyle{ \Sigma^0_n }[/math] and [math]\displaystyle{ \Pi^0_n }[/math] for natural numbers n (including 0). The Greek letters here are lightface symbols, which indicates that the formulas do not contain set parameters.

If a formula [math]\displaystyle{ \phi }[/math] is logically equivalent to a formula with only bounded quantifiers then [math]\displaystyle{ \phi }[/math] is assigned the classifications [math]\displaystyle{ \Sigma^0_0 }[/math] and [math]\displaystyle{ \Pi^0_0 }[/math].

The classifications [math]\displaystyle{ \Sigma^0_n }[/math] and [math]\displaystyle{ \Pi^0_n }[/math] are defined inductively for every natural number n using the following rules:

• If [math]\displaystyle{ \phi }[/math] is logically equivalent to a formula of the form [math]\displaystyle{ \exists n_1 \exists n_2\cdots \exists n_k \psi }[/math], where [math]\displaystyle{ \psi }[/math] is [math]\displaystyle{ \Pi^0_n }[/math], then [math]\displaystyle{ \phi }[/math] is assigned the classification [math]\displaystyle{ \Sigma^0_{n+1} }[/math].
• If [math]\displaystyle{ \phi }[/math] is logically equivalent to a formula of the form [math]\displaystyle{ \forall n_1 \forall n_2\cdots \forall n_k \psi }[/math], where [math]\displaystyle{ \psi }[/math] is [math]\displaystyle{ \Sigma^0_n }[/math], then [math]\displaystyle{ \phi }[/math] is assigned the classification [math]\displaystyle{ \Pi^0_{n+1} }[/math].

References

• Mansfield, Richard; Weitkamp, Galen (1985). Recursive Aspects of Descriptive Set Theory. Oxford University Press. pp. 124–38. ISBN 978-0-19-503602-2. https://archive.org/details/recursiveaspects0000mans/page/124. 
• Moschovakis, Yiannis N. (1980). Descriptive Set Theory. North Holland. ISBN 0-444-70199-0. https://archive.org/details/descriptivesetth0000mosc.  Second edition available online

0.00 (0 votes) Original source: https://en.wikipedia.org/wiki/Effective descriptive set theory. Read more