Related papers: A Simple and Elementary Proof of Zorn's Lemma
A new construction is given of non-standard uniserial modules over certain valuation domains; the construction resembles that of a special Aronszajn tree in set theory. A consequence is the proof of a sufficient condition for the existence…
We propose an extension of Aczel's constructive set theory CZF by an axiom for inductive types and a choice principle, and show that this extension has the following properties: it is interpretable in Martin-Lof's type theory (hence…
The definition is a common form of human expert knowledge, a building block of formal science and mathematics, a foundation for database theory and is supported in various forms in many knowledge representation and formal specification…
The regular languages with a neutral letter expressible in first-order logic with one alternation are characterized. Specifically, it is shown that if an arbitrary $\Sigma_2$ formula defines a regular language with a neutral letter, then…
In a previous article [1] we presented an argument to obtain (or rather infer) Born's rule, based on a simple set of axioms named "Contexts, Systems and Modalities" (CSM). In this approach there is no "emergence", but the structure of…
Resolution modulo is a first-order theorem proving method that can be applied both to first-order presentations of simple type theory (also called higher-order logic) and to set theory. When it is applied to some first-order presentations…
Arrow's Theorem concerns a fundamental problem in social choice theory: given the individual preferences of members of a group, how can they be aggregated to form rational group preferences? Arrow showed that in an election between three or…
Although Zermelo-Fraenkel set theory (ZFC) is generally accepted as the appropriate foundation for modern mathematics, proof theorists have known for decades that virtually all mainstream mathematics can actually be formalized in much…
The traditional Arrow--Sen Social Choice Theory $\bf{TSCT}$ is a mathematical theory built apparently on higher--order formal language. In this paper, we propose a reformulation and reclassification of the $\bf{TSCT}$ axioms in order to…
The aim of this article is to employ the Lazy Set algorithm as an example for a mathematical framework for proving the linearizability of distributed systems. The proof in this approach is divided into two stages of lower and higher…
When specialized to the context of permutations, Schmerl and Trotter's Theorem states that every simple permutation which is not a parallel alternation contains a simple permutation with one fewer entry. We give an elementary proof of this…
This article is concerned with the Axiom of Choice (AC) and the well-ordering theorem (WO) in second-order predicate logic with Henkin interpretation (HPL). We consider a principle of choice introduced by Wilhelm Ackermann (1935) and…
We exhibit how the Rasiowa-Sikorski Lemma simplifies, in a sense, proofs of results that make use of the technique known as back-and-forth, often resulting in not very illustrative arguments. The first two sections seek to show one simple…
We prove that the Arithmetic Fundamental Lemma conjecture of Wei Zhang is equivalent to a similar conjecture, but for Lie algebras, in the case of non-degenerate intersection. We use this result to give a simplified proof of the AFL for…
Despite recent advances in automating theorem proving in full first-order theories, inductive reasoning still poses a serious challenge to state-of-the-art theorem provers. The reason for that is that in first-order logic induction requires…
We give a simple proof that the first-order theory of well orders is axiomatized by transfinite induction, and that it is decidable.
We present a simple short proof of the Fundamental Theorem of Algebra, without complex analysis and with a minimal use of topology. It can be taught in a first year calculus class.
The main aim of this paper is to promote a certain style of doing coinductive proofs, similar to inductive proofs as commonly done by mathematicians. For this purpose, we provide a reasonably direct justification for coinductive proofs…
We give an undergraduate short and simple proof for Zariski's lemma.
Although it is easy to prove the sufficient conditions for optimality of a linear program, the necessary conditions pose a pedagogical challenge. A widespread practice in deriving the necessary conditions is to invoke Farkas' lemma, but…