In descriptive set theory , a lightface analytic game is a Determinacy Games game whose Determinacy Games payoff set A is a math Sigma 1 1 math subset of Baire space set theory Baire space that is, there is a Tree descriptive set theory tree T on math omega times omega math which is a computable subset of math omega times omega omega math , such that A is the projection of the set of all branches of T . The determinacy of all lightface analytic games is equivalent to the existence of Zero sharp 0 sup sup . Category Effective descriptive set theory Category Determinacy mathlogic stub ... more details
union of Wadge degree s. Lightface pointclasses The Borel and projective hierarchies have analogs ... 1 math sets, with a lightface math Sigma math , are no longer arbitrary unions of such neighborhoods ... &omega sup &omega sup x s for s in S . A set is lightface math Pi 0 1 math if it is the complement ... function enumerating the basic open sets in the complement of B . A set A is lightface math ... . This relationship between lightface sets and their indices is used to extend the lightface Borel ... , which is the lightface analog of the Borel hierarchy. The finite levels of the Hyperarithmetical ... be applied to the projective hierarchy. Its lightface analog is known as the analytical hierarchy ... more details
Effective descriptive set theory is the branch of descriptive set theory dealing with Set mathematics sets of real number reals having lightface definitions that is, definitions that do not require an arbitrary real parameter . Thus effective descriptive set theory combines descriptive set theory with recursion theory . References cite book authorlink Yiannis N. Moschovakis author Moschovakis, Yiannis N. title Descriptive Set Theory publisher North Holland year 1980 isbn 0 444 70199 0 http www.math.ucla.edu ynm books.htm Second edition available online Category Effective descriptive set theory settheory stub ... more details
G sub &delta sub sets . Lightface hierarchy The lightface Borel hierarchy is an effective version of the boldface ... . The lightface Borel hierarchy extends the arithmetical hierarchy of subsets of an effective Polish space . It is closely related to the hyperarithmetical hierarchy . The lightface Borel hierarchy ... of a program enumerating the codes of the sequence math A i math . A code for a lightface Borel set ... hierarchy, where no such effectivity is required. Each lightface Borel set has infinitely .... A famous theorem due to Spector and Kleene states that a set is in the lightface Borel hierarchy if and only ... hyperarithmetic . The code for a lightface Borel set A can be used to inductively define a tree ... way, and the tree has no infinite paths, then the code at the root of the tree is a code for a lightface ... CK 1 math . This is the origin of the Church Kleene ordinal in the definition of the lightface hierarchy ... more details
Infobox scientist image Yiannis Moschovakis.jpg image size 150px name Yiannis N. Moschovakis birth date birth date and age 1938 1 18 birth place Athens , Greece death date death place residence citizenship nationality ethnicity field Mathematics work institutions University of California, Los Angeles UCLA alma mater University of Wisconsin Madison doctoral advisor Stephen Kleene doctoral students Howard Becker br Diana Dubrovsky br Benedict Freedman br Carl Gordon br Gregory Jones br Alexander S. Kechris br Lefteris Kirousis br Phokion Kolaitis br Thomas Mc Cutcheon br Monica McArthur br Gregory McColm br Lawrence Moss br David Shochat br Perry Smith br Katherine St. John br Peter Tripodes br Glen Whitney known for Effective descriptive set theory author abbrev bot author abbrev zoo prizes religion signature footnotes Yiannis Nicholas Moschovakis lang el born January 18, 1938 in Athens , Greece is a Set theory set theorist , Descriptive set theory descriptive set theorist , and recursion theory recursion computability theorist , at UCLA . For many years he has split his time between UCLA and University of Athens he retired from the latter in July, 2005 . His book Descriptive Set Theory North Holland is the primary reference for the subject. He is especially associated with the development of the Effective descriptive set theory effective , or lightface pointclass lightface , version of descriptive set theory. Moschovakis earned his Ph.D. from University of Wisconsin Madison in 1963 under the direction of Stephen Kleene , with a dissertation entitled Recursive Analysis . External links http www.math.ucla.edu ynm Home page MathGenealogy id 8414 Persondata Metadata see Wikipedia Persondata . NAME Moschovakis, Yiannis N. ALTERNATIVE NAMES SHORT DESCRIPTION DATE OF BIRTH 18 January 1938 PLACE OF BIRTH Athens , Greece DATE OF DEATH PLACE OF DEATH DEFAULTSORT Moschovakis, Yiannis N. Category Living people Category 20th century mathematicians Category 21s ... more details
DISPLAYTITLE &Pi sup 0 sup sub style margin left 0.5em 1 sub class In computability theory , a sup 0 sup sub style margin left 0.5em 1 sub class is a subset of 2 sup sup of a certain form. These classes are of interest as a technical tool within recursion theory and effective descriptive set theory . They are also used in the application of recursion theory to other branches of mathematics Cenzer 1999, p. 39 . Definition The set 2 sup sup consists of all finite sequences of 0s and 1s, while the set 2 sup sup consists of all infinite sequences of 0s and 1s that is, functions from nowrap 1 &omega 0, 1, 2, ... to the set nowrap 1 0,1 . A tree set theory tree on 2 sup sup is a subset of 2 sup sup that is closed under taking initial segments. An element f of 2 sup &omega sup is a path through a tree T on 2 sup &omega sup if every finite initial segment of f is in T . A lightface sup 0 sup sub style margin left 0.5em 1 sub class is a subset C of 2 sup &omega sup for which there is a computable set computable tree T such that C consists of exactly the paths through T . A boldface &Pi sup 0 sup sub style margin left 0.5em 1 sub class is a subset D of 2 sup &omega sup for which there is an oracle f in 2 sup &omega sup and a subtree tree T of 2 sup &omega sup from computable from f such that D is the set of paths through T . As effectively closed sets The boldface sup 0 sup sub style margin left 0.5em 1 sub classes are exactly the same as the closed sets of 2 sup sup and thus the same as the boldface sup 0 sup sub style margin left 0.5em 1 sub subsets of 2 sup sup in the Borel hierarchy . Lightface sup 0 sup sub style margin left 0.5em 1 sub classes in 2 sup sup that is, sup 0 sup sub style margin left 0.5em 1 sub classes whose tree is computable with no oracle correspond to effectively closed sets . A subset B of 2 sup &omega sup is effectively closed if there is a recursively enumerable sequence &lang &sigma sub i sub i &isin &omega &rang of ... more details
Sidney Clyde Gaunt c. 1874 1932 was an United States American typographer , and artist. Prolific producer of type designs while shop artist for Barnhart Brothers & Spindler Barnhart Brothers & Spindler Type Foundry . Had own studio in New York City in early 1920s. Typefaces Authors Roman Authors Roman series Barnhart Brothers & Spindler BB&S later American Type Founders ATF Authors Roman Wide Italic 1902 Authors Roman Bold 1909 Authors Oldstyle Italic Bold 1912 Authors Roman Condensed 1915 Authors Roman Bold Condensed 1916 Talisman typeface Talisman 1903, Barnhart Brothers & Spindler BB&S , later reissued as Rugged Bold . Talisman Italic 1904, Barnhart Brothers & Spindler BB&S , later reissued as Rugged Bold Italic . Wedding Plate Script 1904, Barnhart Brothers & Spindler BB&S later American Type Founders ATF Stationers Semi Script 1904, Barnhart Brothers & Spindler BB&S later American Type Founders ATF , a redsign of Inland Type Foundry Inland Type Foundry s Palmer Series of 1899. French Plate Script 1904, Barnhart Brothers & Spindler BB&S later American Type Founders ATF , based on types cut by Fonderie Gustave Mayeur of Paris Mission typeface Mission 1904, Barnhart Brothers & Spindler BB&S later American Type Founders ATF , designed by Gaunt but patented by George Oswald Ottley . Barnhart Oldstyle Barnhart Oldstyle series Barnhart Oldstyle 1906, Barnhart Brothers & Spindler BB&S later American Type Founders ATF Barnhart Oldstyle Italic Oldstyle No. 2 1907, Barnhart Brothers & Spindler BB&S later American Type Founders ATF Barnhart Lightface 1914, Barnhart Brothers & Spindler BB&S Adstyle Adstyle series Barnhart Brothers & Spindler BB&S later American Type Founders ATF Adstyle 1906 Adstyle Black 1907 11 Adstyle Condensed 1907 11 Adstyle Extra Condensed 1907 11 Adstyle Headletter 1907 11 Adstyle Italic 1907 11 Adstyle Wide 1907 11 Adstyle Black Outline 1910 Adstyle Lightface 1911 Adstyle Shaded 1914 Old Roman type face Old Roman series Barnhart Brothers & Spindler ... more details
of 0 sup sup is equivalent to the determinacy of lightface analytic game s. In fact, the strategy for a universal lightface analytic game has the same Turing degree as 0 sup sup . It follows ... more details
Portal box Logic Set theory This page is a list of articles related to set theory . Articles on individual set theory topics The purpose of the invisible non clickable links to Talk pages is to make edits to those pages appear when you click on related changes on this page. Please add those when you add new items to this page. columns list 4 Algebra of sets Talk Algebra of sets Axiom of choice Talk Axiom of choice Axiom of countable choice Talk Axiom of countable choice Axiom of dependent choice Talk Axiom of dependent choice Zorn s lemma Talk Zorn s lemma Boolean valued model Talk Boolean valued model Burali Forti paradox Talk Burali Forti paradox Cantor s back and forth method Talk Cantor s back and forth method Cantor s diagonal argument Talk Cantor s diagonal argument Cantor s first uncountability proof Talk Cantor s first uncountability proof Cantor s paradox Talk Cantor s paradox Cantor s theorem Talk Cantor s theorem Cantor Bernstein Schroeder theorem Talk Cantor Bernstein Schroeder theorem Cardinal number Talk Cardinal number Aleph number Talk Aleph number Beth number Talk Beth number Hartogs number Talk Hartogs number Cardinality Talk Cardinality Cartesian product Talk Cartesian product Class set theory Talk Class set theory Complement set theory Talk Complement set theory Complete Boolean algebra Talk Complete Boolean algebra Continuum set theory Talk Continuum set theory Suslin s problem Talk Suslin s problem Continuum hypothesis Talk Continuum hypothesis Countable set Talk Countable set Descriptive set theory Talk Descriptive set theory Analytic set Talk Analytic set Analytical hierarchy Talk Analytical hierarchy Borel equivalence relation Talk Borel equivalence relation Infinity Borel set Talk Infinity Borel set Lightface analytic game Talk Lightface analytic game Perfect set property Talk Perfect set property Polish space Talk Polish space Prewellordering Talk Prewellordering Projective set Talk Projective set Property of Baire Talk Property of Baire U ... more details
wiktionary analytic seealso Analysis TOCRight Generally speaking, analytic from Greek language Greek analytikos refers to the having the ability to analyze or division into elements or principles. It can also have the following meanings Natural sciences In chemistry Analytical chemistry , the analysis of material samples to learn their chemical composition and structure Analytical technique Analytical concentration In mathematics Abstract analytic number theory , the application of ideas and techniques from analytic number theory to other mathematical fields Analytic capacity , a number that denotes how big a certain bounded analytic function can become Analytic combinatorics , a branch of combinatorics that describes combinatorial classes using generating functions Analytic continuation , a technique to extend the domain of definition of a given analytic function Analytical expression , a mathematical expression using well known operations that lend themselves readily to calculation Analytic function , a function that is locally given by a convergent power series Analytic geometry , the study of geometry using the principles of algebra Analytic number theory , a branch of number theory that uses methods from mathematical analysis Analytic solution a solution to a problem that can be written in closed form in terms of known functions, constants, etc. ref Weisstein, Eric W. Analytic. From MathWorld A Wolfram Web Resource. http mathworld.wolfram.com Analytic.html ref Analytic variety , the set of common solutions of several equations involving analytic functions In set theory Analytical hierarchy Analytic set Lightface analytic game In proof theory Analytic proof , in structural proof theory, a proof whose structure is simple in a special way Method of analytic tableaux , a fundamental concept in automated theorem proving Other mathematical areas Analytic element method , a numerical method used to solve partial differential equations Analytic manifold , a ... more details
be categorized as follows 1 lightface and boldface type to indicate when an English word is inserted ... letters indicate the words actually found in the Hebrew text, and lightface type indicate English ... more details
about the classification of sets making complex decisions Analytic Hierarchy Process In mathematical logic and descriptive set theory , the analytical hierarchy is a higher type analogue of the arithmetical hierarchy . It thus continues the classification of sets by the formulas that define them. 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 ... more details
Encyclopedia
top
