Related papers: Herbrand's Theorem: a short statement and a model-…
The purpose of this article is to formulate a number of probabilistic hidden-variable theorems, to provide proofs in some cases, and counterexamples to some conjectured relationships. The first theorem is the fundamental one. It asserts the…
We prove a version of Hilbert's Irreducibility Theorem in the quadratic case, giving a quantitative improvement to a result of Bilu-Gillibert in this restricted setting. As an application, we give improvements to several quantitative…
We define noncommutative binary forms. Using the typical representation of Hermite we prove the fundamental theorem of algebra and we derive a noncommutative Cardano formula for cubic forms. We define quantized elliptic and hyperelliptic…
Geoffrion's theorem is a fundamental result from mathematical programming assessing the quality of Lagrangian relaxation, a standard technique to get bounds for integer programs. An often implicit condition is that the set of feasible…
Hadwiger's theorem is a Helly-type theorem involving common transversals to families of convex sets instead of common intersections. Subsequently, Pollack and Wenger identified a necessary and sufficient condition, called a consistent…
We present an elementary proof of Fermat's Last Theorem. No ancillary results are used, not even the most basic ones. The proof directly leads to a contradiction of the Fermat equation in the set of integers.
A family of regularization functionals is said to admit a linear representer theorem if every member of the family admits minimizers that lie in a fixed finite dimensional subspace. A recent characterization states that a general class of…
We prove the following theorem: For a partially ordered set Q such that every countable subset has a strict upper bound, there is a forcing notion satisfying ccc such that, in the forcing model, there is a basis of the null ideal of the…
We formalize the notion of Herbrand Consistency in an appropriate way for bounded arithmetics, and show the existence of a finite fragment of ${\rm I\Delta_0}$ whose Herbrand Consistency is not provable in the thoery ${\rm I\Delta_0}$. We…
The category of models of any theory $T$ in any first-order language $L$ has the surprising property that any small category that is elementarily equivalent with it, already embeds in it. The proof uses an abstract argument via ultrapowers,…
We present a structural representation of the Herbrand content of LK-proofs with cuts of complexity prenex Sigma-2/Pi-2. The representation takes the form of a typed non-deterministic tree grammar of order 2 which generates a finite…
We show that the types of the witnesses in the Herbrand functional interpretation can be simplified, avoiding the use of "sets of functionals" in the interpretation of implication and universal quantification. This is done by presenting an…
Many proofs of the Fundamental Theorem of Algebra, including various proofs based on the theory of analytic functions of a complex variable, are known. To the best of our knowledge, this proof is different from the existing ones.
Cut-elimination theorems constitute one of the most important classes of theorems of proof theory. Since Gentzen's proof of the cut-elimination theorem for the system $\mathbf{LK}$, several other proofs have been proposed. Even though the…
This unpublished note is an alternate, shorter (and hopefully more readable) proof of the decidability of all minimal models. The decidability follows from a proof of the existence of a cellular term in each observational equivalence class…
In this paper, we introduce a concept of non-dependence of variables in formulas. A formula in first-order logic is non-dependent of a variable if the truth value of this formula does not depend on the value of that variable. This variable…
Wedderburn's theorem on the structure of finite dimensional semisimple algebras is proved by using minimal prerequisites.
We propose a generalization of first-order logic originating in a neglected work by C.C. Chang: a natural and generic correspondence language for any types of structures which can be recast as Set-coalgebras. We discuss axiomatization and…
The Main Theorem for abelian fields (often called Main Conjecture despite proofs in most cases) has a long history which has found a solution by means of "elementary arithmetic", as detailed in Washington's book from Thaine's method having…
In this article we show that hybrid type-logical grammars are a fragment of first-order linear logic. This embedding result has several important consequences: it not only provides a simple new proof theory for the calculus, thereby…