相关论文: Words and Dominions
We show that the class of representable substitution algebras is characterized by a set of universal first order sentences. In addition, it is shown that a necessary and sufficient condition for a substitution algebra to be representable is…
Dominions, in the sense of Isbell, are investigated in the context of decomposable varieties of groups. An upper and lower bound for dominions in such a variety is given in terms of the two varietal factors, and the internal structure of…
A semigroup $S$ is called an equational domain if any finite union of algebraic sets over $S$ is algebraic. We prove some necessary and sufficient conditions for a completely simple semigroup to be an equational domain.
An argument used to show that certain varieties of nilpotent groups have instances of nontrivial dominions is considered, and generalized. The same is done with the argument used to show that there are nontrivial dominions in the variety of…
In universal algebraic geometry, an algebra is called an equational domain if the union of two algebraic sets is algebraic. We characterize equational domains, with respect to polynomial equations, inside congruence permutable varieties,…
Give deterministic necessary and sufficient conditions to guarantee that if a subspace fits certain partially observed data from a union of subspaces, it is because such data really lies in a subspace. Furthermore, Give deterministic…
When given a class of functions and a finite collection of sets, one might be interested whether the class in question contains any function whose domain is a subset of the union of the sets of the given collection and whose restrictions to…
The principle behind algebraic language theory for various kinds of structures, such as words or trees, is to use a compositional function from the structures into a finite set. To talk about compositionality, one needs some way of…
We obtain a necessary and sufficient condition for an algebraic set in a group to have a fully characteristic radical. As a result, we see that if the radical of a system of equation $S$ over a group $G$ is fully characteristic, then there…
First order formulas in a relational signature can be considered as operations on the relations of an underlying set, giving rise to multisorted algebras we call first order algebras. We present universal axioms so that an algebra satisfies…
We introduce the notion of a cellular system in order to deal with quasi-hereditary algebras. We shall prove that a necessary and sufficient condition for an algebra to be quasi-hereditary is the existence of a full divisible cellular…
Superposition is an established decision procedure for a variety of first-order logic theories represented by sets of clauses. A satisfiable theory, saturated by superposition, implicitly defines a minimal term-generated model for the…
A finite-dimensional unital and associative algebra over $\mathbb{R}$, or what we shall call simply "an algebra" in this paper for short, generalities the construction by which we derive the complex numbers by "adjoining an element $i$" to…
We give necessary and sufficient conditions for weak and strong embeddability of amalgams in each subvariety of the category of all nilpotent groups of class at most two; this generalizes B. Maier's result for the latter class. We also…
We define a monoidal semantics for algebraic theories. The basis for the definition is provided by the analysis of the structural rules in the term calculus of algebraic languages. Models are described both explicitly, in a form that…
A necessary and sufficient condition is provided for the solvability of a binomial congruence with a composite modulus, circumventing its prime factorization. This is a generalization of Euler's Criterion through that of Euler's Theorem,…
In decision theory an act is a function from a set of conditions to the set of real numbers. The set of conditions is a partition in some algebra of events. The expected value of an act can be calculated when a probability measure is given.…
The concepts of a conditional set, a conditional inclusion relation and a conditional Cartesian product are introduced. The resulting conditional set theory is sufficiently rich in order to construct a conditional topology, a conditional…
All subalgebras, idempotents, left(right) ideals and left quasi-units of two-dimensional algebras are described. Classification of algebras with given number of subalgebras, left(right) ideals are provided. In particular, a list of…
A semigroup $S$ is called an equational domain (e.d.) if any finite union of algebraic sets over $S$ is algebraic. For a semigroup $S$ with a finite ideal we find the necessary and sufficient conditions to be an e.d.