Related papers: On the equivalence of two quantifier elimination t…
Two pretrained neural networks are deemed equivalent if they yield similar outputs for the same inputs. Equivalence checking of neural networks is of great importance, due to its utility in replacing learning-enabled components with…
In this paper we prove a conjecture of B. Shoikhet which claims that two quantization procedures arising from Fourier dual constructions actually coincide.
It was shown by Connes, Douglas, Schwarz[1] that one can compactify M(atrix) theory on noncommutative torus. We prove that compactifications on Morita equivalent tori are physically equivalent. This statement can be considered as a…
Conditions, related to Kulkarni's equivalence problem are considered for indefinite Riemannian and Kaehlerian manifolds. Corresponding theorems are obtained for the values of the Ricci tensor on isotropic vectors as well as for the values…
This paper revisits the equivalence problem between algebraic quantum field theories and prefactorization algebras defined over globally hyperbolic Lorentzian manifolds. We develop a radically new approach whose main innovative features are…
In this short note we compare the expressive power of real-valued continuous logic (or just continuous logic, in recent literature) with that of compact-valued continuous logic, proposed by Chang and Keisler. We conclude that the two logics…
It was proved by Sela and by the authors that every formula in the theory of a free group $F$ is equivalent to a boolean combination of $\exists\forall$-formulas. We also proved that the elementary theory of a free group is decidable (there…
We introduce equivalence testing procedures for linear regression analyses. Such tests can be very useful for confirming the lack of a meaningful association between a continuous outcome and a continuous or binary predictor. Specifically,…
The paper is a continuation of our earlier article where we developed a theory of active and non-active infinitesimals and intended to establish quantifier elimination in quasianalytic structures. That article, however, did not attain full…
For $G$ a finite group, we prove in dimension 2 that there is a monoidal equivalence between the category of $G$-equivariant topological quantum field theories and the category of $G$-Frobenius algebras, this was proved by G. Moore and G.…
We propose in this paper a method for measuring the similarity between ontological concepts and terms. Our metric can take into account not only the common words of two strings to compare but also other features such as the position of the…
We show that the class MIP* of languages that can be decided by a classical verifier interacting with multiple all-powerful quantum provers sharing entanglement is equal to the class RE of recursively enumerable languages. Our proof builds…
Deutsch proposed two sorts of models of quantum computers, quantum Turing machines (QTMs) and quantum circuit families (QCFs). In this paper we explore the computational powers of these models and re-examine the claim of the computational…
The probabilistic (or quantitative) modal mu-calculus is a fixed-point logic de- signed for expressing properties of probabilistic labeled transition systems (PLTS). Two semantics have been studied for this logic, both assigning to every…
We consider possible extensions to quantum mechanics proposed by Steven Weinberg, and re-analyze his prediction of a new test based upon three atomic clocks in the same atom. We propose realistic experimental systems where this hypothesis…
In this short note, we prove a sharp quantization for positive solutions of Lane-Emden problems in a bounded planar domain. This result has been conjectured by De Marchis, Ianni and Pacella [6, Remark 1.2].
We give a sufficient condition for a model theoretic structure $B$ to 'inherit' quantifier elimination from another structure $A$. This yields an alternative proof of one of the main result from \cite{kle}, namely quantifier elimination for…
We present two deductively equivalent calculi for non-deterministic many-valued logics. One is defined by axioms and the other - by rules of inference. The two calculi are obtained from the truth tables of the logic under consideration in a…
This paper studies the problem of testing whether a system of linear equality and inequality constraints admits a solution when the coefficients of that system may have to be estimated. We show that a wide range of inferential questions in…
Let $L$ be a countable language. We characterize, in terms of definable closure, those countable theories $\Sigma$ of $\mathcal{L}_{\omega_1, \omega}(L)$ for which there exists an $S_\infty$-invariant probability measure on the collection…