Related papers: Term satisfiability in FL$_\mathrm{ew}$-algebras
We investigate completeness and parametricity for a general class of realizability semantics for System F defined in terms of closure operators over sets of $\lambda$-terms. This class includes most semantics used for normalization…
The relationship between the quasi-exactly solvable problems and W-algebras is revealed. This relationship enabled one to formulate a new general method for building multi-dimensional and multi-channel exactly and quasi-exactly solvable…
A general theorem due to Howe of dual action of a classical group and a certain non-associative algebra on a space of symmetric or alternating tensors is reformulated in a setting of second quantization, and familiar examples in atomic and…
We investigate the equational theory of Kleene algebra terms with variable complements -- (language) complement where it applies only to variables -- w.r.t. languages. While the equational theory w.r.t. languages coincides with the language…
Finite versions of W-algebras are introduced by considering (symplectic) reductions of finite dimensional simple Lie algebras. In particular a finite analogue of $W^{(2)}_3$ is introduced and studied in detail. Its unitary and non-unitary,…
The purpose of the present thesis is to give a self-contained review of the solvable Lie algebra approach to supergravity problems related with S, T and U dualities. After recalling the general features of dualities in both Superstring…
$W$-algebras are certain algebraic structures associated to a finite dimensional Lie algebra $\mathfrak g$ and a nilpotent element $f$ via Hamiltonian reduction. In this note we give a review of a recent approach to the study of (classical…
This is the second in a series of articles aimed at exploring the relationship between the complexity classes of P and NP. The research in this article aims to find conditions of an algorithmic nature that are necessary and sufficient to…
Proving proof-size lower bounds for $\mathbf{LK}$, the sequent calculus for classical propositional logic, remains a major open problem in proof complexity. We shed new light on this challenge by isolating the power of structural rules,…
W-algebras of finite type are certain finitely generated associative algebras closely related to the universal enveloping algebras of semisimple Lie algebras. In this paper we prove a conjecture of Premet that gives an almost complete…
An algebraically expandable (AE) class is a class of algebraic structures axiomatizable by sentences of the form $\forall \exists! \land p = q$. For a logic $L$ algebraized by a quasivariety $\mathcal{Q}$ we show that the AE-subclasses of…
We investigate conditions for the extendibility of continuous algebra homomorphisms $\phi$ from the Fourier algebra $A(F)$ of a locally compact group $F$ to the Fourier-Stieltjes algebra $B(G)$ of a locally compact group $G$ to maps between…
This paper concerns the notion of a symmetric algebra and its generalization to a quasi-symmetric algebra. We study the structure of these algebras in respect to their hull-kernel regularity and existence of some ideals, especially the…
We present a novel approach to the construction of new finite algebras and describe the congruence lattices of these algebras. Given a finite algebra $(B_0, \dots)$, let $B_1, B_2, \dots, B_K$ be sets that either intersect $B_0$ or…
Classical affine Lie algebras appear e.g. as symmetries of infinite dimensional integrable systems and are related to certain differential equations. They are central extensions of current algebras associated to finite-dimensional Lie…
Quasi-Boolean algebras were introduced as the generalization of Boolean algebras in the setting of quantum computation logic. In this paper, we investigate the completeness and congruences of quasi-Boolean algebras. First, we discuss the…
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satisfiability threshold has centered around the structure and…
This paper proposes a new category theoretic account of equationally axiomatizable classes of algebras. Our approach is well-suited for the treatment of algebras equipped with additional computationally relevant structure, such as ordered…
Term algebras are important objects in computer science and are correspondingly well-studied. A natural generalization is to quotient these algebras by finitely many ground term equations, obtaining what we call almost free algebras. One of…
Recently, the separated fragment (SF) has been introduced and proved to be decidable. Its defining principle is that universally and existentially quantified variables may not occur together in atoms. The known upper bound on the time…