VLDB 2026 Research / reviewers in the wild / expert
Panagiotis Rouvelas
dblp:204/0486
· DBLP profile ↗
2ranked-venue papers
2as first author
1since 2021 · last 2024
0000-0001-5815-0018ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 2 first-author · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Cantorian Models of PredicativeabstractAbstract Tangled Type Theory was introduced by Randall Holmes in [3] as a new way of approaching the consistency problem for $\mathrm {NF}$ . Although the task of finding models for this theory is far from trivial (considering it is equiconsistent with $\mathrm {NF}$ ), ways of constructing models for certain fragments of it have been discovered. In this article, we present a simpler way of constructing models of predicative Tangled Type Theory and consequently of predicative $\mathrm {NF}$ . In these new models of predicative $\mathrm {NF}$ , the universe is well-orderable and equinumerous to the set of singletons. Panagiotis Rouvelas |
J. Symb. Log. | 1 |
| 2017 | Increasing sentences in Simple Type Theory
Panagiotis Rouvelas |
Ann. Pure Appl. Log. | 1 |