We give a direct proof of Infinity in the no-empty version of New Foundations, denoted NF-0, by establishing that every model of the specified theory contains an object that is not finite in a precise, internally defined sense. The version considered has extensionality, at least two distinct objects, no empty objects, and inhabited stratified comprehension: a stratified extension is supplied whenever it has a member. Finiteness combines a two-sided internally represented well-order with the exclusion of internally represented nonterminating strict transitive relations on inhabited subsets. Assuming all objects finite, partial bijections yield comparison and finite extrema of positive Frege cardinals. Positive exponentiation, singleton type-raising, and the least orbit of the genuine two-cardinal lead to the equation n = T(n) + 1. We prove separately, and in detail, that adjoining one point reverses internally defined parity: the key ingredients are a graph-rewiring proof of invariance under adjoining two points and one instance of stratified induction derived from the all-finite assumption. Since type-raising preserves parity, the cardinal equation is impossible. We identify the corresponding Lean 4 declarations and make explicit the scope of the formal verification. No model-existence or consistency theorem for ordinary NF is claimed.
We prove that the variety generated by all semirings of order three is nonfinitely based, where addition is not required to be commutative and the signature has no constants. The same conclusion holds for the variety generated by all additively idempotent semirings of order three. We establish these conclusions by excl...
We give a negative answer to the unrestricted product version of Bergman's finite-comparison theorem, even when all factors have finite length. Finite comparison does hold for quasi-injective common modules under finite cogeneration. We also prove a semidirect-product case of Bergman's Question 3.2. For a semiprimary r...
We introduce SemiBase, a project that computes and formally certifies finite identity bases for small semigroups. Deciding finite basability is undecidable for finite algebras and remains open for finite semigroups. The task requires a proof that a candidate basis is complete, or a proof that none exists, rather than a...
João Araújo, Jan Hůla, Mikoláš Janota et al.· 0 citations
Morier-Genoud and Ovsienko conjectured that a cubic Boolean generating function satisfying an ordered separation condition on its second polar must be equivalent to one of two symmetric normal forms. Two infinite families of counterexamples are constructed and proved analytically; both are direct sums of small seeds, a...
Reasoning about higher identity types uses two equalities, strict equality and equivalence of cells witnessed by a path. Strict equality is a congruence for every operation on cells, but associativity and the identity laws fail for it. Equivalence of cells satisfies those two laws, but it is not a congruence. Represent...
Keri D'Angelo, Liron Cohen, Luke Serafin et al.· 0 citations
We prove that KP, with Full Set Induction, is neither solid nor tight. More generally, every consistent theory obtained from KPC by adding a quantifier bounded set of sentences has a model with a parameter-free definable class surjection from its natural numbers onto its universe. Using such enumerations to define gene...
Elliott S. Glazer, Toby Meadows· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.