| Publication | Date of Publication | Type |
|---|
Monotone versus non-monotone projective operators
Bulletin of the London Mathematical Society | 2025-01-15 | Paper |
ASYMMETRIC CUT AND CHOOSE GAMES
The Bulletin of Symbolic Logic | 2024-02-23 | Paper |
When cardinals determine the power set: inner models and Härtig quantifier logic
Mathematical Logic Quarterly | 2024-01-02 | Paper |
Proving Theorems from Reflection
Synthese Library | 2023-09-20 | Paper |
| Countable ranks at the first and second projective levels | 2022-07-18 | Paper |
Decision times of infinite computations
Notre Dame Journal of Formal Logic | 2022-07-13 | Paper |
Closed and unbounded classes and the Härtig quantifier model
Journal of Symbolic Logic | 2022-06-15 | Paper |
STABLY MEASURABLE CARDINALS
Journal of Symbolic Logic | 2021-10-27 | Paper |
Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines
Computability | 2021-06-25 | Paper |
SOME OBSERVATIONS ON TRUTH HIERARCHIES: A CORRECTION
The Review of Symbolic Logic | 2021-05-11 | Paper |
Characterisations of Variant Transfinite Computational Models: Infinite Time Turing, Ordinal Time Turing, and Blum-Shub-Smale machines
arXiv preprint | 2020-12-14 | Paper |
Decision times of infinite computations
arXiv preprint | 2020-11-10 | Paper |
| Higher type recursion for transfinite machine theory | 2020-05-12 | Paper |
Games and Ramsey-like cardinals
Journal of Symbolic Logic | 2019-03-15 | Paper |
Closed Unbounded classes and the Haertig Quantifier Model
arXiv preprint | 2019-03-06 | Paper |
Stably Measurable Cardinals
arXiv preprint | 2019-01-16 | Paper |
Lower consistency bounds for mutual stationarity with divergent uncountable cofinalities
Israel Journal of Mathematics | 2018-11-13 | Paper |
The ramified analytical hierarchy using extended logics
The Bulletin of Symbolic Logic | 2018-10-26 | Paper |
| Global reflection principles | 2018-10-15 | Paper |
| Taming Koepke's zoo | 2018-09-06 | Paper |
The Ramified Analytical Hierarchy using Extended Logics
arXiv preprint | 2018-08-11 | Paper |
Discrete transfinite computation
Turing’s Revolution | 2018-04-18 | Paper |
Recognizable sets and Woodin cardinals: computation beyond the constructible universe
Annals of Pure and Applied Logic | 2018-02-06 | Paper |
Some reflections on Alan Turing's centenary
Internationale Mathematische Nachrichten | 2016-05-03 | Paper |
Local club condensation and L-likeness
The Journal of Symbolic Logic | 2016-03-22 | Paper |
| G_{\delta \sigma}-games and generalized computation | 2015-09-30 | Paper |
The aftermath
The Mathematical Intelligencer | 2013-07-18 | Paper |
Revision revisited
The Review of Symbolic Logic | 2013-01-10 | Paper |
| Discrete transfinite computation models | 2012-09-05 | Paper |
Global square and mutual stationarity at the \(\aleph_n\)
Annals of Pure and Applied Logic | 2011-09-22 | Paper |
A generalised dynamical system, infinite time register machines, and \(\Pi^1_1\)-\(\mathrm{CA}_{0}\)
Models of Computation in Context | 2011-09-09 | Paper |
Hypermachines
Journal of Symbolic Logic | 2011-06-28 | Paper |
\(\Sigma ^{*}\) fine structure
Handbook of Set Theory | 2010-11-05 | Paper |
Erratum to ``The undecidability of propositional adaptive logic
Synthese | 2009-11-04 | Paper |
Relativistic Computers and Transfinite Computation
Lecture Notes in Computer Science | 2009-10-22 | Paper |
On the consistency strength of the inner model hypothesis
Journal of Symbolic Logic | 2008-06-09 | Paper |
Bounding lemmata for non-deterministic halting times of transfinite Turing machines
Theoretical Computer Science | 2008-04-16 | Paper |
The undecidability of propositional adaptive logic
Synthese | 2007-11-14 | Paper |
Turing Unbound: Transfinite Computation
Lecture Notes in Computer Science | 2007-11-13 | Paper |
| The strength of the Inner Model Hypothesis | 2007-11-05 | Paper |
| On the strength of mutual stationarity | 2007-03-05 | Paper |
Comparing inductive and circular definitions: Parameters, complexity and games
Studia Logica | 2006-03-17 | Paper |
New Computational Paradigms
Lecture Notes in Computer Science | 2006-01-11 | Paper |
| scientific article; zbMATH DE number 2236676 (Why is no real title available?) | 2005-12-08 | Paper |
Set-theoretic absoluteness and the revision theory of truth
Studia Logica | 2004-02-08 | Paper |
Pf ≠ NPf for almost all f
MLQ | 2003-11-10 | Paper |
Possible-worlds semantics for modal notions conceived as predicates
Journal of Philosophical Logic | 2003-06-09 | Paper |
Bounded Martin's Maximum, weak Erdӧs cardinals, and ψAc
Journal of Symbolic Logic | 2002-12-16 | Paper |
| P^f is not equal to NP^f for almost all f | 2002-12-03 | Paper |
| scientific article; zbMATH DE number 1420860 (Why is no real title available?) | 2000-09-05 | Paper |
| scientific article; zbMATH DE number 1390284 (Why is no real title available?) | 2000-06-13 | Paper |
Minimality in the Δ⅓-degrees
Journal of Symbolic Logic | 1987-01-01 | Paper |
The reals in core models
Journal of Symbolic Logic | 1987-01-01 | Paper |
The natural hierarchy and quasi-hierarchy of constructibility degrees
Journal of Symbolic Logic | 1986-01-01 | Paper |
Comparing incomparable kleene degrees
Journal of Symbolic Logic | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3916256 (Why is no real title available?) | 1984-01-01 | Paper |
Determinacy and \Delta^1_3-degrees
arXiv preprint | N/A | Paper |
