Related papers: Feferman's completeness theorem

We investigate whether the group algebra of a finite group over a localisation of the integers is semiperfect. The main result is a necessary and sufficient arithmetic criterion in the ordinary case. In the modular case, we propose a…

We prove model completeness for the theory of addition and the Frobenius map for certain subrings of rational functions in positive characteristic. More precisely: Let $p$ be a prime number, $\mathbb{F}_{p}$ the prime field with $p$…

We begin the study of completeness of affine connections, especially those on statistical manifolds as well as on affine hypersurfaces. We collect basic facts, prove new theorems and provide examples with remarkable properties.

The first author introduced a sequence of polynomials (\cite{8}, sequence A174531) defined recursively. One of the main results of this study is proof of the integrality of its coefficients.

We consider fragments of uniform reflection for formulas in the analytic hierarchy over theories of second order arithmetic. The main result is that for any second order arithmetic theory $T_0$ extending ${\sf RCA}_0$ and axiomatizable by a…

We give an affine proof of Feuerbach's theorem, by constructing an explicit affine map which takes the nine-point circle of any given Euclidean triangle to the incircle and fixes the Feuerbach point. The proof is shown to be valid in any…

Hindman's Theorem states that in any finite coloring of the integers, there is an infinite set all of whose finite sums belong to the same color. This is much stronger than the corresponding finite form, stating that in any finite coloring…

In this paper we use the Vandermonde matrices and their properties to give a new proof of the classical result of Karl Weierstrass about the approximation of continuous functions $f$ on closed intervals, using a sequence of polynomials. The…

Continuing pioneering work of Christophe Doche and Laurent Habsieger from 2004, we develop computer algebra algorithms, implemented in Maple, for finding the (necessarily rational) generating function for any integral of products, and in…

The Fourier extension conjecture of E. Stein was proved in the plane in 1970 by C. Fefferman, see also Zygmund and Carleson and Sj\"olin, with simplifications given by other authors later on, in particular by L. H\"ormander and T. Tao. We…

In the Handbook of Mathematical Logic, the Paris-Harrington variant of Ramsey's theorem is celebrated as the first result of a long 'search' for a purely mathematical incompleteness result in first-order arithmetic. This paper questions the…

Let $\mathscr{P}_\mathbb{Q}=\{ \alpha^n \; : \; \alpha \in \mathbb{Q}, \; n \ge 2\}$ be the set of rational perfect powers, and let $S \subseteq \mathscr{P}_\mathbb{Q}$ be a finite subset. We prove the existence of a polynomial $f_S \in…

In 1975 Voronin proved the universality theorem for the Riemann zeta-function $\zeta(s)$ which roughly says that any admissible function $f(s)$ is approximated by $\zeta(s)$. A few years later Reich proved a discrete analogue of this…

For an abelian category and a distinguished object with a graded endomorphism ring a necessary and sufficient criterion is given so that the category is equivalent to the abelian quotient of the category of finitely presented graded modules…

In this paper, we present a generalized effective completeness theorem for continuous logic. The primary result is that any continuous theory is satisfied in a structure which admits a presentation of the same Turing degree. It then follows…

We establish completeness for intuitionistic first-order logic, iFOL, showing that a formula is provable if and only if its embedding into minimal logic, mFOL, is uniformly valid under the Brouwer Heyting Kolmogorov (BHK) semantics, the…

A famous result of Freiman describes the structure of finite sets A of integers with small doubling property. If |A + A| <= K|A| then A is contained within a multidimensional arithmetic progression of dimension d(K) and size f(K)|A|. Here…

We give a short proof of an improved version of the Effros Open Mapping Principle via a shift-compactness theorem (also with a short proof), involving `sequential analysis' rather than separability, deducing it from the Baire property in a…

Birnbaum's theorem, that the sufficiency and conditionality principles entail the likelihood principle, has engendered a great deal of controversy and discussion since the publication of the result in 1962. In particular, many have raised…

To, say, a proper algebraic or holomorphic space $X/S$, and a coherent sheaf ${\mathcal F}$ on $X$ we identify a functorial ideal, the fitted flatifier, blowing up sequentially in which leads to a flattening of the proper transform of…