Computably Enumerable Partial Orders. - Peter Cholak; Damir D. Dzhafarov; Noah David Schweber; Richard A. Shore (Comput., 2012)

Transfinite Recursion in Higher Reverse Mathematics. - Noah David Schweber (J. Symb. Log., 2015)

Computable Structures in Generic Extensions. - Julia F. Knight; Antonio Montalbán; Noah David Schweber (J. Symb. Log., 2016)

Computing strength of Structures Related to the field of Real numbers. - Gregory Igusa; Julia F. Knight; Noah David Schweber (J. Symb. Log., 2017)

Effective localization number: Building k-surviving degrees. - Iván Ongay-Valverde; Noah David Schweber (Comput., 2019)

The theory of ceers computes true arithmetic. - Uri Andrews; Noah Schweber; Andrea Sorbi (Ann. Pure Appl. Log., 2020)

Self-full ceers and the uniform join operator. - Uri Andrews; Noah Schweber; Andrea Sorbi (J. Log. Comput., 2020)

The property "arithmetic-is-recursive" on a cone. - Uri Andrews; Matthew Harrison-Trainor; Noah Schweber (J. Math. Log., 2021)

Computability and the Symmetric Difference Operator. - Uri Andrews; Peter M. Gerdes; Steffen Lempp; Joseph S. Miller; Noah David Schweber (Log. J. IGPL, 2022)

The first-order theory of the computably enumerable equivalence relations in the uncountable setting. - Uri Andrews; Steffen Lempp; Manat Mustafa; Noah David Schweber (J. Log. Comput., 2022)

Limit computability and ultrafilters. - Uri Andrews; Mingzhong Cai; David Diamondstone; Noah Schweber (Comput., 2023)

Avoiding Medvedev reductions inside a linear order. - Noah Schweber (Math. Log. Q., 2023)

Strong reducibilities and set theory. - Noah Schweber (Ann. Pure Appl. Log., 2025)