Related papers: The Lambek-Grishin calculus is NP-complete
The displacement calculus $\mathbf{D}$ is a conservative extension of the Lambek calculus $\mathbf{L1}$ (with empty antecedents allowed in sequents). $\mathbf{L1}$ can be said to be the logic of concatenation, while $\mathbf{D}$ can be said…
Provability logic GLP is well-known to be incomplete w.r.t. Kripke semantics. A natural topological semantics of GLP interprets modalities as derivative operators of a polytopological space. Such spaces satisfying all the axioms of GLP are…
We prove that the problems of deciding whether a quadratic equation over a free group has a solution is NP-complete.
We examine cyclic, non-well-founded and well-founded derivations in the provability logic $\mathsf{GLP}$. While allowing cyclic derivations does not change the system, the non-well-founded and well-founded derivations we consider define the…
In this note we introduce a notion of a generically (strongly generically) NP-complete problem and show that the randomized bounded version of the halting problem is strongly generically NP-complete.
In this paper we study the conjugacy problem in polycyclic groups. Our main result is that we construct polycyclic groups $G_n$ whose conjugacy problem is at least as hard as the subset sum problem with $n$ indeterminates. As such, the…
We introduce proper display calculi for intuitionistic, bi-intuitionistic and classical linear logics with exponentials, which are sound, complete, conservative, and enjoy cut-elimination and subformula property. Based on the same design,…
We study an extension of the Distributive Full Non-associative Lambek Calculus with iterative division operators. The iterative operators can be seen as representing iterative composition of linguistic resources or of actions. A complete…
Using the probability theory-based approach, this paper reveals the equivalence of an arbitrary NP-complete problem to a problem of checking whether a level set of a specifically constructed harmonic cost function (with all diagonal entries…
We consider the (de)focusing cubic Gross-Pitaevskii (GP) hierarchy on $\mathbb{R}$, which is an infinite hierarchy of coupled linear inhomogeneous PDE which appears in the derivation of the cubic nonlinear Schr\"{o}dinger (NLS) equation…
Lambeks Syntactic Calculus, commonly referred to as the Lambek calculus, was innovative in many ways, notably as a precursor of linear logic. But it also showed that we could treat our grammatical framework as a logic (as opposed to a…
We show that the associated Lie algebra of the Malcev $\mathbb{Q}$-completion of the lamplighter group is the pronilpotent completion of the lamplighter Lie algebra. We also prove that the homology of this completed Lie algebra is of…
We prove that derived equivalent algebras have isomorphic differential calculi in the sense of Tamarkin--Tsygan.
The Gr\"atzer-Schmidt theorem of lattice theory states that each algebraic lattice is isomorphic to the congruence lattice of an algebra. We study the reverse mathematics of this theorem. We also show that the set of indices of computable…
We prove that the quiver problem is NP complete.
We give the solution to the complete noncommutative Kadomtsev--Petviashvili (KP) hierarchy. We achieve this via direct linearisation which involves the Gelfand--Levitan--Marchenko (GLM) equation. This is a linear integral equation in which…
For a given complete lattice L, we investigate whether L can be decomposed as a direct product of directly indecomposable lattices. We prove that this is the case if every element of L is a join of join-irreducible elements and dually, thus…
The Lambek calculus can be considered as a version of non-commutative intuitionistic linear logic. One of the interesting features of the Lambek calculus is the so-called "Lambek's restriction," that is, the antecedent of any provable…
We prove that the graph of the logit equilibrium correspondence is a smooth manifold, which uniformly approximates the graph of the Nash equilibrium manifold.
Some classical graph problems such as finding minimal spanning tree, shortest path or maximal flow can be done efficiently. We describe slight variations of such problems which are shown to be NP-complete. Our proofs use straightforward…