Grothendieck-like duality for Heyting algebras

In this paper we shall use the multipliers in order to define a sheaf on the prime spectrum of a Heyting algebra. This construction allows us to obtain a Grothendieck-style duality for Heyting algebras. Received March 3, 2000; accepted in final form February 16, 2001.     

Endodualisable and endoprimal finite double Stone algebras

The finite endodualisable double Stone algebras are characterised, and every finite endoprimal double Stone algebra is shown to be endodualisable. Received February 24, 1999; accepted in final form May 10, 1999.     

A criterion for a finite endoprimal algebra to be endodualisable

In this note the strategy for finding endoprimal algebras due to B. A. Davey and J. G. Pitkethly is further explored in the finite case. The Retraction Test Algebra Lemma is used as a tool to show that, in many quasivarieties, endoprimality is equivalent to endodualisability for finite algebras which are suitably related to finitely generated free algebras. Received September 2, 1998; accepted in final form June 3, 1999.     

Lattice orders on matrix algebras

We construct all the lattice orders (up to isomorphism) on a full matrix algebra over a subfield of the field of real numbers so that it becomes a lattice-ordered algebra. Received June 26, 2001; accepted in final form February 9, 2002.     

Equational bases for varieties of Ockham algebras

We consider the variety O of Ockham algebras and its subvarieties of the form P _m,n (m > n ≥0), sometimes with an additional condition. We use Priestley duality and a remarkable theorem of Urquhart to develop a simple method for determining the equational bases of the subvarieties. The axioms that we obtain have the same canonical form and involve few variables. We illustrate our method by the detailed study of the variety MS ₂ and some considerations about P _3,2. Received July 28, 1998; accepted in final form May 25, 2000.     

Flat and weakly flat projection algebras

The notion of a projection algebra was first introduced in [4] by Ehrig et al. as an algebraic version of ultrametric spaces. Computer scientists use this notion as a convenient means of algebraic specification of process algebras. Some algebraic notions regarding these algebras have been studied in [1], [2], [5]. The flat projection algebras have been investigated by the authors in [1]. Here we completely characterize flat and weakly flat (m-separated and separated) projection algebras. Received November 19, 2001; accepted in final form December 1, 2002. RID="h1" ID="h1"     

A non-dualisable entropic algebra

We give an example of a five-element unary algebra which is entropic but does not admit a natural duality. Received September 26, 2000; accepted in final form April 4, 2001.     

Functional monadic Heyting algebras

We show every monadic Heyting algebra is isomorphic to a functional monadic Heyting algebra. This solves a 1957 problem of Monteiro and Varsavsky [9]. Received May 18, 2001; accepted in final form October 18, 2001.     

Contractors and connectors of graph algebras

We study generalizations of the “contraction‐deletion” relation of the Tutte polynomial, and other similar simple operations, to other graph parameters. The question can be set in the framework of graph algebras introduced by Freedman at al [Reflection positivity, rank connectivity, and homomorphisms of graphs, J. Amer. Math. Soc. 20 (2007), 37–51.] Graph algebras are defined by a graph parameter, and they were introduced in order to study and characterize homomorphism functions. We prove that for homomorphism functions, these graph algebras have special elements called “contractors” and “connectors”. This gives a new characterization of homomorphism functions. © 2008 Wiley Periodicals, Inc. J Graph Theory 60: 11–30, 2009     

Ideal extensions of graph algebras

Let A and B be graph algebras. In this paper we present the notion of an ideal in a graph algebra and prove that an ideal extension of A by B always exists. We describe (up to isomorphism) all such extensions.     

Axiomatizing complex algebras by games

Given a variety , we provide an axiomatization of the class of complex algebras of algebras in . can be obtained effectively from the axiomatization of ; in fact, if this axiomatization is recursively enumerable, then is recursive. Received January 18, 2000; accepted in final form December 18, 2000.     

On clones, transformation monoids, and finite Boolean algebras

We prove that, for a finite Boolean algebra, there exist only finitely many clones which consist of polynomial functions of the algebra and contain the monoid of its unary polynomial functions. Received January 7, 2000; accepted in final form December 13, 2000.     

Degree of matrix relation algebras

We show that a relation algebra and its n-matrix relation algebra have the same degree for all positive integers n. An intermediate result relates the degree of a relation algebra to the degree of a relativization with respect to equivalence elements. Received July 18, 2001; accepted in final form April 24, 2002.     

Matrix relation algebras

Square matrices over a relation algebra are relation algebras in a natural way. We show that for fixed n, these algebras can be characterized as reducts of some richer kind of algebra. Hence for fixed n, the class of n × n matrix relation algebras has a first–order characterization. As a consequence, homomorphic images and proper extensions of matrix relation algebras are isomorphic to matrix relation algebras. Received July 18, 2001; accepted in final form April 24, 2002.     

Endoprimal implication algebras

An algebra A is endoprimal if, for all , the only maps which preserve the endomorphisms of A are the n-ary term functions of A. The theory of natural dualities has been a very effective tool for finding finite endoprimal algebras. We study endoprimality within the variety of implication algebras, which does not contain any non-trivial dualisable algebras. We show that there are no non-trivial finite endoprimal implication algebras. We also give some examples of infinite implication algebras which are endoprimal. Received July 28, 1998; accepted in final form January 18, 1999.     

Proper actions, fixed-point algebras and naturality in nonabelian duality

Suppose a locally compact group G acts freely and properly on a locally compact Hausdorff space X, and let γ be the induced action on C₀(X). We consider a category in which the objects are C^∗-dynamical systems (A,G,α) for which there is an equivariant homomorphism of (C₀(X),γ) into the multiplier algebra M(A). Rieffel has shown that such systems are proper and saturated, and hence have a generalized fixed-point algebra Aα which is Morita equivalent to A_×α,rG. We show that the assignment (A,α)?Aα is functorial, and that Rieffel's Morita equivalence is natural in a suitable sense. We then use our results to prove a categorical version of Landstad duality which characterizes crossed products by coactions, and to prove that Mansfield imprimitivity for crossed products by homogeneous spaces is natural.     

一类非光滑规划问题的最优性和对偶

研究一类非光滑多目标规划问题,给出了该规划问题的三个最优性充分条件.同时,研究了该问题的对偶问题,给出了相应的弱对偶定理和强对偶定理.     

Representation and duality for Hilbert algebras

In this paper we introduce a special kind of ordered topological spaces, called Hilbert spaces. We prove that the category of Hilbert algebras with semi-homomorphisms is dually equivalent to the category of Hilbert spaces with certain relations. We restrict this result to give a duality for the category of Hilbert algebras with homomorphisms. We apply these results to prove that the lattice of the deductive systems of a Hilbert algebra and the lattice of open subsets of its dual Hilbert space, are isomorphic. We explore how this duality is related to the duality given in [6] for finite Hilbert algebras, and with the topological duality developed in [7] for Tarski algebras.