|
Borel Hierarchy
In mathematical logic, the Borel hierarchy is a stratification of the Borel algebra generated by the open subsets of a Polish space; elements of this algebra are called Borel sets. Each Borel set is assigned a unique countable ordinal number called the rank of the Borel set. The Borel hierarchy is of particular interest in descriptive set theory. One common use of the Borel hierarchy is to prove facts about the Borel sets using transfinite induction on rank. Properties of sets of small finite ranks are important in measure theory and analysis. Borel sets The Borel algebra in an arbitrary topological space is the smallest collection of subsets of the space that contains the open sets and is closed under countable unions and complementation. It can be shown that the Borel algebra is closed under countable intersections as well. A short proof that the Borel algebra is well-defined proceeds by showing that the entire powerset of the space is closed under complements and co ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematical Logic
Mathematical logic is the study of Logic#Formal logic, formal logic within mathematics. Major subareas include model theory, proof theory, set theory, and recursion theory (also known as computability theory). Research in mathematical logic commonly addresses the mathematical properties of formal systems of logic such as their expressive or deductive power. However, it can also include uses of logic to characterize correct mathematical reasoning or to establish foundations of mathematics. Since its inception, mathematical logic has both contributed to and been motivated by the study of foundations of mathematics. This study began in the late 19th century with the development of axiomatic frameworks for geometry, arithmetic, and Mathematical analysis, analysis. In the early 20th century it was shaped by David Hilbert's Hilbert's program, program to prove the consistency of foundational theories. Results of Kurt Gödel, Gerhard Gentzen, and others provided partial resolution to th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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 them. Any set that receives a classification is called arithmetical. The arithmetical hierarchy was invented independently by Kleene (1943) and Mostowski (1946).P. G. Hinman, ''Recursion-Theoretic Hierarchies'' (p.89), Perspectives in Logic, 1978. Springer-Verlag Berlin Heidelberg, ISBN 3-540-07904-1. The arithmetical hierarchy is important in computability theory, effective descriptive set theory, and the study of formal theories such as Peano arithmetic. The Tarski–Kuratowski algorithm provides an easy way to get an upper bound on the classifications assigned to a formula and the set it defines. The hyperarithmetical hierarchy and the analytical hierarchy extend the arithmetical hierarchy to classify additional formulas and set ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Thomas Jech
Thomas J. Jech (, ; born 29 January 1944 in Prague) is a mathematician specializing in set theory who was at Penn State for more than 25 years. Life He was educated at Charles University (his advisor was Petr Vopěnka) and from 2000 is at thInstitute of Mathematicsof the Academy of Sciences of the Czech Republic. Work Jech's research also includes mathematical logic, algebra, analysis, topology, and measure theory. Jech gave the first published proof of the consistency of the existence of a Suslin line. With Karel Prikry, he introduced the notion of precipitous ideal. He gave several models where the axiom of choice failed, for example one with ω1 measurable. The concept of a Jech–Kunen tree is named after him and Kenneth Kunen Herbert Kenneth Kunen (August 2, 1943August 14, 2020) was a professor of mathematics at the University of Wisconsin–Madison who worked in set theory and its applications to various areas of mathematics, such as set-theoretic topology a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Alexander S
Alexander () is a male name of Greek origin. The most prominent bearer of the name is Alexander the Great, the king of the Ancient Greek kingdom of Macedonia who created one of the largest empires in ancient history. Variants listed here are Aleksandar, Aleksander, Oleksandr, Oleksander, Aleksandr, and Alekzandr. Related names and diminutives include Iskandar, Alec, Alek, Alex, Alexsander, Alexandre, Aleks, Aleksa, Aleksandre, Alejandro, Alessandro, Alasdair, Sasha, Sandy, Sandro, Sikandar, Skander, Sander and Xander; feminine forms include Alexandra, Alexandria, and Sasha. Etymology The name ''Alexander'' originates from the (; 'defending men' or 'protector of men'). It is a compound of the verb (; 'to ward off, avert, defend') and the noun (, genitive: , ; meaning 'man'). The earliest attested form of the name, is the Mycenaean Greek feminine anthroponym , , (/Alexandra/), written in the Linear B syllabic script. Alaksandu, alternatively called ''Alakasandu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Large Countable Ordinal
In the mathematical discipline of set theory, there are many ways of describing specific countable ordinals. The smallest ones can be usefully and non-circularly expressed in terms of their Cantor normal forms. Beyond that, many ordinals of relevance to proof theory still have computable ordinal notations (see ordinal analysis). However, it is not possible to decide effectively whether a given putative ordinal notation is a notation or not (for reasons somewhat analogous to the unsolvability of the halting problem); various more-concrete ways of defining ordinals that definitely have notations are available. Since there are only countably many notations, all ordinals with notations are exhausted well below the first uncountable ordinal ω1; their supremum is called ''Church–Kleene'' ω1 or ω (not to be confused with the first uncountable ordinal, ω1), described below. Ordinal numbers below ω are the ''recursive'' ordinals (see below). Countable ordinals larger than this m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Wadge Hierarchy
In descriptive set theory, within mathematics, Wadge degrees are levels of complexity for sets of reals. Sets are compared by continuous reductions. The Wadge hierarchy is the structure of Wadge degrees. These concepts are named after William W. Wadge. Wadge degrees Suppose A and B are subsets of Baire space ωω. Then A is Wadge reducible to B or A ≤W B if there is a continuous function f on ωω with A = f^ /math>. The Wadge order is the preorder or quasiorder on the subsets of Baire space. Equivalence classes of sets under this preorder are called Wadge degrees, the degree of a set A is denoted by A">math>Asub>W. The set of Wadge degrees ordered by the Wadge order is called the Wadge hierarchy. Properties of Wadge degrees include their consistency with measures of complexity stated in terms of definability. For example, if A ≤W B and B is a countable intersection of open sets, then so is A. The same works for all levels of the Borel hierarchy and the difference hier ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Projective Hierarchy
In the mathematical field of descriptive set theory, a subset A of a Polish space X is projective if it is \boldsymbol^1_n for some positive integer n. Here A is * \boldsymbol^1_1 if A is analytic * \boldsymbol^1_n if the complement of A, X\setminus A, is \boldsymbol^1_n * \boldsymbol^1_ if there is a Polish space Y and a \boldsymbol^1_n subset C\subseteq X\times Y such that A is the projection of C onto X; that is, A=\. The choice of the Polish space Y in the third clause above is not very important; it could be replaced in the definition by a fixed uncountable Polish space, say Baire space or Cantor space or the real line. Relationship to the analytical hierarchy There is a close relationship between the relativized analytical hierarchy on subsets of Baire space (denoted by lightface letters \Sigma and \Pi) and the projective hierarchy on subsets of Baire space (denoted by boldface letters \boldsymbol and \boldsymbol). Not every \boldsymbol^1_n subset of Baire space is \ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Kleene–Brouwer Order
In descriptive set theory, the Kleene–Brouwer order or Lusin–Sierpiński order is a linear order on finite sequences over some linearly ordered set (X, <), that differs from the more commonly used lexicographic order in how it handles the case when one sequence is a of the other. In the Kleene–Brouwer order, the prefix is later than the longer sequence containing it, rather than earlier. The Kleene–Brouwer order generalizes the notion of a postorder traversal from finite trees to trees that are not necessarily finite. For trees over a well-ordered set, the Kleene–Brouwer order is itself a well-ordering if and only if the tree has no infini ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Analytical Hierarchy
Analytic or analytical may refer to: Chemistry * Analytical chemistry, the analysis of material samples to learn their chemical composition and structure * Analytical technique, a method that is used to determine the concentration of a chemical compound or chemical element * Analytical concentration Mathematics * Abstract analytic number theory, the application of ideas and techniques from analytic number theory to other mathematical fields * Analytic combinatorics, a branch of combinatorics that describes combinatorial classes using generating functions * Analytic element method, a numerical method used to solve partial differential equations * Analytic expression or analytic solution, a mathematical expression using well-known operations that lend themselves readily to calculation * Analytic geometry, the study of geometry based on numerical coordinates rather than axioms * Analytic number theory, a branch of number theory that uses methods from mathematical analysis M ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computably Enumerable
In computability theory, a set ''S'' of natural numbers is called computably enumerable (c.e.), recursively enumerable (r.e.), semidecidable, partially decidable, listable, provable or Turing-recognizable if: *There is an algorithm such that the set of input numbers for which the algorithm halts is exactly ''S''. Or, equivalently, *There is an enumeration algorithm, algorithm that enumerates the members of ''S''. That means that its output is a list of all the members of ''S'': ''s''1, ''s''2, ''s''3, ... . If ''S'' is infinite, this algorithm will run forever, but each element of S will be returned after a finite amount of time. Note that these elements do not have to be listed in a particular way, say from smallest to largest. The first condition suggests why the term ''semidecidable'' is sometimes used. More precisely, if a number is in the set, one can ''decide'' this by running the algorithm, but if the number is not in the set, the algorithm can run forever, and no inf ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Recursive Ordinal
In mathematics, specifically computability and set theory, an ordinal \alpha is said to be computable or recursive if there is a computable well-ordering of a computable subset of the natural numbers having the order type \alpha. It is easy to check that \omega is computable. The successor of a computable ordinal is computable, and the set of all computable ordinals is closed downwards. The supremum of all computable ordinals is called the Church–Kleene ordinal, the first nonrecursive ordinal, and denoted by \omega_1^. The Church–Kleene ordinal is a limit ordinal. An ordinal is computable if and only if it is smaller than \omega_1^. Since there are only countably many computable relations, there are also only countably many computable ordinals. Thus, \omega_1^ is countable. The computable ordinals are exactly the ordinals that have an ordinal notation in Kleene's \mathcal. See also *Arithmetical hierarchy * Large countable ordinal *Ordinal analysis In proof theory, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hyperarithmetical Hierarchy
In computability theory, hyperarithmetic theory is a generalization of Turing computability. It has close connections with definability in second-order arithmetic and with weak systems of set theory such as Kripke–Platek set theory. It is an important tool in effective descriptive set theory. The central focus of hyperarithmetic theory is the sets of natural numbers known as hyperarithmetic sets. There are three equivalent ways of defining this class of sets; the study of the relationships between these different definitions is one motivation for the study of hyperarithmetical theory. Hyperarithmetical sets and definability The first definition of the hyperarithmetic sets uses the analytical hierarchy. A set of natural numbers is classified at level \Sigma^1_1 of this hierarchy if it is definable by a formula of second-order arithmetic with only existential set quantifiers and no other set quantifiers. A set is classified at level \Pi^1_1 of the analytical hierarchy if it ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
