| 2008 |
|---|
| 14 | EE | M. Randall Holmes:
Symmetry as a Criterion for Comprehension Motivating Quine's 'New Foundations'.
Studia Logica 88(2): 195-213 (2008) |
| 2005 |
|---|
| 13 | EE | M. Randall Holmes:
The Structure of the Ordinals and the Interpretation of ZF in Double Extension Set Theory.
Studia Logica 79(3): 357-372 (2005) |
| 2004 |
|---|
| 12 | EE | M. Randall Holmes:
Paradoxes in Double Extension Set Theories.
Studia Logica 77(1): 41-57 (2004) |
| 2003 |
|---|
| 11 | EE | M. Randall Holmes:
Polymorphic type checking for the ramified theory of types of Principia Mathematica.
Electr. Notes Theor. Comput. Sci. 85(7): (2003) |
| 10 | EE | M. Randall Holmes:
Karel Lambert, Free Logic: Selected Essays.
Studia Logica 75(3): 413-419 (2003) |
| 2001 |
|---|
| 9 | | M. Randall Holmes,
Jim Alves-Foss:
The Watson Theorem Prover.
J. Autom. Reasoning 26(4): 357-408 (2001) |
| 8 | | M. Randall Holmes:
Strong Axioms of Infinity in NFU.
J. Symb. Log. 66(1): 87-116 (2001) |
| 2000 |
|---|
| 7 | | M. Randall Holmes:
A Strong and Mechanizable Grand Logic.
TPHOLs 2000: 283-300 |
| 1999 |
|---|
| 6 | | M. Randall Holmes:
Subsystems of Quine's "New Foundations" with Predicativity Restrictions.
Notre Dame Journal of Formal Logic 40(2): 183-196 (1999) |
| 1995 |
|---|
| 5 | | M. Randall Holmes:
Disguising Recursively Chained Rewrite Rules as Equational Theorems, as Implemented in the Prover EFTTP Mark 2.
RTA 1995: 432-437 |
| 4 | | M. Randall Holmes:
Untyped lambda-Calculus with Relative Typing.
TLCA 1995: 235-248 |
| 3 | | M. Randall Holmes:
The Equivalence of NF-Style Set Theories with ``Tangled'' Type Theories; The Construction of omega-Models of Predicative NF (and More).
J. Symb. Log. 60(1): 178-190 (1995) |
| 1993 |
|---|
| 2 | | M. Randall Holmes:
Systems of Combinatory Logic Related to Predicative and `Mildly Impredicative' Fragments of Quine's `New Foundations'.
Ann. Pure Appl. Logic 59(1): 45-53 (1993) |
| 1991 |
|---|
| 1 | | M. Randall Holmes:
Systems of Combinatory Logic Related to Quine's `New Foundations'.
Ann. Pure Appl. Logic 53(2): 103-133 (1991) |
