English
Related papers

Related papers: Satisfiability degrees for BCK-algebras

200 papers

An early result in the theory of Natural Dualities is that an algebra with a near unanimity (NU) term is dualizable. A converse to this is also true: if V(A) is congruence distributive and A is dualizable, then A has an NU term. An…

Rings and Algebras · Mathematics 2019-06-07 Matthew Moore

It is well-known that if a subset A of a finite Abelian group G satisfies a quasirandomness property called uniformity of degree k, then it contains roughly the expected number of arithmetic progressions of length k, that is, the number of…

Number Theory · Mathematics 2014-02-26 W. T. Gowers , J. Wolf

Almost sure convergence rates for linear algorithms $h_{k+1} = h_k +\frac{1}{k^\chi} (b_k-A_kh_k)$ are studied, where $\chi\in(0,1)$, $\{A_{k}\}_{k=1}^\infty$ are symmetric, positive semidefinite random matrices and $\{b_{k}\}_{k=1}^\infty$…

Statistics Theory · Mathematics 2015-01-13 Michael A. Kouritzin , Samira Sadeghi

We investigate several consequences of inclusion relations between quantified provability logics. Moreover, we give a necessary and sufficient condition for the inclusion relation between quantified provability logics with respect to…

Logic · Mathematics 2021-05-25 Taishi Kurahashi

The paper explores the correspondence between balanced incomplete block designs (BIBD) and certain linear CNF formulas by identifying the points of a block design with the clauses of the Boolean formula and blocks with Boolean variables.…

Computational Complexity · Computer Science 2020-10-08 Bernd. R. Schuh

The topic of this paper is the Finiteness Conjecture for minimally unsatisfiable clause-sets (MUs), stating that for each fixed deficiency (number of clauses minus number of variables) there are only finitely many patterns, given a certain…

Discrete Mathematics · Computer Science 2016-04-06 Oliver Kullmann , Xishun Zhao

We investigate the computational properties of the spatial algebra RCC-5 which is a restricted version of the RCC framework for spatial reasoning. The satisfiability problem for RCC-5 is known to be NP-complete but not much is known about…

Artificial Intelligence · Computer Science 2009-09-25 P. Jonsson , T. Drakengren

This note considers checking satisfiability of sets of propositional clauses (SAT instances). It shows that "unipolar sets" of clauses (containing no positive or no negative clauses) provide an "early sign" of satisfiability of SAT…

Logic in Computer Science · Computer Science 2016-12-16 Eliezer L. Lozinskii

Completeness and transitivity are standard rationality conditions in economics. However, under ambiguity, decision makers sometimes violate these requirements because of the difficulty of forming accurate predictions about ambiguous events.…

Theoretical Economics · Economics 2025-09-16 Kensei Nakamura , Shohei Yanagita

Let $k$ be an algebraically closed field. It is known that any stable equivalence between standard representation-finite self-injective $k$-algebras (without block of Loewy length 2) lifts to a standard derived equivalence, in particular,…

Representation Theory · Mathematics 2022-03-11 Nengqun Li , Yuming Liu

In this paper, we introduce the concept of a (lattice) skew Hilbert algebra as a natural generalization of Hilbert algebras. This notion allows a unified treatment of several structures of prominent importance for mathematical logic, e.g.…

Logic · Mathematics 2021-05-19 Ivan Chajda , Kadir Emir , Davide Fazio , Helmut Länger , Antonio Ledda , Jan Paseka

We study uniform perturbations of intermediate C*-subalgebras of inclusions of simple C*-algebras. If a unital simple C*-algebra has a simple C*-subalgebra of finite index, then sufficiently close simple intermediate C*-subalgebras are…

Operator Algebras · Mathematics 2017-05-17 Shoji Ino , Yasuo Watatani

Given a graph of C*-algebras, we prove a long exact sequence in KK-theory for both the maximal and the vertex-reduced fundamental C*-algebras in the presence of possibly non GNS-faithful conditional expectations. We deduce from it the…

Operator Algebras · Mathematics 2016-12-28 Fima Pierre , Germain Emmanuel

The variety of bicommutative algebras is the class of all nonassociative algebras satisfying the polynomial identities $(x_1x_2)x_3=(x_1x_3)x_2$ and $x_1(x_2x_3)=x_2(x_1x_3)$. In this paper we provide a complete description of varieties of…

Rings and Algebras · Mathematics 2026-05-12 Vesselin Drensky , Bekzat Zhakhayev

We identify a class of smooth Banach *-algebras that are differential subalgebras of commutative C*-algebras whose openness of multiplication is completely determined by the topological stable rank of the target C*-algebra. We then show…

Operator Algebras · Mathematics 2024-11-27 Tomasz Kania , Natalia Maślany

Motivated by advances in categorical probability, we introduce non-commutative almost everywhere (a.e.) equivalence and disintegrations in the setting of C*-algebras. We show that C*-algebras (resp. W*-algebras) and a.e. equivalence classes…

Quantum Physics · Physics 2023-12-18 Arthur J. Parzygnat , Benjamin P. Russo

We determine the structure of the BPS algebra of 2-Calabi-Yau Abelian categories for which the stack of objects admits a good moduli space. We prove that this algebra is isomorphic to the positive part of the enveloping algebra of a…

Representation Theory · Mathematics 2025-11-25 Ben Davison , Lucien Hennecart , Sebastian Schlegel Mejia

Let $k$ be a field of characteristic zero and $B$ a commutative integral domain that is also a finitely generated $k$-algebra. It is well known that if $k$ is algebraically closed and the "Field Makar-Limanov" invariant FML$(B)$ is equal to…

Algebraic Geometry · Mathematics 2018-06-29 Daniel Daigle

A variety V is said to be coherent if any finitely generated subalgebra of a finitely presented member of V is finitely presented. It is shown here that V is coherent if and only if it satisfies a restricted form of uniform deductive…

Logic · Mathematics 2018-03-28 Tomasz Kowalski , George Metcalfe

There exist initial segments of both the Dyment lattice and the Dyment-Muchnik lattice that yield Brouwer algebras modeling exactly the intuitionistic propositional calculus. For the Dyment-Muchnik lattice, this result is obtained by…