Publication | Date of Publication | Type |
---|
ASYMMETRIC CUT AND CHOOSE GAMES | 2024-02-23 | Paper |
Generalized Polish spaces at regular uncountable cardinals | 2023-12-19 | Paper |
Between Ramsey and measurable cardinals | 2023-11-20 | Paper |
Forcing axioms via ground model interpretations | 2023-04-27 | Paper |
Uniformization and internal absoluteness | 2023-04-27 | Paper |
Continuous images of closed sets in generalized Baire spaces | 2023-02-02 | Paper |
The open dihypergraph dichotomy for generalized Baire spaces and its applications | 2023-01-30 | Paper |
Forcing over choiceless models and generic absoluteness | 2022-12-29 | Paper |
Lebesgue's density theorem and definable selectors for ideals | 2022-08-15 | Paper |
Countable ranks at the first and second projective levels | 2022-07-18 | Paper |
Decision times of infinite computations | 2022-07-13 | Paper |
Coarse groups, and the isomorphism problem for oligomorphic groups | 2022-06-17 | Paper |
Ideal topologies in higher descriptive set theory | 2022-03-03 | Paper |
How to have more things by forgetting how to count them | 2021-10-29 | Paper |
Forcing axioms via ground model interpretations | 2021-10-22 | Paper |
Uniformization and Internal Absoluteness | 2021-08-22 | Paper |
Preserving levels of projective determinacy by tree forcings | 2021-03-25 | Paper |
Long games and \(\sigma \)-projective sets | 2021-03-25 | Paper |
THE EXACT STRENGTH OF THE CLASS FORCING THEOREM | 2021-03-19 | Paper |
Decision times of infinite computations | 2020-11-10 | Paper |
Descriptive properties of higher Kurepa trees | 2020-10-22 | Paper |
Ordered semiautomatic rings with applications to geometry | 2020-07-27 | Paper |
https://portal.mardi4nfdi.de/entity/Q5109524 | 2020-05-12 | Paper |
Measurable cardinals and good ‐wellorderings | 2020-05-11 | Paper |
The isomorphism problem for tree-automatic ordinals with addition | 2019-09-20 | Paper |
Sufficient conditions for the forcing theorem, and turning proper classes into sets | 2019-05-13 | Paper |
Borel subsets of the real line and continuous reducibility | 2019-02-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4645642 | 2019-01-10 | Paper |
Lebesgue's Density Theorem and definable selectors for ideals | 2018-11-15 | Paper |
RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY | 2018-08-10 | Paper |
A hierarchy of Ramsey-like cardinals | 2018-06-07 | Paper |
Characterizations of pretameness and the Ord-cc | 2018-06-05 | Paper |
Continuous reducibility and dimension of metric spaces | 2018-04-17 | Paper |
Reachability for infinite time Turing machines with long tapes | 2018-02-15 | Paper |
Recognizable sets and Woodin cardinals: computation beyond the constructible universe | 2018-02-06 | Paper |
PERFECT SUBSETS OF GENERALIZED BAIRE SPACES AND LONG GAMES | 2018-01-11 | Paper |
Choiceless Ramsey theory of linear orders | 2017-12-21 | Paper |
Canonical Truth | 2017-12-07 | Paper |
Σ1(κ)-DEFINABLE SUBSETS OF H(κ+) | 2017-09-26 | Paper |
The recognizability strength of infinite time Turing machines with ordinal parameters | 2017-08-04 | Paper |
Infinite computations with random oracles | 2017-07-21 | Paper |
Pumping for ordinal-automatic structures1 | 2017-07-21 | Paper |
CLASS FORCING, THE FORCING THEOREM AND BOOLEAN COMPLETIONS | 2017-04-28 | Paper |
Measurable cardinals and good $\Sigma_1(\kappa)$-wellorderings | 2017-04-03 | Paper |
Continuous reducibility and dimension of metric spaces | 2017-03-29 | Paper |
The Hurewicz dichotomy for generalized Baire spaces | 2017-01-11 | Paper |
Randomness via infinite computation and effective descriptive set theory | 2016-12-09 | Paper |
Wadge-like reducibilities on arbitrary quasi-Polish spaces | 2016-07-27 | Paper |
Tree-automatic scattered linear orders | 2016-03-31 | Paper |
Generalized Choquet spaces | 2016-02-24 | Paper |
Continuous images of closed sets in generalized Baire spaces | 2015-11-16 | Paper |
Lipschitz and uniformly continuous reducibilities on ultrametric Polish spaces | 2015-04-09 | Paper |
Thin equivalence relations and inner models | 2014-07-07 | Paper |
Structures without Scattered-Automatic Presentation | 2013-08-05 | Paper |
A minimal Prikry-type forcing for singularizing a measurable cardinal | 2013-04-23 | Paper |
Automata on ordinals and automaticity of linear orders | 2013-04-05 | Paper |
Tree Representations via Ordinal Machines | 2013-01-30 | Paper |
The Mate-in-n Problem of Infinite Chess Is Decidable | 2012-08-14 | Paper |
Thin equivalence relations in scaled pointclasses | 2011-12-23 | Paper |
Non-isomorphism invariant Borel quantifiers | 2011-12-13 | Paper |
Automata on Ordinals and Linear Orders | 2011-09-09 | Paper |
Non-permutation invariant Borel quantifiers | 2010-03-12 | Paper |
https://portal.mardi4nfdi.de/entity/Q3606112 | 2009-02-26 | Paper |