EDBT 2026 Demo / reviewers in the wild / expert
Richard Matthews
dblp:240/9517
· DBLP profile ↗
3ranked-venue papers
2as first author
3since 2021 · last 2024
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 3 · 2 first-author · 3 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Realizability Models for Large CardinalsabstractInternational audience Laura Fontanella, Guillaume Geoffroy, Richard Matthews |
CSL | 3 |
| 2024 | Constructing the constructible universe constructively
Richard Matthews, Michael Rathjen |
Ann. Pure Appl. Log. | 1 |
| 2022 | Taking Reinhardt's Power AwayabstractAbstract We study the notion of non-trivial elementary embeddings under the assumption that V satisfies ZFC without Power Set but with the Collection Scheme. We show that no such embedding can exist under the additional assumption that it is cofinal and either is a set or that the scheme of Dependent Choices of arbitrary length holds. We then study failures of instances of Collection in symmetric submodels of class forcings. Richard Matthews |
J. Symb. Log. | 1 |