Related papers: A Simple and Elementary Proof of Zorn's Lemma
This paper examines the completion of an w-ordered sequence of recursive definitions which on the one hand defines an increasing sequence of nested set and on the other redefines successively a numeric variable as the cardinal of the…
Based on an ordering with directed lines and using constructions instead of existential axioms, von Plato proposed a constructive axiomatization of the ordered affine geometry. There are 22 axioms for the ordered affine geometry, of which…
Solving of regular equations via Arden's Lemma is folklore knowledge. We first give a concise algorithmic specification of all elementary solving steps. We then discuss a computational interpretation of solving in terms of coercions that…
We introduce a new definition of a model for a formal mathematical system. The definition is based upon the substitution in the formal systems, which allows a purely algebraic approach to model theory. This is very suitable for applications…
We consider sets/relations/computations defined by *Elementary Inference Systems* I, which are obtained from Smullyan's *elementary formal systems* using Gentzen's notation for inference rules, and proof trees for atoms P(t_1,...,t_n),…
We consider a generalization of the classic Sperner lemma. This lemma states that every Sperner coloring of a triangulation of a simplex contains a fully colored simplex. We found a weaker assumption than Sperner's coloring. It is also…
The Born rule is part of the collapse axiom in the standard version of quantum theory, as presented by standard textbooks on the subject. We show here that its signature quadratic dependence follows from a single additional physical…
Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…
In what follows, essentially two things will be accomplished: Firstly, it will be proven that a version of the Arzel\`a--Ascoli theorem and the Fr\'echet--Kolmogorov theorem are equivalent to the axiom of countable choice for subsets of…
Deciding the positivity of a sequence defined by a linear recurrence with polynomial coefficients and initial condition is difficult in general. Even in the case of recurrences with constant coefficients, it is known to be decidable only…
In this paper, we propose how to use objective arguments grounded in statistical mechanics concepts in order to obtain a single number, obtained after aggregation, which would allow to rank "agents", "opinions", ..., all defined in a very…
We prove an elementary lemma concerning primitive amalgams and use it to greatly simplify the proof of the Sims conjecture in the case of almost simple groups.
We consider the problem of formalizing the familiar notion of widening in abstract interpretation in higher-order logic. It turns out that many axioms of widening (e.g. widening sequences are ascending) are not useful for proving…
The Zorn's Algebra ZZ(R) has a multiplicative function called determinant with properties similar to the usual one. The set of elements in ZZ(R) with determinant 1 is a Moufang loop that we will denote by \GA. In our main result we prove…
Although the categorical arithmetic is not effectively axiomatizable, the belief that the incompleteness Theorems can be apply to it is fairly common. Furthermore, the so-called "essential" (or "inherent") semantic incompleteness of the…
In much discussed work Artemov has recently shown that, for $\mathrm{PA}$, the consistency schema admits a form of uniform verification via selector proofs, despite the unprovability of the corresponding uniform consistency sentence…
One of the key concepts in testing is that of adequate test sets. A test selection criterion decides which test sets are adequate. In this paper, a language schema for specifying a large class of test selection criteria is developed; the…
In this note we present a simplified and slightly generalized version of a lemma the authors published in 1987. The lemma as stated here asserts that if the order of a permutation of $n$ elements is greater than $n^{\alpha}$ then some…
We introduce the concept of an abstract evolution system, which provides a convenient framework for studying generic mathematical structures and their properties. Roughly speaking, an evolution system is a category endowed with a selected…
In "Object generators, relaxed sets, and a foundation for mathematics", we introduced ``object generators'', a logical environment much more general than set theory. Inside this we found a `relaxed' version of set theory. That paper is…