English
Related papers

Related papers: Kleene algebra with commutativity conditions is un…

200 papers

We establish the undecidability of conditional affine information inequalities, the undecidability of the conditional independence implication problem with a constraint that one random variable is binary, and the undecidability of the…

Information Theory · Computer Science 2022-02-11 Cheuk Ting Li

Building on \'Esik and Kuich's completeness result for finitely weighted Kleene algebra, we establish relational and language completeness results for finitely weighted Kleene algebra with tests. Similarly as \'Esik and Kuich, we assume…

Logic in Computer Science · Computer Science 2024-07-11 Igor Sedlár

In this paper we prove undecidability of finite systems of equations in free Lie algebras of rank at least three over an arbitrary field. We show that the ring of integers $\mathbb{Z}$ is interpretable by positive existential formulas in…

Logic · Mathematics 2017-08-25 Olga Kharlampovich , Alexei Myasnikov

We clarify the relationship between the linear commutator and the ordinary commutator by showing that in any variety satisfying a nontrivial idempotent Mal'cev condition the linear commutator is definable in terms of the centralizer…

Rings and Algebras · Mathematics 2008-02-03 Keith A. Kearnes , Ågnes Szendrei

Let K be an algebraic function field of characteristic 2 with constant field C_K. Let C be the algebraic closure of a finite field in K. Assume that C has an extension of degree 2. Assume that there are elements u,x of K with u…

Number Theory · Mathematics 2016-09-07 Kirsten Eisentraeger

We prove the following propositions. Theorem 1: Let $M$ be a subfield of a fixed algebraic closure $\tilde \Q$ of $\Q$ whose existential elementary theory is decidable (resp. primitively decidable). Then, M is conjugate to a recursive…

Logic · Mathematics 2015-02-16 Moshe Jarden , Alexandra Shlapentokh

We show that the problem `whether a finite set of regular-linear axioms defines a rigid theory' is undecidable.

Logic · Mathematics 2019-02-20 Mikołaj Bojanczyk , Stanisław Szawiel , Marek Zawadowski

We point out that some questions in quantum field theory are undecidable in a precise mathematical sense. More concretely, it will be demonstrated that there is no algorithm answering whether a given 2d supersymmetric Lagrangian theory…

High Energy Physics - Theory · Physics 2024-11-22 Yuji Tachikawa

We associate a non-commutative $C^*$-algebra with any locally finite simplicial complex. We determine the $K$-theory of these algebras and show that they can be used to obtain a conceptual explanation for the Baum-Connes conjecture.

Operator Algebras · Mathematics 2007-05-23 Joachim Cuntz

We prove the Baum--Connes conjecture with arbitrary coefficients for some classes of groups: (1) Linear algebraic groups over a non-archimedean local field. (2) Linear algebraic groups over the adeles of a global field k, provided that at…

K-Theory and Homology · Mathematics 2019-04-08 Maarten Solleveld

Let $k$ be a field and let $R$ be a countable dimensional prime von Neumann regular $k$-algebra. We show that $R$ is primitive, answering a special case of a question of Kaplansky.

Rings and Algebras · Mathematics 2013-12-11 Pere Ara , Jason P. Bell

Kleene algebra (KA) is the algebra of regular events. Familiar examples of Kleene algebras include regular sets, relational algebras, and trace algebras. A Kleene algebra with tests (KAT) is a Kleene algebra with an embedded Boolean…

Logic · Mathematics 2008-01-16 James Worthington

Typical arguments for results like Kleene's Second Recursion Theorem and the existence of self-writing computer programs bear the fingerprints of equational reasoning and combinatory logic. In fact, the connection of combinatory logic and…

Logic in Computer Science · Computer Science 2024-02-14 Lawrence S. Moss

We survey a number of incompleteness results in operator algebras stemming from the recent undecidability result in quantum complexity theory known as $\operatorname{MIP}^*=\operatorname{RE}$, the most prominent of which is the G\"odelian…

Logic · Mathematics 2024-09-16 Isaac Goldbring

In this work, we show that very natural, apparently simple problems in quantum measurement theory can be undecidable even if their classical analogues are decidable. Undecidability hence appears as a genuine quantum property here. Formally,…

Quantum Physics · Physics 2012-07-20 J. Eisert , M. P. Mueller , C. Gogolin

A structural theorem for Kleene algebras is proved, showing that an element of a Kleene algebra can be looked upon as an ordered pair of sets. Further, we show that negation with the Kleene property (called the `Kleene negation') always…

Logic · Mathematics 2020-07-24 Arun Kumar , Mohua Banerjee

Let $R$ be a commutative integral unital domain and $L$ a free non-commutative Lie algebra over $R$. In this paper we show that the ring $R$ and its action on $L$ are 0-interpretable in $L$, viewed as a ring with the standard ring language…

Logic · Mathematics 2017-05-23 Olga Kharlampovich , Alexei Myasnikov

We give a decision procedure and proof of correctness for the equational theory of probabilistic Kleene algebra with angelic nondeterminism introduced in Ong, Ma, and Kozen (2025).

Formal Languages and Automata Theory · Computer Science 2025-07-16 Shawn Ong , Dexter Kozen

We provide a complete classification of solvable instances of the equational unification problem over De Morgan and Kleene algebras with respect to unification type. The key tool is a combinatorial characterization of finitely generated…

Logic · Mathematics 2014-01-16 Simone Bova , Leonardo Cabrer

The class of all $\ast$-continuous Kleene algebras, whose description includes an infinitary condition on the iteration operator, plays an important role in computer science. The complexity of reasoning in such algebras - ranging from the…

Logic · Mathematics 2025-02-18 Stepan L. Kuznetsov , Tikhon Pshenitsyn , Stanislav O. Speranski