On disjunctions of algebraic sets in completely simple semigroups

A semigroup S is called an equational domain if any finite union of algebraic sets over S is algebraic. We give some necessary and su?cient conditions for a completely simple semigroup to be an equational domain.     

Algebras Defined from Ordered Sets and the Varieties they Generate

We investigate ways of representing ordered sets as algebras and how the order relation is reflected in the algebraic properties of the variety (equational class) generated by these algebras. In particular we consider two different but related methods for constructing an algebra with one binary operation from an arbitrary ordered set with a top element. The two varieties generated by all these algebras are shown to be well-behaved in that they are locally finite, finitely based, and have an equationally definable order relation. We exhibit a bijection between the subdirectly irreducible algebras in each variety and the class of all ordered sets with top element. We determine the structure and cardinality of the free algebra on n-free generators and provide sharp bounds on the number of n-generated algebras in each variety. These enumeration results involve the number of quasi-orders on an n-element set.     

A proof of Lyndon's finite basis theorem

A new proof is given of the theorem, originally proved by R.C. Lyndon, that any two element algebra of finite similarity type has a finite basis for its equations. We also provide a new proof of a result of W. Taylor that any equational class generated by a two element algebraic system contains only a finite number of subdirectly irreducible members, each of which is finite. The original proofs of these two theorems relied on E.L. Post's classification of the two element algebraic systems. Our paper uses instead some recent results from universal algebra.     

基于关系代数的软集合理论研究与应用

基于关系代数理论中的部分思想,定义了软集合理论中的差运算、选择运算和投影运算.探讨了关系代数和软集合的关系,运用关系代数的选择、投影、并、差等运算实现了软集合参数约简算法,并用SQL语言实现了算法.最后将算法运用到房屋置业选择问题中进行验证.结果表明,软集合方法能以一种更简单直接的形式为决策问题提供有效的参考依据.     

Gentzen-style axiomatizations in equational logic

The notion of a Gentzen-style axiomatization of equational theories is presented. In the standard deductive systems for equational logic axioms take the form of equations and the inference rules can be viewed as quasi-equations. In the deductive systems for quasi-equational logic the axioms, which are quasi-equations, can be viewed as sequents and the inference rules as Gentzen-style rules. It is conjectured that every finite algebra has a finite Gentzen-style axiomatization for its quasi-identities. We verify this conjecture for a class of algebras that includes all finite algebras without proper subalgebras and all finite simple algebras that are embeddable into the free algebra of their variety.Dedicated to the memory of Alan DayPresented by J. Sichler.Supported by an Iowa State University Research Assistantship.Supported by National Science Foundation Grant #DMS 8005870.     

Characterization of binary polynomials of idempotent algebras

In this paper, we characterize the set of all binary algebraic (or polynomial) operations of an idempotent algebra that has at least one r-ary algebraic operation, (r ≥ 2), depending on every variable such that there is no an (r+2)-ary algebraic operation depending on at least (r+1) variables. We prove that this set forms a finite Boolean algebra, and then we characterize this Boolean algebra.     

Finitely Deep Matrices

In the algebraic study of deep matrices ? _X () on a finite set of indices over a field, Christopher Kennedy has recently shown that there is a unique proper ideal  whose quotient is a central simple algebra. He showed that this ideal, which doesn't appear for infinite index sets, is itself a central simple algebra. In this article we extend the result to deep matrices with a finite set of 2 or more indices over an arbitrary coordinate algebra A, showing that when the coordinates are simple there is again such a unique proper ideal, and in general that the lattice of ideals of ? _X (A)/ and  are isomorphic to the lattice of ideals of the coordinate algebra A.     

Bounded BCK‐algebras and their generated variety

In this paper we prove that the equational class generated by bounded BCK‐algebras is the variety generated by the class of finite simple bounded BCK‐algebras. To obtain these results we prove that every simple algebra in the equational class generated by bounded BCK‐algebras is also a relatively simple bounded BCK‐algebra. Moreover, we show that every simple bounded BCK‐algebra can be embedded into a simple integral commutative bounded residuated lattice. We extend our main results to some richer subreducts of the class of integral commutative bounded residuated lattices and to the involutive case. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

SECOND-ORDER BOOLEAN ALGEBRAS

Opgedra aan Prof. Hennie Schutte by geleentheid van sy sestigste verjaarsdag.

Abstract

A Boolean algebra is the algebraic version of a field of sets. The complex algebra C(B) of a Boolean algebra B is defined over the power set of B; it is a field of sets with extra operations. The notion of a second-order Boolean algebra is intended to be the algebraic version of the complex algebra of a Boolean algebra. To this end a representation theorem is proved.     

Pseudo definably connected definable sets

In o‐minimal structures, every cell is definably connected and every definable set is a finite union of its definably connected components. In this note, we introduce pseudo definably connected definable sets in weakly o‐minimal structures having strong cell decomposition, and prove that every strong cell in those structures is pseudo definably connected. It follows that every definable set can be written as a finite union of its pseudo definably connected components. We also show that the projections of pseudo definably connected definable sets are pseudo definably connected. Finally, we compare pseudo definable connectedness with (recently introduced) weak definable connectedness of definable sets in weakly o‐minimal structures.     

Algebraic geometry in first-order logic

In every variety of algebras Θ, we can consider its logic and its algebraic geometry. In previous papers, geometry in equational logic, i.e., equational geometry, has been studied. Here we describe an extension of this theory to first-order logic (FOL). The algebraic sets in this geometry are determined by arbitrary sets of FOL formulas. The principal motivation of such a generalization lies in the area of applications to knowledge science. In this paper, the FOL formulas are considered in the context of algebraic logic. For this purpose, we define special Halmos categories. These categories in algebraic geometry related to FOL play the same role as the category of free algebras Θ⁰ play in equational algebraic geometry. This paper consists of three parts. Section 1 is of introductory character. The first part (Secs. 2–4) contains background on algebraic logic in the given variety of algebras Θ. The second part is devoted to algebraic geometry related to FOL (Secs. 5–7). In the last part (Secs. 8–9), we consider applications of the previous material to knowledge science. __________ Translated from Sovremennaya Matematika i Ee Prilozheniya (Contemporary Mathematics and Its Applications), Vol. 22, Algebra and Geometry, 2004.     

Abstract Hilbert Schemes

In analogy with classical projective algebraic geometry, Hilbert functors can be defined for objects in any Abelian category. We study the moduli problem for such objects. Using Grothendieck's general framework. We show that with suitable hypotheses the Hilbert functor is representable by an algebraic space locally of finite type over the base field. For the category of the graded modules over a strongly Noetherian graded ring, the Hilbert functor of graded modules with a fixed Hilbert series is represented by a commutative projective scheme. For the projective scheme corresponding to a suitable noncommutative graded algebra, the Hilbert functor is represented by a countable union of commutative projective schemes.     

Algebras of multiplace functions for signatures containing antidomain

We define antidomain operations for algebras of multiplace partial functions. For all signatures containing composition, the antidomain operations and any subset of intersection, preferential union and fixset, we give finite equational or quasiequational axiomatisations for the representation class. We do the same for the question of representability by injective multiplace partial functions. For all our representation theorems, it is an immediate corollary of our proof that the finite representation property holds for the representation class. We show that for a large set of signatures, the representation classes have equational theories that are coNP-complete.     

Linear associative algebras with finitely many idempotents

Let A be a linear (i.e., finite-dimensional) associative algebra with unity defined over K, an algebraically closed field. Then A with respect to its multiplication is an algebraic monoid over k, denoted by A_M, and with respect to the the bracket forms a Lie algebra over K, denoted by A_L. The following theorem is established A_M is nilpotent as an algebraic monoid (equivalentlyA_L is so as a Lie algebra) if and only if the set of idempotents of A is finite if and only if all irreducible closed submonoids of codimension 1 are nilpotent.     

Traces on simple AF C1-algebras

The relations between the set of traces on a simple approximately finite dimensional C¹-algebra A and the algebraic and geometric properties of the Elliott dimension group K₀(A) are studied. It is shown that every metrizable Choquet simplex occurs as the set of normalized traces of a simple unital AF algebra. A simple AF algebra can have both finite and infinite traces, so a finite simple AF algebra need not be algebraically simple. It is shown that a simple AF algebra is algebraically simple if and only if it has no infinite traces, and is stable if and only if it has no finite traces.     

An algebraic treatment of quantifier-free systems of arithmetic

By algebraic means, we give an equational axiomatization of the equational fragments of various systems of arithmetic. We also introduce a faithful semantics according to which, for every reasonable system for arithmetic, there is a model where exactly the theorems of are true. Received March 20, 1995