Below, you may find a collection of online preprints, separated into six categories.

__Selected articles are marked with a boldface asterisk enclosed in square brackets __**[*]**__.__

**Proof Theory.**This includes work on dilators and Pi12-logic, finitary and infinitary proof systems, complexity, and cut elimination.

**Recursion Theory.**

**Set Theory.**

**Model Theory.**This includes work involving completeness theorems, Löwenheim-Skolem theorems, Hanf numbers, and related notions.

**Logic in Computer Science.**This includes work on many-valued and modal logics, especially from the points of view of complexity and expressibility and of applications to artificial intelligence.

**Other work.**

- The Logic of Correct Models (with Fedor Pakhomov).

*Submitted for publication.*

- The Spectrum of Π13 Soundness (with Fedor Pakhomov).

**Phil. Trans. Roy. Soc. A**381 (2023). Article number 20220013.

- Functorial Fast-Growing Hierarchies (with Fedor Pakhomov and Andreas Weiermann).

**Forum Math. Sigma**, in press.

**[*]**The Π12 Consequences of a Theory (with Fedor Pakhomov).

**J. London Math. Soc.**107 (2023), pp. 1045-1073.

- Ackermann and Goodstein Go Functorial (with Anton Freund, Michael Rathjen, and Andreas Weiermann).

**Pacific J. Math.**313 (2021), pp. 251-291.

__The Number of Axioms__(with Matthias Baaz and Jan Bydžovský).

**Ann. Pure Appl. Logic**, 173 (2022). Article number 103078.

__A Topological Completeness Theorem for Transfinite Provability Logic__.

**Arch. Math. Logic**62 (2022), pp. 751–788.

__Determinate Logic and the Axiom of Choice__.

**Ann. Pure Appl. Logic**171 (2020). Article number 102745.

__Unsound Inferences Make Proofs Shorter__(with Matthias Baaz).

**J. Symbolic Logic**84 (2019), pp. 102-122*.*

__Strong Completeness of Provability Logic for Ordinal Spaces__(with David Fernández-Duque).

**J. Symbolic Logic**82 (2017), pp. 608-628.

- Higher-Order Feedback Computation (with Robert Lubarsky and Leonardo Pacheco), in
*Proceedings of Computability in Europe*2024 (CiE2024).

**[*]**The Metamathematics of Separated Determinacy.

*Submitted for publication,*122pp.

**[*]**Determinacy on the Edge of Second-Order Arithmetic (with Philip Welch).

*Submitted for publication,*107pp.

- Type-2 Feedback Computability (with Martín Soto).

*Submitted for publication.*

- Locally Hyperarithmetical Induction.

**Bull. London Math. Soc.**55 (2023), pp. 865-878.

- A proof of Grilliot's Theorem (with Ferre Vanden Kerchove).

**Bull. Belgian Math. Soc.**, in press.

__Effective Cardinals and__Σ04-__Determinacy____.__

**J. Symbolic Logic**, in press.

- Feedback Hyperjump (with Robert Lubarsky).

**J. Log. Comput.**31 (2021), pp. 20-39.

- A Characterization of Σ11-Reflecting Ordinals.

**Ann. Pure Appl. Logic**172 (2021). Article number 103009.

- The Order of Reflection.

**J. Symbolic Logic**86 (2021), pp. 1555-1583.

- A one-page proof of a theorem of Beleznay (with Martina Iannella).

*Submitted for publication.*

- Reflection Properties of Ordinals in Generic Extensions (with Corey Switzer).

*Submitted for publication.*

- Monotone versus Non-Monotone Projective Operators (with Philip Welch).

*Submitted for publication.*

- Recursively Large Projective Ordinals.

*Submitted for publication.*

- σ-Projective Sets of Reals, Cut Elimination, and Large Cardinals.

**Internat. Math. Nachrichten**248 (2021), pp. 17-27.

__Boundedness Theorems for Flowers and Sharps__(with Anton Freund, Michael Rathjen, and Andreas Weiermann).

**Proc. Amer. Math. Soc.**150 (2022), pp. 3973-3988.

__Countable Ordinals in Indiscernibility Spectra.__

**Fund. Math.**

- Gδσ Games and Induction on Reals (with Philip Welch).

**J. Symbolic Logic**86 (2021). pp. 1676-1690.

- Projective Games on the Reals (with Sandra Müller).

**Notre Dame J. Form. Log.**64 (2020) pp. 573–589.

- Provably Δ1 Games (with Douglas Blue).

**J. Symbolic Logic**85 (2020), pp. 1124–1146.

- Fσ Games and Reflection in L(R).

**J. Symbolic Logic**85 (2020), pp. 1102–1123.

**[*]**Long Borel Games.

**Israel J. Math**243 (2021), pp.273-314.

- Shortening Clopen Games.

**J. Symbolic Logic**86 (2021), pp. 1541-1554.

**[*]**Determined Admissible Sets.

**Proc. Amer. Math. Soc.**148 (2020), pp. 2217-2231.

__The Consistency Strength of Long Projective Determinacy__(with Sandra Müller).

**J. Symbolic Logic**85 (2020), pp. 338-366.

__Long Games and__σ__-Projective Sets__(with Sandra Müller and Philipp Schlicht).

**Ann. Pure Appl. Logic**172 (2021). Article number 102939.

- σ
__-Projective Determinacy__.

*Submitted for publication.*

**[*]**The Compactness of Gödel Logic.

*Submitted for publication.*

- The Löwenheim-Skolem Theorem for Gödel Logic.

**Ann. Pure Appl. Logic**174 (2023). Article number 103235.

**[*]**Gödel-Dummett Linear Temporal Logic (with Martin Diéguez, David Fernandez-Duque and Brett McLean).

**Artif. Intell.**, in press.

This is an extended version of the articles:

A Gödel Calculus for Linear Temporal Logic (with Martin Diéguez, David Fernandez-Duque and Brett McLean), in*Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning*(KR 2022)*; and*

Time and Gödel: Fuzzy Temporal Reasoning in PSPACE (with Martin Diéguez, David Fernandez-Duque and Brett McLean) in*Proceedings of the Workshop on Logic, Language, Information, and Computation*(WoLLIC 2022).

- Fundamental Logic is Decidable (with Jan Bydžovský).

**ACM Trans. Comp. Logic**, in press.

__Noetherian Gödel Logics__(with Jan Bydžovský and David Fernández-Duque).

**J. Log. Comp.**, 32 (2022), pp. 1487–1503.

This is an extended version of the article:

A non-hyperarithmetical Gödel logic (with Jan Bydžovský and David Fernández-Duque), in*Proceedings of the Conference on Logical Foundations of Computer Science*(LFCS 2021).

__Verification Logic__(with David Fernández-Duque).

J. Log. Comp.

This is an extended version of the article:

An arithmetical interpretation for negative introspection (with David Fernández-Duque), in*Proceedings of Advances in Modal Logic*(AiML 2016).

__Ten Problems in Gödel Logic__(with Matthias Baaz).21 (2017), pp. 149-152.

Soft Comput.

__On the Maximization of Menu-Dependent Interval Orders__(with Levent Ülkü).

**S. Choice Welf. 48 (**2017), pp. 357-366.

This website uses cookies. By continuing to use this site, you accept our use of cookies.