Noah Schweber

Available identifiers

zbMath Open schweber.noah-davidMaRDI QIDQ2039551

List of research outcomes

Publication	Date of Publication	Type
Complexity profiles and generic Muchnik reducibility	2023-12-21	Paper
Avoiding Medvedev reductions inside a linear order	2023-09-15	Paper
Limit computability and ultrafilters	2023-09-13	Paper
Choiceless chain conditions	2022-11-11	Paper
Computability and the Symmetric Difference Operator	2022-07-22	Paper
The first-order theory of the computably enumerable equivalence relations in the uncountable setting	2022-02-08	Paper
The property “arithmetic-is-recursive” on a cone	2021-11-03	Paper
Self-full ceers and the uniform join operator	2021-10-21	Paper
Building models of strongly minimal theories	2021-07-05	Paper
Choiceless Chain Conditions	2021-06-07	Paper
The theory of ceers computes true arithmetic	2020-06-02	Paper
Effective localization number: Building k-surviving degrees	2020-01-17	Paper
COMPUTING STRENGTH OF STRUCTURES RELATED TO THE FIELD OF REAL NUMBERS	2017-06-01	Paper
COMPUTABLE STRUCTURES IN GENERIC EXTENSIONS	2017-04-28	Paper
TRANSFINITE RECURSION IN HIGHER REVERSE MATHEMATICS	2015-11-09	Paper
Computably Enumerable Partial Orders	2013-01-30	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Noah Schweber