Steve Jackson (mathematician)

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.

  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, vol. 4, Cambridge: Cambridge University Press, pp. 248–280, ISBN 978-1-107-18299-8