default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDM. Randall Holmes
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[i1]Zuhair Al-Johar, M. Randall Holmes:
Acyclic Comprehension is equal to Stratified Comprehension. CoRR abs/2010.14949 (2020)
2010 – 2019
- 2019
- [j14]M. Randall Holmes
:
Representation of Functions and Total Antisymmetric Relations in Monadic Third Order Logic. J. Philos. Log. 48(2): 263-278 (2019) - 2014
- [j13]M. Randall Holmes:
On hereditarily small sets in ZF. Math. Log. Q. 60(3): 228-229 (2014) - [j12]Zuhair Al-Johar, M. Randall Holmes, Nathan J. Bowler:
The Axiom Scheme of Acyclic Comprehension. Notre Dame J. Formal Log. 55(1): 11-24 (2014) - 2012
- [j11]M. Randall Holmes:
The Usual Model Construction for NFU Preserves Information. Notre Dame J. Formal Log. 53(4): 571-580 (2012) - [r1]M. Randall Holmes, Thomas E. Forster, Thierry Libert:
Alternative Set Theories. Sets and Extensions in the Twentieth Century 2012: 559-632
2000 – 2009
- 2008
- [j10]M. Randall Holmes:
Symmetry as a Criterion for Comprehension Motivating Quine's 'New Foundations'. Stud Logica 88(2): 195-213 (2008) - 2005
- [j9]M. Randall Holmes:
The Structure of the Ordinals and the Interpretation of ZF in Double Extension Set Theory. Stud Logica 79(3): 357-372 (2005) - 2004
- [j8]M. Randall Holmes:
Paradoxes in Double Extension Set Theories. Stud Logica 77(1): 41-57 (2004) - 2003
- [j7]M. Randall Holmes:
Karel Lambert, Free Logic: Selected Essays. Stud Logica 75(3): 413-419 (2003) - [c4]M. Randall Holmes:
Polymorphic type checking for the ramified theory of types of Principia Mathematica. Mathematics, Logic and Computation @ ICALP 2003: 125-145 - 2001
- [j6]M. Randall Holmes, Jim Alves-Foss:
The Watson Theorem Prover. J. Autom. Reason. 26(4): 357-408 (2001) - [j5]M. Randall Holmes:
Strong Axioms of Infinity in NFU. J. Symb. Log. 66(1): 87-116 (2001) - 2000
- [c3]M. Randall Holmes:
A Strong and Mechanizable Grand Logic. TPHOLs 2000: 283-300
1990 – 1999
- 1999
- [j4]M. Randall Holmes:
Subsystems of Quine's "New Foundations" with Predicativity Restrictions. Notre Dame J. Formal Log. 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]M. Randall Holmes:
Untyped lambda-Calculus with Relative Typing. TLCA 1995: 235-248 - 1993
- [j2]M. Randall Holmes:
Systems of Combinatory Logic Related to Predicative and 'Mildly Impredicative' Fragments of Quine's 'New Foundations'. Ann. Pure Appl. Log. 59(1): 45-53 (1993) - 1991
- [j1]M. Randall Holmes:
Systems of Combinatory Logic Related to Quine's 'New Foundations'. Ann. Pure Appl. Log. 53(2): 103-133 (1991)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
