I'm Noah Schweber, a fifth-year graduate student at UC-Berkeley.
My research is in mathematical logic, specifically computability
theory - including reverse mathematics and computable structure
theory - and set theory. I am especially interested in applications
of forcing and inner model theory to computability theory. I am also
interested in abstract model theory, and other areas of logic and
mathematics.
Here are my research
statement, CV, and
teaching statement.
My email is schweber@berkeley.edu; my office is Evans 1064.
With Julia Knight, Antonio Montalban, and Tom Scanlon, I helped to
organize a conference
on Vaught's Conjecture, which ran from the morning of Monday,
June 1 to noon on Friday, June 5, 2015, at the University of
California - Berkeley.
Publications:
- The complexity of Banach-Mazur games, in preparation.
- Higher reverse mathematics and choice principles, in
preparation.
- Limit
computability and ultrafilters, with Uri Andrews,
Mingzhong Cai, and David Diamondstone. Submitted.
- Computing
strength of structures related to the field of real numbers,
with Greg Igusa and Julia Knight. Submitted.
- Transfinite
recursion in higher reverse mathematics. To appear
in the Journal of Symbolic Logic.
- Computable
structures in generic extensions, with Julia Knight
and Antonio Montalban. To appear in the Journal of Symbolic
Logic.
- Computably
enumerable partial orderings. With Peter Cholak,
Damir Dzhafarov, and Richard Shore. In: Computability, 1
(2012)
Invited talks:
- TBA, at New Challenges in Reverse Mathematics,
January 2016 (National University of Singapore)
- Computability theory and uncountable structures, at
Sets and Computations, April 2015 (National University of
Singapore)
- Structures and computability in generic extensions, at
SEALS 2015 (University of Florida - Gainesville)
- Computability and structures in generic extensions, at
the Canadian Mathematical Society meeting 2015
Contributed talks:
Expository papers:
I'll replace this webpage with a better one when I have the time.
***********