English
Related papers

Related papers: Satisfiability degrees for BCK-algebras

200 papers

We consider probabilistic automata on infinite words with acceptance defined by parity conditions. We consider three qualitative decision problems: (i) the positive decision problem asks whether there is a word that is accepted with…

Formal Languages and Automata Theory · Computer Science 2011-07-12 Krishnendu Chatterjee , Mathieu Tracol

We discuss the infinite dimensional algebras appearing in integrable perturbations of conformally invariant theories, with special emphasis in the structure of the consequent non-abelian infinite dimensional algebra generalizing $W_\infty$…

High Energy Physics - Theory · Physics 2015-06-26 E. Abdalla , M. C. B. Abdalla , G. Sotkov , M. Stanishkov

We obtain optimal lower and upper bounds for the (additive) integrality gaps of integer knapsack problems. In a randomised setting, we show that the integrality gap of a "typical" knapsack problem is drastically smaller than the integrality…

Optimization and Control · Mathematics 2016-11-14 Iskander Aliev , Martin Henk , Timm Oertel

We study formal languages which are capable of fully expressing quantitative probabilistic reasoning and do-calculus reasoning for causal effects, from a computational complexity perspective. We focus on satisfiability problems whose…

Artificial Intelligence · Computer Science 2023-05-17 Benito van der Zander , Markus Bläser , Maciej Liśkiewicz

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…

Logic · Mathematics 2019-05-10 Max Kanovich , Stepan Kuznetsov , Andre Scedrov

We study the computational complexity of satisfiability problems for classes of simple finite height (ortho)complemented modular lattices $L$. For single finite $L$, these problems are shown tobe $\mc{NP}$-complete; for $L$ of height at…

Logic · Mathematics 2021-01-20 Christian Herrmann

We consider the satisfiability problem for the two-variable fragment of first-order logic over finite unranked trees. We work with signatures consisting of some unary predicates and the binary navigational predicates child, right sibling,…

Logic in Computer Science · Computer Science 2014-10-22 Witold Charatonik , Emanuel Kieroński , Filip Mazowiecki

Let K be a number field. A finite group G is called K-admissible if there exists a G-crossed product K-division algebra. K-admissibility has a necessary condition called K-preadmissibility that is known to be sufficient in many cases. It is…

Number Theory · Mathematics 2011-11-23 Danny Neftin

Nuclear $C^*$-algebras having a system of completely positive approximations formed with convex combinations of a uniformly bounded number of order zero summands are shown to be approximately finite dimensional.

Operator Algebras · Mathematics 2020-05-28 Jorge Castillejos

We consider the random regular $k$-NAE-SAT problem with $n$ variables each appearing in exactly $d$ clauses. For all $k$ exceeding an absolute constant $k_0$, we establish explicitly the satisfiability threshold $d_*=d_*(k)$. We prove that…

Probability · Mathematics 2013-10-18 Jian Ding , Allan Sly , Nike Sun

This article studies the compatibility of Koenig's notion of an exact Borel subalgebra of a quasi-hereditary or, more generally, standardly stratified algebra with taking idempotent subalgebras or quotients. As an application, we provide…

Representation Theory · Mathematics 2026-04-10 Teresa Conde , Julian Külshammer

Let $\Lambda$ be a finite-dimensional associative algebra over a field. A semibrick pair is a finite set of $\Lambda$-modules for which certain Hom- and Ext-sets vanish. A semibrick pair is completable if it can be enlarged so that a…

Representation Theory · Mathematics 2023-05-25 Emily Barnard , Eric J. Hanson

Regular and higher regular graded algebras (in simplest case satisfying Von Neumann regularity $\Theta_{1}\Theta_{2}\Theta_{1}=\Theta_{1}$ instead of anticommutativity) are introduced and their properties are studied. They are described in…

Quantum Algebra · Mathematics 2007-05-23 Steven Duplij , Wladyslaw Marcinek

In this paper, we study the perfect and the insulated conductivity problems with multiple inclusions imbedded in a bounded domain in $\mathbb{R}^n, n\ge 2$. For these two extreme cases of the conductivity problems, the gradients of their…

Analysis of PDEs · Mathematics 2009-09-23 Ellen ShiTing Bao , YanYan Li , Biao Yin

We construct free cubic implication algebras with finitely many generators, and determine the size of these algebras.

Combinatorics · Mathematics 2009-02-04 Colin Bailey , Joseph Oliveira

We study the typical case properties of the 1-in-3 satisfiability problem, the boolean satisfaction problem where a clause is satisfied by exactly one literal, in an enlarged random ensemble parametrized by average connectivity and…

Statistical Mechanics · Physics 2011-11-09 Jack Raymond , Andrea Sportiello , Lenka Zdeborová

Let $\mathbb{K}$ be a finite commutative ring, and let $\mathbb{L}$ be a commutative $\mathbb{K}$-algebra. Let $A$ and $B$ be two $n \times n$-matrices over $\mathbb{L}$ that have the same characteristic polynomial. The main result of this…

Commutative Algebra · Mathematics 2020-06-09 Alberto Dennunzio , Enrico Formenti , Darij Grinberg , Luciano Margara

Given a compact subset $\Sigma$ of the real numbers obeying some technical conditions, we consider the set of algebraic integers whose conjugates all lie in $\Sigma$. The distribution of conjugates of such an integer defines a probability…

Number Theory · Mathematics 2024-03-19 Alexander Smith

A variety is said to be coherent if the finitely generated subalgebras of its finitely presented members are also finitely presented. In a recent paper by the authors it was shown that coherence forms a key ingredient of the uniform…

Logic · Mathematics 2019-02-08 Tomasz Kowalski , George Metcalfe

The logic of bunched implications (BI), introduced by O'Hearn and Pym (1999), has attracted significant attention due to its elegant proof calculus, varied semantics, and close connections to the propositional fragment of separation logic.…