Object generators, relaxed sets, and a foundation for mathematics (2110.01489v6)

Abstract: Object generators are essentially the "object" primitives of category theory, and can usually be thought of as "collections of elements". We develop a logical context with these and their morphisms as primitives, and four straightforward axioms. The only novelty is the logic: it is considerably weaker than standard binary logic, and does not include either equality or quantification. Instead of building these features into the logic, we require them of the objects. Relaxed sets are \emph{defined} to be object generators that have an equality pairing and that do support quantification. Some basic set-theory material (well-orders, recursion, cardinals etc.) is developed to show these have all the properties expected of sets. The theory closely follows na\"ive set theory, and is almost as easy to use. The main technical result is that relaxed theory contains a universal implementation of the ZFC-1 axioms, universal in the sense that every other such implementation is (uniquely) isomorphic to a transitive subobject. Here ZFC' stands forZermillo-Fraenkel-Choice', and -1' meansignore first-order logical constraints'. Unexpectedly, we see that relaxed set theory is the \emph{only} theory that is fully satisfactory for mainstream deductive mathematics. To see this we formulate the "Coherent Limit axiom" that asserts that a particularly simple type of increasing sequence of functions has a limit. It is easy to see that this is satisfied only in the maximal theory. Mainstream mathematicians implicitly assume this axiom, at least in the sense that they don't do the work required to deal with failures. Finally, a justification for including the Quantification Hypothesis is given in an appendix.