Related papers: Term satisfiability in FL$_\mathrm{ew}$-algebras

Based on the intrinsic connection between Gaussian Free Fields and the Heisenberg vertex algebra, we study some aspects of the correspondence between probability theory and $W$-algebras. This is first achieved by providing a construction of…

For formulas F of propositional calculus I introduce a "metavariable" MF and show how it can be used to define an algorithm for testing satisfiability. MF is a formula which is true/false under all possible truth assignments iff F is…

Boolean satisfiability problem has applications in various fields. An efficient algorithm to solve satisfiability problem can be used to solve many other problems efficiently. The input of satisfiability problem is a finite set of clauses.…

Let K be a field of characteristic zero. Motivated by the conjecture that an enveloping algebra U(g) is Noetherian only if g is finite dimensional, we define the notion of weakly Noetherian Lie algebras. The main result, Theorem A, states…

We consider the long-standing question of whether every regular LB-space is complete. This problem has been open since the 1950s and originates in Grothendieck's early work in functional analysis. Rather than seeking a direct proof or…

We study elementary modal logics, i.e. modal logic considered over first-order definable classes of frames. The classical semantics of modal logic allows infinite structures, but often practical applications require to restrict our…

The notions of conformal Lie 2-algebras and conformal omni-Lie algebras are introduced and studied. It is proved that the category of conformal Lie 2-algebras and the category of 2-term conformal $L_{\infty}$-algebras are equivalent. We…

We compare three satisfiability notions for propositional formulas in the language {not, and, or} over a fixed finite-dimensional Hilbert space H=F^d with F in {R, C}. The first is the standard Hilbert-lattice semantics on the subspace…

We present a new look at description of real finite-dimensional Lie algebras. The basic element turns out to be a pair $(F,v)$ consisting of a linear mapping $F\in End(V)$ and its eigenvector $v$. This pair allows to build a Lie bracket on…

We exhibit an adjunction between a category of abstract algebras of partial functions and a category of set quotients. The algebras are those atomic algebras representable as a collection of partial functions closed under relative…

For a locally compact Hausdorff semigroup S, the $L^\infty$ representation algebra R(S) was extensively studied by Dunkl and Ramirez. The Fourier-Stieltjes algebra F(S) of a topological semigroup was studied by Lau. The aim of this paper is…

Determining when a finite dimensional algebra satisfies the finiteness property known as the $(\textbf{Fg})$-condition is of fundamental importance in the celebrated and influential theory of support varieties. We give an answer to this…

We study fragments of first-order logic and of least fixed point logic that allow only unary negation: negation of formulas with at most one free variable. These logics generalize many interesting known formalisms, including modal logic and…

We generalize a theorem by Francois Fages that describes the relationship between the completion semantics and the answer set semantics for logic programs with negation as failure. The study of this relationship is important in connection…

In this paper a characterisation is given of solvable complemented Lie algebras. They decompose as a direct sum of abelian subalgebras and their ideals relate nicely to this decomposition. The class of such algebras is shown to be a…

We introduce and investigate different definitions of effective amenability, in terms of computability of F{\o}lner sets, Reiter functions, and F{\o}lner functions. As a consequence, we prove that recursively presented amenable groups have…

We classify the complexity of the satisfiability problem for extensions of CTL and UB. The extensions we consider are Boolean combinations of path formulas, fairness properties, past modalities, and forgettable past. Our main result shows…

We study the complexity of satisfiability problems in probabilistic and causal reasoning. Given random variables $X_1, X_2,\ldots$ over finite domains, the basic terms are probabilities of propositional formulas over atomic events $X_i =…

A Hom-Lie algebra $(L, \alpha_L)$ is said to be capable if there exists a Hom-Lie algebra $(H, \alpha_H)$ such that $L \cong H/Z(H)$. We obtain a characterisation of capable Hom-Lie algebras involving its epicentre and we use this theory to…

In this work we study the notions of structural and universal completeness both from the algebraic and logical point of view. In particular, we provide new algebraic characterizations of quasivarieties that are actively and passively…