VLDB 2026 Research / reviewers in the wild / expert
M. Randall Holmes
dblp:91/1459
· DBLP profile ↗
7ranked-venue papers
6as first author
1since 2021 · last 2025
0000-0003-3187-8468ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 6 · 5 first-author · 1 since 2021Artificial intelligence and machine learning · 1 · 1 first-author
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Synonymy Questions Concerning the Quine SystemsabstractAbstract There are a variety of (“alternative”) axiomatic set theories available to mathematicians. It is worth asking how “alternative” they really are. Might they be no more than rephrasings of the theory (ZFC) that we already have? Here we give an account of the status of the Quine systems in this regard. Some are merely ZF in wolves’ clothing; some are genuine wolves. Thomas E. Forster, M. Randall Holmes |
J. Symb. Log. | 2 |
| 2001 | The Watson Theorem Prover
M. Randall Holmes, Jim Alves-Foss |
J. Autom. Reason. | 1 |
| 2001 | Strong Axioms of Infinity in NFUabstractThis paper discusses a sequence of extensions ofNFU, Jensen's improvement of Quine's set theory “New Foundations” (NF) of [16]. The original theoryNFof Quine continues to present difficulties. After 60 years of intermittent investigation, it is still not known to be consistent relative to any set theory in which we have confidence. Specker showed in [20] thatNFdisproves Choice (and so proves Infinity). Even if one assumes the consistency ofNF, one is hampered by the lack of powerful methods for proofs of consistency and independence such as are available for use withZFC; very clever work has been done with permutation methods, starting with [18] and [5], and exemplified more recently by [14], but permutation methods can only be applied to show the consistency or independence of unstratified sentences (see the definition ofNFUbelow for a definition of stratification). For example, there is no method available to determine whether the assertion “the continuum can be well-ordered” is consistent with or independent ofNF. There is one substantial independence result for an assertion with nontrivial stratified consequences, using metamathematical methods: this is Orey's proof of the independence of the Axiom of Counting fromNF(see below for a statement of this axiom). We mention these difficulties only to reassure the reader of their irrelevance to the present work. Jensen's modification of “New Foundations” (in [13]), which was to restrict extensionality to sets, allowing many non-sets (urelements) with no elements, has almost magical effects. M. Randall Holmes |
J. Symb. Log. | 1 |
| 1995 | Disguising Recursively Chained Rewrite Rules as Equational Theorems, as Implemented in the Prover EFTTP Mark 2
M. Randall Holmes |
RTA | 1 |
| 1995 | The Equivalence of NF-Style Set Theories with "Tangled" Type Theories; The Construction of omega-Models of Predicative NF (and More)abstractAbstract An ω-model (a model in which all natural numbers are standard) of the predicative fragment of Quine's set theory “New Foundations” (NF) is constructed. Marcel Crabbé has shown that a theory NFI extending predicative NF is consistent, and the model constructed is actually a model of NFI as well. The construction follows the construction of ω-models of NFU (NF with urelements) by R. B. Jensen, and, like the construction of Jensen for NFU, it can be used to construct α-models for any ordinal α. The construction proceeds via a model of a type theory of a peculiar kind; we first discuss such “tangled type theories” in general, exhibiting a “tangled type theory” (and also an extension of Zermelo set theory with Δ0 comprehension) which is equiconsistent with NF (for which the consistency problem seems no easier than the corresponding problem for NF (still open)), and pointing out that “tangled type theory with urelements” has a quite natural interpretation, which seems to provide an explanation for the more natural behaviour of NFU relative to the other set theories of this kind, and can be seen anachronistically as underlying Jensen's consistency proof for NFU. M. Randall Holmes |
J. Symb. Log. | 1 |
| 1993 | Systems of Combinatory Logic Related to Predicative and 'Mildly Impredicative' Fragments of Quine's 'New Foundations'
M. Randall Holmes |
Ann. Pure Appl. Log. | 1 |
| 1991 | Systems of Combinatory Logic Related to Quine's 'New Foundations'
M. Randall Holmes |
Ann. Pure Appl. Log. | 1 |