Just so you know who you are really dealing with...

I'm (Melvin) Randall Holmes, a professor of mathematics at Boise State University in Boise Idaho since 1991. My research is in systems of set theory or combinatory logic related to Quine's set theory New Foundations, with a sideline in computer-assisted reasoning. I have a general somewhat more than amateur interest in the history and philosophy of mathematics, particularly mathematical logic.

This is a version of my home page under my own control. It largely mirrors but does not exactly mirror my former university home page. It will contain some material found in my page at the university which will appear familiar; other material (either outdated or inconvenient to import to the new location) will not be reproduced. The original page is now redirected to here (queries to most subdirectories of the original page will come right here, because the internal structure of this page is different). Queries to my Loglan resources at Boise State will go to the root Loglan page here.

Here is my very ancient personal data page, which is not very serious and has a lot of broken links because it is ancient and needs to be fixed.

You can see my curriculum vita curriculum vita (with publication list)

Here is the universal set bibliography (an expansion of the bibliography of Forster's NF book). I have an obligation to do some updating here.

Here is a **largely outdated** blurb about my NF activities, which I preserve for revision.

Here is my old home page for New Foundations, which is referenced here just so I can go in and fix it. It is very old...

Here is my new separate page on the artificial language Loglan.

**Marcel:**Here is the page for my current theorem proving project Marcel. There is access to documents from the latter two sections.**Gottlob:**Here is the page for my current theorem proving project Gottlob. This is an implementation of the logic of Frege, made consistent by the application of stratification restrictions, as proposed by Nino Cocchiarella. A curious fact is that the underlying logic is almost the same as that of the latest version of Marcel, though notationally it is very different as Frege's 2D notation is supported (for output only).**Lestrade:**Here is my latest theorem proving project, an implementation of a variant of Automath.**Watson:**Here is the link to the page for my old theorem prover project Watson: Watson theorem prover page. I am planning to incorporate some features of this system into my current projects. This project was funded for some time by the Department of Defense; I have not worked directly on it for years, but I have not forgotten about it entirely.**RTT:**Here is the material on my polymorphic typechecker for the ramified type theory of Principia Mathematica.

I have claimed since 2010 to be in possession of a proof of the consistency of Quine's set theory New Foundations. I maintain various versions of this proof here: every now and then I have had to declutter this space. The proof is complex and I freely admit to having severe problems with seeing how to present it.

Here is a fresh version from April 2020. I am hoping this will be a bit easier to follow than earlier versions; I do some clearly indicated foreshadowing of impossible things that turn out to be all true in the end, which might help with motivation when I am doing the honest construction.

Here is a purported draft of the proof of the existence of a model of tangled type theory (and thus of Con(NF)).

As of 3/25/2017, I provide a key to versions. (I) is an ancient version which I preserve because Nathan Bowler's group read it. (II) is the version first submitted to a journal. (IIa) corrects some problems with (II) that I found when preparing (III). (III) is a version with a considerably simplified argument which has been presented to the journal as replacing (II). (IIIa) is a version of (III) with a local correction to one argument. (IV) is a further version with a simplified version of the construction of set parents already suggested in (I).

These numbered versions are all quite old now, and I would recommend sticking to the April 2020 version.

- This (
`submissiondraftalt.pdf`(III)) is what I think is a notably simplified version of the submitted version just below. The structure built is exactly the same, but the bookkeeping of atoms in clans is slightly different, and the definition of the structure is given in a way which enormously simplifies the recursion in the definition and considerably simplifies the proofs that it works. There still may be some need to revise text carried forward from the version below for compatibility with the new approach. For the moment I am not making such corrections as this is the version now in the hands of referees; a version with such corrections might appear at this point if I become aware of a need for enough of them. - This (
`submissiondraftalt-with-a-repair.pdf`(IIIa)) is the version at the top with a repair to the argument on pp. 38-42 with changes in the text indicated in the footnotes: reasoning steps valid in`submissiondraft.pdf`because of global induction hypotheses have to be enforced by requiring that objects discussed be strongly symmetric. Some other minor repairs have been made, indicated by footnotes. - This (
`submissiondraftalt-smallparentsets.pdf`(IV)) is a version rewritten using the simpler definition of parent sets which is suggested in the other versions after the main construction. There does seem to be some gain from using it. The error fixed in the version just above was discovered while preparing this version (which doesn't have that issue because the argument for sizes of strongly symmetric power sets is a bit simpler). - This (
`submissiondraft.pdf`(II)) is a full version based on my working notes during my Cambridge visit in May and June 2016. I believe this is the best approach. There is no recursive horror of construction of codes for all the atoms and elements of the parent sets of atoms (if you have read those versions you know what I mean). In fact, this version very much resembles the way I originally thought of the construction -- but with clearer understanding of how it goes, I believe I have avoided circular explanations. It is still nasty. This is the version which has been submitted to a journal.This (

`submissiondraft-with-repairs.pdf`(IIa)) is a version of the file immediately above which corrects or least remarks on slips in that version which I found in the course of preparing the version now at the top. I commend the version at the top to the reader, but I continue to believe that the argument of this version is basically correct and I'll maintain this for now and update it as required. The argument in the version at the top is simplified, and the bookkeeping is being done differently, but the same system of clans and permutations is intended to be described. - Here (
`tellthestory.pdf`(I)) is an older official document (using tangled webs), which uses quite complex coding. This document has been read by Nathan Bowler's group in Hamburg, and they profess to understand most of it. An error in the "elementarity argument" required a correction. In the newer version above the whole issue of the "elementarity argument" is finessed. - If anyone wants information about the status of other versions previously posted here, please ask me. I reduced them again in preparing the Github version of this page.

Here is the talk I gave on New Foundations to the department at Boise State on September 10, 2013. Philosophical interests in NF might be served by these slides, and also by the notes on Frege's logic which appear below.

Here (`theslides.pdf`) are the notes for the talk I
gave at the University of Hamburg on June 24, 2015. These have now been extended to a (quite long) full discussion of the proof -- this
was done by incorporating a large final segment of the current version of the paper, which needs to be further formatted and cut.

This is my most recent explicitly philosophical essay about Quine-style set theory.

I have removed a lot of links to various drafts in constructing the new page. Such drafts still exist on my university computer but are not present here. You may inquire about them if necessary.

Look Mom, I wrote a *book*! (jumps up and down)

I have permission from my publisher to post a revised version of my book Elementary Set Theory with a Universal Set (which has gone out of print) online. This PDF version is the result of a first pass through the text in November 2012 with the aim of preparing an official online second edition. I thank my publishers for their kindness in allowing me to maintain an online version, both to conveniently publicize error corrections and to make the work available now that it is out of print.

Communications about errors and infelicities would be very welcome!

Here is a talk I gave recently to the local seminar on resolving the paradoxes in NFU. There isn't anything very novel about it: it was really intended as an example to address questions by a philosopher about whether discussions of avoidance of the paradoxes are explanations of why we regard a theory as reliable (the usual way in which resolutions of the paradoxes in NFU are discussed is not really motivated in this way). Here are some notes about foundations in type theory and NF(U) which are altogether more serious in intent, although they should be regarded as a negative indexed draft which might contain genuine howlers ;-)

Here is the brief demonstration that parameter-free Zermelo set theory is the same as full Zermelo set theory: parameterfree.pdf

Here is my submitted draft (2018) on representation of functions in third order logic (this paper has appeared). Here are the slides for my BEST talk about this.

Here find an outline of a proposed approach to semantics for the Principia Mathematica (PM) of Russell and Whitehead using the type and substitution algorithms in my paper on automated polymorphic type inference in PM. Here find some notes on PM with page references related to the same analysis.

Here find an essay on the ontological commitments of PM and why substitutional quantification does work there and doesn't save you from serious ontological commitments. The flavor of my remarks is admittedly rather bad-tempered; a great deal of nonsense is written about PM.

Here find an outline of how to fix the foundational system of Frege using stratification in the style of Quine. Here find another approach to the same subject. Here find a computer implementation of these ideas.

Here find my current notes on Dana Scott's lovely and weird result that ZFC minus extensionality has the same strength as Zermelo set theory.

Here is the May 19th 2011 (submitted) version of the paper I am writing about Zuhair al-Johar's proposal of "acyclic comprehension", with Zuhair and Nathan Bowler as co-authors, a perhaps surprising reformulation of stratified comprehension.

Here is the submitted (2020) draft of the paper I am writing about a simpler form of symmetric comprehension equivalent to NF. Here is a companion piece describing a weaker version of symmetric comprehension which gives a theory inessentially stronger than NF3, with a model construction.

Here find the note submitted Dec 30 2013 on my result that the set H(|X|) of all sets hereditarily smaller in size than a set X exists, not using Choice. It is surprising to me that this is not an obvious result, but the references for partial results that I have been able to find are recent, so perhaps it is new.

Here find a summary of my thoughts on the correct default foundations in the style of Zermelo. In spite of being an NF-iste, I do think that Zermelo-style foundations are the best. However, I think that the axiom of replacement is so strong that it should not be part of the default foundations. In particular, I do not think that the axiom of replacement is justified by the intuition of the cumulative hierarchy; it is a far stronger principle.

Here is a version of my paper on the curious fact that the urelements in the usual models of NFU turn out to be inhomogeous, because the membership relation on the underlying model-with-automorphism of the usual set theory turns out to be definable in NFU terms. This version corrects a couple of annoying typos in the published version.

I should put a link to my SEP article on Alternative Axiomatic Set Theories here.

Here are the slides for a talk I gave for students at the College of Idaho, which includes a cleverly minimalist representation of the reals.

Here are my notes on efficient bracket abstraction. Here is a brief related note on eliminating bound variables from syntax.

Here is a very old note on Quine's calculus of concepts which perhaps should be dusted off. Here is another

Here is a note on defining equality as indiscernibility in NF and related theories.

Here is a letter of mine discussing the set theory of Ackermann. Here are some not very serious notes on a pocket set theory. Here is a later version (PDF file).

The place to start...

For several years, I have been the "chief executive officer" (a grander designation than is perhaps appropriate) of The Loglan Institute, the nonprofit organization which attempts to guide the development of the artificial language Loglan. This language was originally proposed by James Cooke Brown in the 1950's as a vehicle for testing the Sapir-Whorf hypothesis (look it up!) A specific peculiarity of this language is that it is (at least in intention) syntactically unambiguous: the official version of the language is unambiguously machine parsable. The language is intended to be highly logical: it is to some extent an implementation of first-order logic in a spoken language.

Here is the official web site of the Loglan Institute. Here is the mirror of the Loglan web site at Boise State. There is access to a wide variety of information, documents and software through these links.

Here is my new separate page on Loglan, where you can find pointers to my current Loglan projects.