English
Related papers

Related papers: On the equivalence of two quantifier elimination t…

200 papers

In this paper, we prove the number of countable models of a countable supersimple theory is either 1 or infinite. This result is an extension of Lachlan's theorem on a superstable theory.

Rings and Algebras · Mathematics 2009-09-25 Byunghan Kim

We study Kleene iteration in the categorical context. A celebrated completeness result by Kozen introduced Kleene algebra (with tests) as a ubiquitous tool for lightweight reasoning about program equivalence, and yet, numerous variants of…

Logic in Computer Science · Computer Science 2024-07-19 Sergey Goncharov , Tarmo Uustalu

Let A={a_s(mod n_s)}_{s=1}^k and B={b_t(mod m_t)}_{t=1}^l be two systems of residue classes. If |{1\le s\le k: x=a_s (mod n_s)}| and |{1\le t\le l: x=b_t (mod m_t)}| are equal for all integers x, then A and B are said to be covering…

Number Theory · Mathematics 2007-10-22 Hao Pan , Zhi-Wei Sun

It has been argued that any test of quantum contextuality is nullified by the fact that perfect orthogonality and perfect compatibility cannot be achieved in finite precision experiments. We introduce experimentally testable two-qutrit…

Quantum Physics · Physics 2011-05-17 Adan Cabello , Marcelo Terra Cunha

The main aim of the paper is to give a short self-contained proof of the decidability of language equivalence for deterministic pushdown automata, which is the famous problem solved by G. Senizergues, for which C. Stirling has derived a…

Formal Languages and Automata Theory · Computer Science 2011-03-10 Petr Jancar

The equivalence principle can be tested by precision experiments based on classical and quantum systems, on the ground as well as in space. In many models, these tests are mostly equivalent in their ability to constrain physics beyond the…

General Relativity and Quantum Cosmology · Physics 2017-08-23 Michael Hohensee , Holger Mueller

MV-algebras were introduced by Chang to prove the completeness of the infinite-valued Lukasiewicz propositional calculus. In this paper we give a categorical equivalence between the varieties of (n+1)-valued MV-algebras and the classes of…

Logic · Mathematics 2015-08-25 Marina Lattanzi , Alejandro Petrovich

Two quantum finite automata are equivalent if for all input string $\omega$ over the input alphabet the two automata accept $\omega$ with equal probability. In [Theoret. Comput. Sci. 410 (2009) 3006-3017], it was shown that a $k_1$-letter…

Computational Complexity · Computer Science 2023-06-06 Tianrong Lin

In this paper, we focus on the problem of determining whether two conjunctive ("CQ") queries posed on relational data are combined-semantics equivalent [9]. We continue the tradition of [2,5,9] of studying this problem using the tool of…

Databases · Computer Science 2014-08-15 Rada Chirkova

I argue that, on a judicious reading of two existing criteria--one syntactic and the other semantic--dual theories can be taken to be empirically equivalent. The judicious reading is straightforward, but leads to the surprising conclusion…

History and Philosophy of Physics · Physics 2021-04-14 Sebastian De Haro

We prove that, for every theory $T$ which is given by an ${\mathcal L}_{\omega_1,\omega}$ sentence, $T$ has less than $2^{\aleph_0}$ many countable models if and only if we have that, for every $X\in 2^\omega$ on a cone of Turing degrees,…

Logic · Mathematics 2013-06-07 Antonio Montalban

We give a generalization and a short mechanized proof of determinant conjectured by G. Kuperberg and J. Propp. Further generalizations and applications of the method to some q-analogues may be found in http://www.math.temple.edu/~tewodros

Combinatorics · Mathematics 2007-05-23 Tewodros Amdeberhan , Shalosh B. Ekhad

Two theorems about the P versus NP problem be proved in this article (1) There exists a language $L$, that the statement $L \in \textbf{P}$ is independent of ZFC. (2) There exists a language $L \in \textbf{NP}$, for any polynomial time…

Computational Complexity · Computer Science 2018-05-09 Tianheng Tsui

We compare two different techniques for proving non-Shannon-type information inequalities. The first one is the original Zhang-Yeung's method, commonly referred to as the copy/pasting lemma/trick. The copy lemma was used to derive the first…

Information Theory · Computer Science 2013-02-14 Tarik Kaced

In this paper, we answer the question of equivalence, or singularity, of two given quasi-stationary Markov measures on one-sided infinite words, and the corresponding question of equivalence of associated Cuntz algebra $\O_N$…

Operator Algebras · Mathematics 2014-04-01 Dorin Ervin Dutkay , Palle E. T. Jorgensen

We prove two theorems on cohomologically complete complexes. These theorems are inspired by, and yield an alternative proof of, a recent theorem of P. Schenzel on complete modules.

Commutative Algebra · Mathematics 2014-04-30 Amnon Yekutieli

Closely related languages show linguistic similarities that allow speakers of one language to understand speakers of another language without having actively learned it. Mutual intelligibility varies in degree and is typically tested in…

Computation and Language · Computer Science 2024-02-06 Jessica Nieder , Johann-Mattis List

In the recent past, the reduction-based and the model-based methods to prove cut elimination have converged, so that they now appear just as two sides of the same coin. This paper details some of the steps of this transformation.

Logic in Computer Science · Computer Science 2023-05-03 Gilles Dowek

Two theorems with applications to the quantum theory of measurements are stated and proven. The first one clarifies and amends von Neumann's Measurement Postulate used in the Copenhagen interpretation of quantum mechanics. The second one…

Quantum Physics · Physics 2023-12-04 Simone Del Vecchio , Jürg Fröhlich , Alessandro Pizzo , Alessio Ranallo

We introduce a new notion of a sufficient subalgebra for quantum states: a subalgebra is 2- sufficient for a pair of states $\{\rho_0,\rho_1\}$ if it contains all Bayes optimal tests of $\rho_0$ against $\rho_1$. In classical statistics,…

Quantum Physics · Physics 2015-05-13 Anna Jencova