Noah Schweber

MaRDI QIDQ2039551zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Countable and finitary reductions on equivalence relations Fundamenta Mathematicae	2025-10-08	Paper
Strong reducibilities and set theory Annals of Pure and Applied Logic	2024-12-12	Paper
Complexity profiles and generic Muchnik reducibility Advances in Mathematics	2023-12-21	Paper
Avoiding Medvedev reductions inside a linear order Mathematical Logic Quarterly	2023-09-15	Paper
Limit computability and ultrafilters Computability	2023-09-13	Paper
Choiceless chain conditions European Journal of Mathematics	2022-11-11	Paper
Computability and the symmetric difference operator Logic Journal of the IGPL	2022-07-22	Paper
The first-order theory of the computably enumerable equivalence relations in the uncountable setting Journal Of Logic And Computation	2022-02-08	Paper
The property ``arithmetic-is-recursive'' on a cone Journal of Mathematical Logic	2021-11-03	Paper
Self-full ceers and the uniform join operator Journal Of Logic And Computation	2021-10-21	Paper
Building models of strongly minimal theories Advances in Mathematics	2021-07-05	Paper
Choiceless Chain Conditions (available as arXiv preprint)	2021-06-07	Paper
The theory of ceers computes true arithmetic Annals of Pure and Applied Logic	2020-06-02	Paper
Effective localization number: Building k-surviving degrees Computability	2020-01-17	Paper
Computing strength of structures related to the field of real numbers Journal of Symbolic Logic	2017-06-01	Paper
Computable structures in generic extensions Journal of Symbolic Logic	2017-04-28	Paper
Transfinite recursion in higher reverse mathematics Journal of Symbolic Logic	2015-11-09	Paper
Computably enumerable partial orders Computability	2013-01-30	Paper

Research outcomes over time

This page was built for person: Noah Schweber