Effective descriptive set theory is the branch of
descriptive set theory
In mathematical logic, descriptive set theory (DST) is the study of certain classes of "well-behaved" set (mathematics), subsets of the real line and other Polish spaces. As well as being one of the primary areas of research in set theory, it has a ...
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 since ex ...
.
Constructions
Effective Polish space
An effective Polish space is a
complete separable metric space
In mathematics, a metric space is a Set (mathematics), set together with a notion of ''distance'' between its Element (mathematics), elements, usually called point (geometry), points. The distance is measured by a function (mathematics), functi ...
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
A number line is a graphical representation of a straight line that serves as spatial representation of numbers, usually graduated like a ruler with a particular origin (geometry), origin point representing the number zero and evenly spaced mark ...
, the
Cantor set and the
Baire space 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 Mostowski (feminine: Mostowska, plural: Mostowscy) is a surname. It may refer to:
* Mostowski Palace (), an 18th-century palace in Warsaw
* Andrzej Mostowski (1913 - 1975), a Polish mathematician
** Mostowski collapse lemma, in mathematical logi ...
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
and
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
is
logically equivalent to a formula with only
bounded quantifiers then
is assigned the classifications
and
.
The classifications
and
are defined inductively for every natural number ''n'' using the following rules:
*If
is logically equivalent to a formula of the form
, where
is
, then
is assigned the classification
.
*If
is logically equivalent to a formula of the form
, where
is
, then
is assigned the classification
.
References
*
*
Second edition available online
{{settheory-stub, date=November 2005