Effective descriptive set theory
   HOME

TheInfoList



OR:

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 A parameter (), generally, is any characteristic that can help in defining or classifying a particular system (meaning an event, project, object, situation, etc.). That is, a parameter is an element of a system that is useful, or critical, when ...
(Moschovakis 1980). Thus effective descriptive set theory combines descriptive set theory with
recursion theory Computability theory, also known as recursion theory, is a branch of mathematical logic, computer science, and the theory of computation that originated in the 1930s with the study of computable functions and Turing degrees. The field has sinc ...
.


Constructions


Effective Polish space

An effective Polish space is a complete separable
metric space In mathematics, a metric space is a set together with a notion of '' distance'' between its elements, usually called points. The distance is measured by a function called a metric or distance function. Metric spaces are the most general set ...
that has a computable presentation. Such spaces are studied in both effective descriptive set theory and in
constructive analysis In mathematics, constructive analysis is mathematical analysis done according to some principles of constructive mathematics. This contrasts with ''classical analysis'', which (in this context) simply means analysis done according to the (more com ...
. In particular, standard examples of Polish spaces such as the real line, the Cantor set and the
Baire space In mathematics, a topological space X is said to be a Baire space if countable unions of closed sets with empty interior also have empty interior. According to the Baire category theorem, compact Hausdorff spaces and complete metric spaces are e ...
are all effective Polish spaces.


Arithmetical hierarchy

The
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 th ...
, arithmetic hierarchy or
Kleene Stephen Cole Kleene ( ; January 5, 1909 – January 25, 1994) was an American mathematician. One of the students of Alonzo Church, Kleene, along with Rózsa Péter, Alan Turing, Emil Post, and others, is best known as a founder of the branch of ...
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 In first-order logic, a first-order theory is given by a set of axioms in some language. This entry lists some of the more common examples used in model theory and some of their properties. Preliminaries For every natural mathematical structure ...
. The classifications are denoted \Sigma^0_n and \Pi^0_n 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 \phi is
logically equivalent Logic is the study of correct reasoning. It includes both formal and informal logic. Formal logic is the science of deductively valid inferences or of logical truths. It is a formal science investigating how conclusions follow from premise ...
to a formula with only
bounded quantifier In the study of formal theories in mathematical logic, bounded quantifiers (a.k.a. restricted quantifiers) are often included in a formal language in addition to the standard quantifiers "∀" and "∃". Bounded quantifiers differ from "∀" and " ...
s then \phi is assigned the classifications \Sigma^0_0 and \Pi^0_0. The classifications \Sigma^0_n and \Pi^0_n are defined inductively for every natural number ''n'' using the following rules: *If \phi is logically equivalent to a formula of the form \exists n_1 \exists n_2\cdots \exists n_k \psi, where \psi is \Pi^0_n, then \phi is assigned the classification \Sigma^0_. *If \phi is logically equivalent to a formula of the form \forall n_1 \forall n_2\cdots \forall n_k \psi, where \psi is \Sigma^0_n, then \phi is assigned the classification \Pi^0_.


References

* *
Second edition available online
{{settheory-stub, date=November 2005