Related papers: Checking Admissibility Using Natural Dualities
Checking the admissibility of quasiequations in a finitely generated (i.e., generated by a finite set of finite algebras) quasivariety Q amounts to checking validity in a suitable finite free algebra of the quasivariety, and is therefore…
This paper studies finitely generated quasivarieties of Sugihara algebras. These quasivarieties provide complete algebraic semantics for certain propositional logics associated with the relevant logic R-mingle. The motivation for the paper…
It is shown that admissible clauses and quasi-identities of quasivarieties generated by a single finite algebra, or equivalently, the quasiequational and universal theories of their free algebras on countably infinitely many generators, may…
The authors developed in a recent paper natural dualities for finitely generated quasivarieties of Sugihara algebras. They thereby identified the admissibility algebras for these quasivarieties which, via the Test Spaces Method devised by…
The theory of natural dualities provides a well-developed framework for studying Stone-like dualities induced by an algebra $\mathbf{L}$ which acts as a dualizing object when equipped with suitable topological and relational structure. The…
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…
Profinite algebras are the residually finite compact algebras; their underlying topological spaces are Stone spaces. We extend the theory of profinite algebras to a more general setting of Stone topological algebras. We introduce Stone…
We present a technique for deriving certain new natural dualities for any variety of algebras generated by a finite Heyting chain. The dualities we construct are tailored to admit a transparent translation to the more pictorial…
This is a survey on selected developments in the theory of natural dualities where the author had the opportunity to make with his foreign colleagues several breakthroughs and move the theory forward. It is aimed as author's reflection on…
We observe that a certain kind of algebraic proof - which covers essentially all known algebraic circuit lower bounds to date - cannot be used to prove lower bounds against VP if and only if what we call succinct hitting sets exist for VP.…
We propose a general methodology for testing whether a given polynomial with integer coefficients is identically zero. The methodology evaluates the polynomial at efficiently computable approximations of suitable irrational points. In…
The multifractal formalism for measures in its original formulation is checked for special classes of measures such as doubling, self-similar, and Gibbs-like ones. Out of these classes, suitable conditions should be taken into account to…
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…
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…
We prove a semisimplicity criterion for a large class of algebras by a new method. This can be applied to Brauer, BMW, and $q$-Brauer algebras.
In natural duality theory, the piggybacking technique is a valuable tool for constructing dualities. As originally devised by Davey and Werner, and extended by Davey and Priestley, it can be applied to finitely generated quasivarieties of…
The most developed aspect of the theory of finite semigroups is their classification in pseudovarieties. The main motivation for investigating such entities comes from their connection with the classification of regular languages via…
Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…
Cluster algebras are a recent topic of study and have been shown to be a useful tool to characterize structures in several knowledge fields. An important problem is to establish whether or not a given cluster algebra is of finite type.…
We review and compare five ways of assigning totally ordered sizes to subsets of the natural numbers: cardinality, infinite lottery logic with mirror cardinalities, natural density, generalised density, and $\alpha$-numerosity. Generalised…