| 2012 | ||
|---|---|---|
| j12 | M. Randall Holmes: The Usual Model Construction for NFU Preserves Information. Notre Dame Journal of Formal Logic 53(4): 571-580 (2012) | |
| 2008 | ||
| j11 | M. Randall Holmes: Symmetry as a Criterion for Comprehension Motivating Quine's 'New Foundations'. Studia Logica 88(2): 195-213 (2008) | |
| 2005 | ||
| j10 | 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 | ||
| j9 | ||
| 2003 | ||
| j8 | M. Randall Holmes: Polymorphic type checking for the ramified theory of types of Principia Mathematica. Electr. Notes Theor. Comput. Sci. 85(7): 125-145 (2003) | |
| j7 | ||
| 2001 | ||
| j6 | M. Randall Holmes, Jim Alves-Foss: The Watson Theorem Prover. J. Autom. Reasoning 26(4): 357-408 (2001) | |
| j5 | ||
| 2000 | ||
| c3 | ||
| 1999 | ||
| j4 | M. Randall Holmes: Subsystems of Quine's "New Foundations" with Predicativity Restrictions. Notre Dame Journal of Formal Logic 40(2): 183-196 (1999) | |
| 1995 | ||
| j3 | 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) | |
| c2 | M. Randall Holmes: Disguising Recursively Chained Rewrite Rules as Equational Theorems, as Implemented in the Prover EFTTP Mark 2. RTA 1995: 432-437 | |
| c1 | ||
| 1993 | ||
| j2 | 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 | ||
| j1 | M. Randall Holmes: Systems of Combinatory Logic Related to Quine's `New Foundations'. Ann. Pure Appl. Logic 53(2): 103-133 (1991) | |
| 1 | Jim Alves-Foss |
Data released under the ODC-BY 1.0 license — See also our legal information page