Related papers: Remarques sur l'expression de la g\'en\'eralit\'e …
The standard axioms of set theory, the Zermelo-Fraenkel axioms (ZFC), do not suffice to answer all questions in mathematics. While this follows abstractly from Kurt G\"odel's famous incompleteness theorems, we nowadays know numerous…
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…
First we generalize a famous lemma of Gallagher on the mean square estimate for exponential sums by plugging a weight in the right hand side of Gallagher's original inequality. Then we apply it in the special case of the Cesaro weight, in…
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 generalize several classical theorems in extremal combinatorics by replacing a global constraint with an inequality which holds for all objects in a given class. In particular we obtain generalizations of Tur\'an's theorem, the…
We propose a proof of the downward L\"owenheim-Skolem that relies on strategies deriving from evaluation games instead of the Skolem normal forms. This proof is simpler, and easily understood by the students, although it requires, when…
We study the proof scheme "proof by example" in which a general statement can be proved by verifying it for a single example. This strategy can indeed work if the statement in question is an algebraic identity and the example is "generic".…
We show how to express intuitionistic Zermelo set theory in deduction modulo (i.e. by replacing its axioms by rewrite rules) in such a way that the corresponding notion of proof enjoys the normalization property. To do so, we first rephrase…
The generalized Euler number E_{n|k} counts the number of permutations of {1,2,...,n} which have a descent in position m if and only if m is divisible by k. The classical Euler numbers are the special case when k=2. In this paper, we study…
Approximation in measure is employed to solve an asymptotic Dirichlet problem on arbitrary open sets and to show that many functions, including the Riemann zeta-function, are universal in measure. Connections with the Riemann Hypothesis are…
Recently, Grynkiewicz et al. [{\it Israel J. Math.} {\bf 193} (2013), 359--398], using tools from additive combinatorics and group theory, proved necessary and sufficient conditions under which the linear congruence $a_1x_1+\cdots…
A simple formal recasting of well known arguments concerning the ordering problems of General Relativity allows to obtain in such a context a Gr\"{o}enewald Van Hove like theorem.
In this paper, we prove the existence and uniqueness of the conditional expectation of an event $A$ given a $\sigma$-algebra $\mathcal{G}$ as a linear problem in the Lebesgue spaces $L^{p}$ associated with a probability space through the…
We prove two conjectures posed in 2016 concerning a generalization of the Sawayama-Th\'ebault Theorem and the Sawayama Lemma. We show that this generalized statement can be viewed in Laguerre geometry, which provides a natural framework for…
For given set of $m$ positive numbers satisfying the conditions: $$ a_1 \geq a_2 \geq , ... \geq a_m \geq 0, $$ the inequality $$ \sum_{s=1}^{m} (-1)^{s-1}a^r_s \geq \left[ \sum_{s=1}^{m} (-1)^{s-1}a_s\right]^r, \quad r > 1, $$ was proved…
Despite considerable research on document spanners, little is known about the expressive power of generalized core spanners. In this paper, we use Ehrenfeucht-Fra\"iss\'e games to obtain general inexpressibility lemmas for the logic FC (a…
Universality of eigenvalue spacings is one of the basic characteristics of random matrices. We give the precise meaning of universality and discuss the standard universality classes (sine, Airy, Bessel) and their appearance in unitary,…
G\"odel proved in the 1930s in his famous Incompleteness Theorems that not all statements in mathematics can be proven or disproven from the accepted ZFC axioms. A few years later he showed the celebrated result that Cantor's Continuum…
The great innovation of the Generalized Theorem is that it gives us the philosophy to work out the knowledge that the number of roots of an equation depends on the subfields of the functional terms of the equation they generate. Thus, the…
We present a proof of Thue-Siegel-Roth's Theorem (and its more recent variants, such as those of Lang for number fields and that "with moving targets" of Vojta) as an application of Geometric Invariant Theory (GIT). Roth's Theorem is…