Related papers: Relative normalization
A complete first-order theory is equational if every definable set is a Boolean combination of instances of equations, that is, of formulae such that the family of finite intersections of instances has the descending chain condition.…
We characterize stable T for which the model completion of T_{aut} is stable (i.e., every completion is). Then we prove that ``some completion is stable'' is different and we characterize it. Finally we show that if T is stable, T_{aut} has…
We generalize the classical Olivier's theorem which says that for any convergent series $\sum_n a_n$ with positive nonincreasing real terms the sequence $(n a_n)$ tends to zero. Our results encompass many known generalizations of Olivier's…
For Kolmogorov test we find natural conditions of uniform consistency of sets of alternatives approaching to hypothesis. Sets of alternatives can be defined both in terms of distribution functions and in terms of densities.
It is usually accepted that General Relativity is the only consistent theory which can be obtained starting from the linear Fiertz-Pauli Lagrangian. It is the aim of the present paper to study whether, under certain requirements, a…
A well-known result of Shelah and Spencer tells us that the almost sure theory for first order language on the random graph sequence $\left\{G(n, cn^{-1})\right\}$ is not complete. This paper proposes and proves what the complete set of…
We generalize several recognizability theorems for free single-sorted algebras to the field of many-sorted algebras and provide, in a uniform way and without using neither regular tree grammars nor tree automata, purely algebraic proofs of…
Testing to see whether a given data set comes from some specified distribution is among the oldest types of problems in Statistics. Many such tests have been developed and their performance studied. The general result has been that while a…
In this paper we give an ordinal analysis of the theory of second order arithmetic. We do this by working with proof trees -- that is, "deductions" which may not be well-founded. Working in a suitable theory, we are able to represent…
Both classical and quantum mechanics assume that physical laws are invariant under changes in the way that the world is labeled. This Principle of Decompositional Equivalence is formalized, and shown to forbid finite experimental…
It is shown that, under suitable conditions, involving in particular the existence of analytic constants of motion, the presence of Lie point symmetries can ensure the convergence of the transformation taking a vector field (or dynamical…
Diagonalization in the spirit of Cantor's diagonal arguments is a widely used tool in theoretical computer sciences to obtain structural results about computational problems and complexity classes by indirect proofs. The Uniform…
We present an analogue of G\"{o}del's second incompleteness theorem for systems of second-order arithmetic. Whereas G\"{o}del showed that sufficiently strong theories that are $\Pi^0_1$-sound and $\Sigma^0_1$-definable do not prove their…
The principle which allows to construct new physical theories on the basis of classical mechanics by reduction of the number of its axiom without engaging new postulates is formulated. The arising incompleteness of theory manifests itself…
A simple local proof of Noether's Second Theorem is given. This proof immediately leads to a generalization of the theorem, yielding conservation laws and/or explicit relationships between the Euler--Lagrange equations of any variational…
Let ${X_1,...,X_n}$ be i.i.d. random observations. Let $\mathbb{S}=\mathbb{L}+\mathbb{T}$ be a $U$-statistic of order $k\ge2$ where $\mathbb{L}$ is a linear statistic having asymptotic normal distribution, and $\mathbb{T}$ is a…
The interplay between T-duality and supersymmetry in string theory is explored. It is shown that T-duality is always compatible with supersymmetry and simply changes a local realization to a non-local one and vice versa. Non-local…
In this essay we'll prove G\"odel's incompleteness theorems twice. First, we'll prove them the good old-fashioned way. Then we'll repeat the feat in the setting of computation. In the process we'll discover that G\"odel's work, rightly…
We prove a general transfer theorem for multivariate random sequences with independent random indexes in the double array limit setting. We also prove its partial inverse providing necessary and sufficient conditions for the convergence of…
We present a sufficient condition for irreducibility of forcing algebras and study the (non)-reducedness phenomenon. Furthermore, we prove a criterion for normality for forcing algebras over a polynomial base ring with coefficients in a…