Related papers: Term satisfiability in FL$_\mathrm{ew}$-algebras
We develop techniques at the interface between differential algebra and model theory to study the following problems of exponential algebraicity: Does a given algebraic differential equation admits an exponentially algebraic solution, that…
Functorial properties of the correspondence between commutative BV$_\infty$-algebras and L$_\infty$-algebras are investigated. The category of L$_\infty$-algebras with L$_\infty$-morphisms is characterized as a certain category of pure…
We develop dualities for complete perfect distributive quasi relation algebras and complete perfect distributive involutive FL-algebras. The duals are partially ordered frames with additional structure. These frames are analogous to the…
Many procedures for SAT and SAT-related problems -- in particular for those requiring the complete enumeration of satisfying truth assignments -- rely their efficiency on the detection of partial assignments satisfying an input formula. In…
We review the new approach to the theory of nonlinear $W$-algebras which is developed recently and called {\it conformal linearization}. In this approach $W$-algebras are embedded as subalgebras into some {\it linear conformal} algebras…
Ono's modal FL-algebras are models of an extension of Full Lambek logic that has the modalities ! and ? of linear logic. Here we define a notion of modal FL-cover system that combines aspects of Beth-Kripke-Joyal semantics with Girard's…
Unbounded {\L}ukasiewicz logic is a substructural logic that combines features of infinite-valued {\L}ukasiewicz logic with those of abelian logic. The logic is finitely strongly complete w.r.t.~the additive $\ell$-group on the reals…
Weakly dicomplemented lattices are bounded lattices equipped with two unary operations to encode a negation on {\it concepts}. They have been introduced to capture the equational theory of concept algebras \cite{Wi00}. They generalize…
We investigate the satisfiability degree of some equations in finite BCK-algebras; that is, given a finite BCK-algebra and an equation in the language of BCK-algebras, what is the probability that elements chosen uniformly randomly with…
One of the traditional applications of relation algebras is to provide a setting for infinite-domain constraint satisfaction problems. Complexity classification for these computational problems has been one of the major open research…
Given an L_{\omega_1 \omega}-elementary class C, that is the collection of the countable models of some L_{\omega_1 \omega}-sentence, denote by \cong_C and \equiv_C the analytic equivalence relations of, respectively, isomorphism and…
A characterization of the finite-dimensional Leibniz algebras with an abelian subalgebra of codimension two over a field $\mathbb{F}$ of characteristic $p\neq2$ is given. In short, a finite-dimensional Leibniz algebra of dimension $n$ with…
A $\mu$-algebra is a model of a first order theory that is an extension of the theory of bounded lattices, that comes with pairs of terms $(f,\mu_{x}.f)$ where $\mu_{x}.f$ is axiomatized as the least prefixed point of $f$, whose axioms are…
For a large class of finite W algebras, the defining relations of a Yangian are proved to be satisfied. Therefore such finite W algebras appear as realisations of Yangians. This result is useful to determine properties of such W algebra…
It is shown that the closure of the infinitesimal symmetry transformations underlying classical ${\cal W}$ algebras give rise to L$_\infty$ algebras with in general field dependent gauge parameters. Therefore, the class of well understood…
We prove two completeness results for Kleene algebra with tests and a top element, with respect to guarded string languages and binary relations. While the equational theories of those two classes of models coincide over the signature of…
Satisfiability of Boolean circuits is among the most known and important problems in theoretical computer science. This problem is NP-complete in general but becomes polynomial time when restricted either to monotone gates or linear gates.…
We revisit G. Elek's notion of amenable representation type, where algebras are characterised by every indecomposable module being "almost" the direct sum of modules of bounded dimension. We give a new proof of his result that string…
Louveau and Rosendal [5] have shown that the relation of bi-embeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This…
We show that satisfiability for CTL* with equality-, order-, and modulo-constraints over Z is decidable. Previously, decidability was only known for certain fragments of CTL*, e.g., the existential and positive fragments and EF.