Steve Jackson (mathematician)

Last updated

Steve Jackson (full name: Stephen Craig Jackson) is an American set theorist at the University of North Texas. [1] Much of his most notable work has involved the descriptive set-theoretic consequences of the axiom of determinacy. [2] In particular he is known for having calculated the values of all the projective ordinals (the suprema of the lengths of all prewellorderings of the real numbers at a particular level in the projective hierarchy) under the assumption that the axiom of determinacy holds.

In recent years he has also made contributions to the theory of Borel equivalence relations. With Dan Mauldin he solved the Steinhaus lattice problem. [3] [4]

Jackson earned his PhD in 1983 at UCLA under the direction of Donald A. Martin, with a dissertation on A Calculation ofδ15. In it, he proved that, under the axiom of determinacy,

thereby solving the first Victoria Delfino problem, [5] one of the notorious problems of the combinatorics of the axiom of determinacy.

Related Research Articles

Mathematical logic is the study of formal logic within mathematics. Major subareas include model theory, proof theory, set theory, and recursion 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.

Paul Joseph Cohen was an American mathematician. He is best known for his proofs that the continuum hypothesis and the axiom of choice are independent from Zermelo–Fraenkel set theory, for which he was awarded a Fields Medal.

<span class="mw-page-title-main">Kőnig's lemma</span> Mathematical result on infinite trees

Kőnig's lemma or Kőnig's infinity lemma is a theorem in graph theory due to the Hungarian mathematician Dénes Kőnig who published it in 1927. It gives a sufficient condition for an infinite graph to have an infinitely long path. The computability aspects of this theorem have been thoroughly investigated by researchers in mathematical logic, especially in computability theory. This theorem also has important roles in constructive mathematics and proof theory.

In the mathematical discipline of set theory, 0# is the set of true formulae about indiscernibles and order-indiscernibles in the Gödel constructible universe. It is often encoded as a subset of the natural numbers, or as a subset of the hereditarily finite sets, or as a real number. Its existence is unprovable in ZFC, the standard form of axiomatic set theory, but follows from a suitable large cardinal axiom. It was first introduced as a set of formulae in Silver's 1966 thesis, later published as Silver (1971), where it was denoted by Σ, and rediscovered by Solovay, who considered it as a subset of the natural numbers and introduced the notation O#.

Reverse mathematics is a program in mathematical logic that seeks to determine which axioms are required to prove theorems of mathematics. Its defining method can briefly be described as "going backwards from the theorems to the axioms", in contrast to the ordinary mathematical practice of deriving theorems from axioms. It can be conceptualized as sculpting out necessary conditions from sufficient ones.

In mathematical logic, descriptive set theory (DST) is the study of certain classes of "well-behaved" 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 applications to other areas of mathematics such as functional analysis, ergodic theory, the study of operator algebras and group actions, and mathematical logic.

An infinitary logic is a logic that allows infinitely long statements and/or infinitely long proofs. The concept was introduced by Zermelo in the 1930s.

In mathematics, the axiom of determinacy is a possible axiom for set theory introduced by Jan Mycielski and Hugo Steinhaus in 1962. It refers to certain two-person topological games of length ω. AD states that every game of a certain type is determined; that is, one of the two players has a winning strategy.

In mathematical logic, projective determinacy is the special case of the axiom of determinacy applying only to projective sets.

<span class="mw-page-title-main">W. Hugh Woodin</span> American mathematician

William Hugh Woodin is an American mathematician and set theorist at Harvard University. He has made many notable contributions to the theory of inner models and determinacy. A type of large cardinals, the Woodin cardinals, bear his name. In 2023, he was elected to the National Academy of Sciences.

Determinacy is a subfield of set theory, a branch of mathematics, that examines the conditions under which one or the other player of a game has a winning strategy, and the consequences of the existence of such strategies. Alternatively and similarly, "determinacy" is the property of a game whereby such a strategy exists. Determinacy was introduced by Gale and Stewart in 1950, under the name "determinateness".

In mathematical logic, two theories are equiconsistent if the consistency of one theory implies the consistency of the other theory, and vice versa. In this case, they are, roughly speaking, "as consistent as each other".

In mathematical logic, second-order arithmetic is a collection of axiomatic systems that formalize the natural numbers and their subsets. It is an alternative to axiomatic set theory as a foundation for much, but not all, of mathematics.

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.

In the mathematical field of set theory, the proper forcing axiom (PFA) is a significant strengthening of Martin's axiom, where forcings with the countable chain condition (ccc) are replaced by proper forcings.

<span class="mw-page-title-main">Menachem Magidor</span> Israeli mathematician

Menachem Magidor is an Israeli mathematician who specializes in mathematical logic, in particular set theory. He served as president of the Hebrew University of Jerusalem, was president of the Association for Symbolic Logic from 1996 to 1998 and as president of the Division for Logic, Methodology and Philosophy of Science and Technology of the International Union for History and Philosophy of Science (DLMPST/IUHPS) from 2016 to 2019. In 2016 he was elected an honorary foreign member of the American Academy of Arts and Sciences. In 2018 he received the Solomon Bublick Award.

Itay Neeman is a set theorist working as a professor of mathematics at the University of California, Los Angeles. He has made major contributions to the theory of inner models, determinacy and forcing.

References

  1. "Stephen Jackson – UNT Faculty Profile". facultyinfo.unt.edu. Retrieved 2022-10-02.
  2. Jackson, Stephen Craig. "Faculty Profile CV". facultyinfo.unt.edu. Retrieved 2022-10-02.
  3. Jackson, Steve; Mauldin, R. (2002). "On a lattice problem of H. Steinhaus". Journal of the American Mathematical Society. 15 (4): 817–856. doi: 10.1090/S0894-0347-02-00400-9 . ISSN   0894-0347.
  4. Jackson, Steve; Mauldin, R. Daniel (2003). "Survey of the Steinhaus Tiling Problem" . Bulletin of Symbolic Logic. 9 (3): 335–361. doi:10.2178/bsl/1058448676. ISSN   1079-8986.
  5. Caicedo, Andrés Eduardo; Löw, Benedikt (2020), Kechris, Alexander S.; Löwe, Benedikt; Steel, John R. (eds.), "The fourteen Victoria Delfino problems and their status in the year 2020", Large Cardinals, Determinacy and Other Topics: The Cabal Seminar, Volume IV, Lecture Notes in Logic, Cambridge: Cambridge University Press, vol. 4, pp. 248–280, ISBN   978-1-107-18299-8