Sugihara algebras and monoids: multisorted dualities
L.M. Cabrer, H.A. Priestley

TL;DR
This paper develops a unified multisorted duality framework for Sugihara algebras and monoids, enabling better analysis of their algebraic properties and applications in relevance logic.
Contribution
It introduces a comprehensive suite of multisorted duality theorems for Sugihara algebras and monoids, extending previous dualities to include both odd and even cases.
Findings
Unified duality theorems for Sugihara algebras and monoids
Enhanced representations of free algebras
Foundation for further applications in logic and algebra
Abstract
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 Cabrer et al., give access to a viable method for studying admissible rules within relevance logic, specifically for extensions of the deductive system -mingle. This paper builds on the work already done on the theory of natural dualities for Sugihara algebras. Its purpose is to provide an integrated suite of multisorted duality theorems of a uniform type, encompassing finitely generated quasivarieties and varieties of both Sugihara algebras and Sugihara monoids, and embracing both the odd and the even cases. The overarching theoretical framework of multisorted duality theory developed here leads on to amenable representations of free algebras.…
| n | n \bigstrut[b] | ||||
|---|---|---|---|---|---|
| \bigstrut[t] | |||||
| with | |||||
| , with | |||||
| or | , with | ||||
| mm | mm \bigstrut[bt] | ||||
|---|---|---|---|---|---|
| [as per odd case] | [linking partial | [linking isomorphism] | |||
| isomorphism] | \bigstrut[t] | ||||
| — | |||||
| [surjective homomorphism] | [as per even case] | ||||
| — | — | ||||
| [linking isomorphism] |
| mm | mm \bigstrut[b] | ||||
|---|---|---|---|---|---|
| — | — \bigstrut[t] | ||||
| — | |||||
| or | — |
| mm | mm \bigstrut[b] | ||||
|---|---|---|---|---|---|
| — | |||||
| [as per odd case] | [linking isomorphism]\bigstrut[t] | ||||
| — | |||||
| [surjective homomorphism] | [as per even case] | ||||
| — | — | ||||
| [linking isomorphism] |
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Algebra and Logic · Logic, Reasoning, and Knowledge · semigroups and automata theory
Sugihara algebras and Sugihara monoids: multisorted dualities
Leonardo M. Cabrer
and
Hilary A. Priestley
Mathematical Institute, University of Oxford,
Radcliffe Observatory Quarter,
Oxford, OX2 6GG, United Kingdom
Abstract.
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 Cabrer et al., give access to a viable method for studying admissible rules within relevance logic, specifically for extensions of the deductive system -mingle.
This paper builds on the work already done on the theory of natural dualities for Sugihara algebras. Its purpose is to provide an integrated suite of multisorted duality theorems of a uniform type, encompassing finitely generated quasivarieties and varieties of both Sugihara algebras and Sugihara monoids, and embracing both the odd and the even cases. The overarching theoretical framework of multisorted duality theory developed here leads on to amenable representations of free algebras. More widely, it provides a springboard to further applications.
Key words and phrases:
Sugihara algebra, Sugihara monoid, natural duality, multisorted duality
2010 Mathematics Subject Classification:
Primary: 03G25; Secondary: 03B47, 08C20 06D50
1. Introduction
Sugihara monoids and algebras, particularly in the odd case, have attracted interest on a number of fronts. This has stemmed in part from investigations of the rich class of residuated lattices and of associated substructural logics. See for example the introductory survey [BT02] and the comprehensive monograph [GJKO] for the general theory and context and [FG17, GR12, GR15, OR07, MRW18] for indications of where the special class of Sugihara monoids fits into a wider algebraic framework.
From the perspective of logic, the motivation for studying Sugihara monoids originates in the work of Dunn [Du70] and Anderson and Belnap [AB75]; see also the contextual comments in [OR07]. Sugihara algebras provide complete algebraic semantics for RM, the algebraizable deductive system -mingle. Sugihara monoids include a constant in their algebraic language so as to model , viz. -mingle afforced with Ackermann’s constant.
Our introductory remarks above indicate that effective mathematical tools for studying Sugihara algebras and monoids would be of interest and value both as regards these algebraic structures per se and for the algebraic and relational semantics for related deductive systems. Our objective in this paper is to enlarge the armoury of such tools, as a basis for further theory. Our principal theorems provide, within a uniform framework, a multisorted natural duality for every variety generated by a finite subdirectly algebra in either or . Here the use of dual categories based on multisorted topological relational structures is central to our approach. Our longer-term aim is for the present work to lead on to a full exploration of alternative relational models, and to a structural analysis of the classes of Sugihara algebras and of Sugihara monoids based on these models; we emphasise that in this programme we treat and together, and on an equal footing. We cannot achieve our objectives within a single paper. Accordingly, the material on multisorted dualities we present here, and specifically our theorems in Sections 4 and 5, may be seen in part as a stepping stone along the way to our ultimate goal. Paper [CPfree], devoted to free algebras, provides a foretaste of what our new methods can achieve.
Our paper [CPsug] was motivated by a very specific problem: to find a computationally feasible method for studying admissible rules for certain extensions of RM. See [GM16] and [CFMP] and the references therein for background. Compelling evidence for the power of the duality-based approach in [CFMP] was given in [CPsug]*Section 8. There are significant differences between RM and as regards structural completeness properties, with strong assertions being available for the latter. This led us in [CPsug] to focus on the variety and specifically on its finitely generated quasivarieties. The generators for these quasivarieties are the algebras for , where has a lattice reduct which is a chain with elements. Analogously, the finitely generated quasivarieties of have generators , where has -reduct and has interpreted as [math] if is odd and as if is even. (Details of the definitions are recalled in Section 3.) A Sugihara algebra or monoid is odd if its involution has a (necessarily unique) fixed point, and even otherwise. Thus and are odd if and only if is odd. The general structure theory of Sugihara monoids, and of their relational models, is most highly developed in the odd case; see in particular [FG17, GR12, GR15, OR07].
In [CPsug] we presented dualities (specifically natural dualities which have the property of being strong) for all the quasivarieties of . Our representation theorems took different forms in the odd and even cases, with [CPsug]*Theorem 6.4 (even case) looking more complicated than [CPsug]*Theorem 4.3 (odd case). At the heart of this dichotomy is the fact that the quasivarieties are varieties whereas ; the variety generated by is . (We adopt the customary notation for class operators.) Details of these claims, and the analogues for Sugihara monoids, with replaced by , are given in Section 3. These observations suggest that we should switch attention from quasivarieties to the varieties they generate. The machinery of multisorted dualities makes this possible, and brings other benefits too.
We shall assume that the reader is familiar with the basic theory of natural dualities, as summarised in black box fashion in [CPsug]*Section 3. Section 2 below provides a brief formal introduction to the use of multisorted dual categories, with the theory tailored to our needs. We are mindful that multisorted duality theory is less well known than it deserves to be. Accordingly, by way of salesmanship, we include a short appendix to our paper to set in context our main results in Sections 4 and 5. The appendix, aimed at those new to multisorted dualities, illustrates the key ideas using two simple examples: Kleene algebras and Kleene lattices and shows how a multisorted perspective facilitates making connections between natural dualities and alternative, Priestley-style, representations.
Once Section 2’s theoretical foundations are in place, we focus on Sugihara algebras and monoids. Section 3 recalls facts from [CPsug] on Sugihara algebras and assembles the information we need, likewise, about Sugihara monoids. Section 4 begins with Theorem 4.4, the translation into a two-sorted form of [CPsug]*Theorem 4.3. We highlight the similarities and the differences between what are essentially two formulations of the same result. By contrast, Theorem 4.8 enters new territory. It supplies a three-sorted strong duality for , the variety generated by . This duality is easier to work with than the single-sorted one with carriers for the quasivariety [CPsug]*Theorem 6.4. In Section 5 we capitalise on our work in the algebras case to exhibit Theorems 5.2 and 5.3, the corresponding duality theorems for the monoids case. Very little work is involved. Moreover, in both the odd and even cases, the differences between the and results are limited and localised in nature, so that the effect of including or omitting the truth constant from the language feeds through in a transparent way to our representation theorems.
Finally in this introduction we draw attention to an important limitation on the applicability of natural duality theory to Sugihara algebras and monoids. Each of the varieties and is generated by a single algebra having the integers as its lattice reduct. There are instances of natural dualities based on infinite alter egos, for example those for abelian groups (the famous Pontryagin duality) and Ockham algebras. However the requirements for an infinite generating algebra to have a compatible alter ego are stringent (see the general discussion in [DHP16]) and the varieties and cannot be brought under the natural duality umbrella this way. We argue that, nevertheless, finitely generated subquasivarieties and subvarieties of a variety which is not finitely generated can carry valuable information, especially for locally finite varieties. This was illustrated in [CPsug]*Section 8, concerning admissible rules for -mingle. We note too that every finitely generated free algebra in or already belongs to some finitely generated subvariety and can be analysed there; see [CPfree]. More widely, information revealed by applying duality methods to sub(quasi)varieties of a variety may provide pointers to algebraic features of the variety as a whole. We note the recent study by Fussner and Galatos [FG17] of the algebraic structure of (odd) Sugihara monoids and of relational models for them. At this stage there is little overlap between our work and theirs in that the novelty of our approach rests on the use of multisorted natural dualities whereas they make only very limited use of natural duality theory and then only in a single-sorted form.
2. The framework of multisorted natural dualities
Our objective in using duality theory is to be able to study a class of algebras by setting up a well-behaved dual category equivalence between and a category so that problems about can be faithfully translated into problems about which one anticipates will be more tractable. Our approach to the admissible rules problem originating in [CFMP] and exploited in [CPsug] relies crucially on the use of strong dualities. As the term is used in natural duality theory [CD98], a strong duality for a finitely generated quasivariety sets up a dual equivalence between and a category of topological relational structures, generated as a topological quasivariety by \smash{\underset{\raise 1.61458pt\hbox{\smash{\sim}}}{\mathbf{M}}}\vphantom{\underline{\mathbf{M}}}, a compatible ‘alter ego’ for which is injective in (the technical details need not concern us here). In [CPsug], and equally in this paper and its successors, the existence of dualities is guaranteed by general theory and our assumptions. But more is at stake: we seek dualities which are based on economical, and so amenable, alter egos. We achieved this in [CPsug] by using the method of generalised piggybacking which was introduced in [DP87] and is based on a theory of multisorted natural dualities. But in [CPsug] multisortedness was kept covert. Our dualities there used dual categories whose objects are traditional single-sorted structures; we obtained the alter egos determining the dual categories using a multi-carrier version of the piggyback method; strongness can also be engineered [CPsug]*Theorem 3.3.
In this paper we extol the virtues of employing multisorted duality theory in its full-blown form. Now the dual categories have objects which are multisorted topological structures. As a byproduct, this gives us the freedom to seek a duality for a class , where is a finite set of finite algebras over a common language.
By way of background, we remark that researchers who have driven natural duality theory forward over the past twenty years have concentrated on the single-sorted case. They were aware that extensions to the multisorted case would be possible, and often straightforward, but that the heavier notation involved in working in maximum generality could obscure the underlying ideas; [DHP16], a recent major review of single-sorted piggybacking, is a case in point. Moreover, the multisorted theory has evolved on a ‘need-to-know’ basis, as potential applications have emerged.
The treatment of multisorted piggybacking and strong dualities in [CD98]*Chapter 7 omits details and proofs. It does anyway not quite meet our needs. We shall instead draw on the paper [DT03] by Davey and Talukder. This includes a clear summary of the basic theory and also the technical result on strongness that we shall require. (Furthermore, [DT03] studies dualities for finitely generated varieties of Heyting algebras, so the algebras involved there have a connection with Sugihara algebras and monoids, though this relationship is not pursued in the present paper.)
We do not need the theory in the most general form possible. The classes of algebras we wish to consider will be of the form or , where is finite and has a distributive lattice reduct; here and are, respectively, the variety and quasivariety generated by . On the universal algebra front, these assumptions ensure that is congruence distributive and that Jónsson’s Lemma applies. This means that will be expressible as , where is finite and each . As regards duality theory, we will have access to both the Multisorted Piggyback Duality Theorem (for piggybacking over the variety of all distributive lattices) [CD98]*Theorem 7.2.1 and the Multisorted NU Strong Duality Theorem, making use of the fact that we are dealing with lattice-based algebras, [CD98]*Theorem 7.1.2.
So consider a class , where is a finite set of finite algebras over a common language and having reducts in . We regard as a category, in which the morphisms are all homomorphisms. We seek a dual category whose objects are multisorted topological structures and whose morphisms are maps which preserve the sorts and are continuous and structure-preserving. A background reference for multisorted structures is [KK]. We want to construct in such a way that there are functors and setting up a dual equivalence. This needs to be done in a very specific way, so that and are given by appropriately defined hom-functors.
We now explain what constitutes an admissible alter ego \smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}} for , how to construct the dual category of multisorted structures generated by \smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}} and set up a dual adjunction between and . Our alter ego for takes the form \smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}}=(M_{1}\smash{\,\cup\kern-4.49997pt\raisebox{4.30554pt}{\cdot}}\,\,\cdots\smash{\,\cup\kern-4.49997pt\raisebox{4.30554pt}{\cdot}}\,\,M_{N};G,H,K,R,\mathcal{T}). Here is a set of relations each of which is a subalgebra of some , where . The sets and consist, respectively, of homomorphisms and (non-total) partial homomorphisms, each from some into some . The elements of are the one-element subalgebras of the members of . The alter ego \smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}} carries the disjoint union topology derived from the discrete topology on the individual sorts . (These assumptions parallel those in the single-sorted case; see [CPsug]*Section 3.)
We form multisorted topological \smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}}-structures {\mathbf{X}=\mathbf{X}_{1}\smash{\,\cup\kern-4.49997pt\raisebox{4.30554pt}{\cdot}}\,\,\cdots\smash{\,\cup\kern-4.49997pt\raisebox{4.30554pt}{\cdot}}\,\,\mathbf{X}_{N}} where each of the sorts is a Boolean space, is equipped with the disjoint union topology and regarded as a structure, is of the same type as \smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}}. Thus is equipped with a set of relations ; if , then ; and similar statements apply to , and . Given \smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}}-structures and , a morphism is defined to be a continuous map preserving the sorts, so that , and preserves the structure. The terms isomorphism, embedding, etc., are then defined appropriately. As in the single-sorted case, care needs to be taken with embeddings when ; see [CPsug]*Section 3.
We define our dual category to have as objects those \smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}}-structures which belong to a class of topological structures which we shall denote by \operatorname{\mathbb{IS}_{c}\mathbb{P}^{+}}(\smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}}). Specifically, consists of isomorphic copies of closed substructures of powers of \smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}}. Here powers are formed ‘by sorts’: given a non-empty set , the underlying set of \smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}}^{S} is the union of disjoint copies of , for , equipped with the disjoint union topology obtained when each is given the product topology. The structure given by , , and is lifted pointwise to substructures of such powers. The superscript + indicates that the empty structure is included in .
We set up hom-functors and using and its alter ego \smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}}:
[TABLE]
Here the disjoint union \boldsymbol{\mathscr{A}}(\mathbf{A},\mathbf{M}_{1})\smash{\,\cup\kern-4.49997pt\raisebox{4.30554pt}{\cdot}}\,\,\cdots\smash{\,\cup\kern-4.49997pt\raisebox{4.30554pt}{\cdot}}\,\,\boldsymbol{\mathscr{A}}(\mathbf{A},\mathbf{M}_{N}) is a (necessarily closed) substructure of M_{1}^{A}\smash{\,\cup\kern-4.49997pt\raisebox{4.30554pt}{\cdot}}\,\,\cdots\smash{\,\cup\kern-4.49997pt\raisebox{4.30554pt}{\cdot}}\,\,M_{N}^{A}, and so a member of \operatorname{\mathbb{IS}_{c}\mathbb{P}^{+}}(\smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}}). We recall from above that \boldsymbol{\mathscr{X}}(\mathbf{X},\smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}}), as a set, is the collection of continuous structure-preserving maps \phi\colon\mathbf{X}\to\smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}} which are such that for . This set acquires the structure of a member of by virtue of viewing it as a subalgebra of the power . The well-definedness of the functors and is of central importance to our enterprise. It hinges on the algebraicity assumptions we have made on and the requirement that each is finite and carries the discrete topology. Moreover, and set up a dual adjunction, in which the unit and counit maps are evaluation maps, and these evaluations are embeddings.
We say \smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}} yields a multisorted duality if, for each , the evaluation map is an isomorphism. The duality is full if, for each , the evaluation map is an isomorphism, and the categories and are dually equivalent. Thus a duality provides a concrete representation of . If in addition the duality is full, every arises, up to isomorphism, as a topological structure , for some . We record an important fact, true for any multisorted duality, and adding weight to the duality’s claim to be called ‘natural’. In , the free algebra on generators is isomorphic to \mathsf{E}(\smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}}^{S}) [CD98]*Lemma 2.2.1 and Section 7.1.
In practice, fullness of a duality is normally obtained at second hand by showing that the duality is strong. In certain applications—and this was crucial in the TSM method for testing admissibility [CFMP, CPsug]—consequences of strongness are required, whereby each of the functors setting up a strong duality converts an embedding to a surjection and a surjection to an embedding. Strongness of a single-sorted duality can be defined in several equivalent ways and the same is to be expected of a multisorted duality. In accordance with our policy of a black-box treatment of duality theory, we shall suppress the details as far as possible.
The multisorted piggyback duality theorem originated in [DP87]*Theorem 2.2 and thereafter various specialisations have been well documented, as for example in [CD98]*Theorem 7.2.1, Most previous applications in the literature piggyback over , bounded distributive lattices with included in the language. However, as in [CPsug], we shall, except briefly in the appendix, piggyback over , the variety of all distributive lattices. The upgrade to a strong duality was not discussed in [DP87]. For this see for example [CD98]*Theorem 7.1.2 (the Multisorted NU Strong Duality Theorem and [DT03]*Theorem 2.1.
We now state the multisorted duality theorem that we shall apply to quasivarieties and varieties of Sugihara algebras and monoids. The reason for including the condition on subalgebras being subdirectly irreducible is that it ensures that partial operations of arity are not needed; cf. [CD98]*Section 7.1. A discussion of the role of the set of one-element subalgebras of members of , and the need, for the application of the Multisorted NU Strong Duality Theorem, to include these in \smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}}, can be found in [DT03]*Lemma 4.5.
Theorem 2.1** (Multisorted Piggyback Strong Duality Theorem, for distributive-lattice-based algebras).**
Let , where is a finite set of pairwise disjoint finite algebras in and assume that there is a forgetful functor such that is a reduct of for each . Assume in addition that for each every non-trivial subalgebra of is subdirectly irreducible.
For each let be a (possibly empty) subset of , where denotes the -element lattice in .
Let \smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}} be the discretely topologised relational structure with universe M_{0}:=M_{1}\smash{\,\cup\kern-4.49997pt\raisebox{4.30554pt}{\cdot}}\,\,\cdots\smash{\,\cup\kern-4.49997pt\raisebox{4.30554pt}{\cdot}}\,\,M_{N} and equipped with
- (i)
, a subset of satisfying the following separation condition: for all , given with , there exist and and such that ; 2. (ii)
, the collection of maximal -subalgebras of sublattices of the form
[TABLE]
*for which , *(where range over ).
Then \smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}} yields a duality on .
If the structure of the alter ego is augmented so as to include
- (iii)
, the set of all homomorphisms whose domain is a subalgebra of some and whose image is a subalgebra of some , where ; 2. (iv)
, the set of elements which are universes of one-element subalgebras in some member of , viewed as nullary operations of \smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}}.
then \smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}} yields a strong and hence full duality on .
Some comments are in order here. Recall that Theorem 2.1 is derived by pasting together sufficient conditions for a reasonably economical duality (by multisorted piggybacking) and for an upgrade to a strong duality (Multisorted NU Strong Duality Theorem). The theorem ensures that, when conditions (i)–(iv) are satisfied a strong duality is available. But we would be likely to want to massage the alter ego so delivered in order to arrive at an alter ego which is easier to work with but which still strongly dualises . A result that facilitates the streamlining of an alter ego in the single-sorted case is Clark and Davey’s \smash{\underset{\raise 1.61458pt\hbox{\smash{\sim}}}{\mathbf{M}}}\vphantom{\underline{\mathbf{M}}}-Shift Strong Duality Lemma, of which we presented a simplified for in [CPsug]*Lemma 3.4. We now present the multisorted version we shall need in this paper.
Lemma 2.2** (Multisorted \smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}}-Shift Strong Duality Lemma).**
Assume that is a finitely generated quasivariety and that it is strongly dualised by \smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}}=(M_{0};G,H,K,R,\mathcal{T}). Then an alter ego \smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}}^{\prime}=(M_{0};G^{\prime},H^{\prime},K^{\prime},R^{\prime},\mathcal{T}) will also yield a strong duality if any of the following applies:
- (a)
;
- (b)
* is obtained by deleting from any element expressible as a composition of the elements that remain;*
- (c)
\smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}}^{\prime}* yields a duality on and is obtained from \smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}} by deleting members of ;*
- (d)
\smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}}^{\prime}* yields a duality on and is obtained by deleting from any element which has a proper extension belonging to .*
Proof.
As in the single-sorted case the proofs of the duality claims in (a) and (b) are bookkeeping exercises with evaluation maps; cf. [CDquest]*Lemmas 1.4 and 3.1. The part of the proof of [CDquest]*Lemma 3.1 that deals with strongness relies on the fact that a closed substructure of a non-zero power of \smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}} in the dual category is hom-closed. The multisorted version of this assertion is stated and proved in [DT03]*Lemma 4.3. The proofs of (b)–(d) then proceed as in the single-sorted case. (Here (b) is a restricted form of hom-entailment, sufficient for our purposes; see [CD98]*Section 9.4.) ∎
The Shift Lemma, items (b) and (d), promises to be valuable for eliminating unnecessary maps from the set stipulated in Theorem 2.1(iv). Moreover, in our applications, the piggyback relations in (ii) will turn out to be graphs of partial endomorphisms of sorts or of partial homomorphisms between sorts, or converses of such graphs. But, assuming we want our duality to be strong, we do need to include partial operations in the alter ego rather than their graphs.
There is no a priori reason to expect that there will be a close relationship between the set-up envisaged in the first part of Theorem 2.1, in which we merely seek a duality, and the additional structure which is added to ensure strongness. However we shall see that, in the Sugihara context, the operations in (iii) are tightly connected to the relations in (ii), for the carrier maps we select. Indeed, this is precisely what allows us to present streamlined alter egos, in which piggyback relations per se do not feature. In certain applications—the description of finitely generated free algebras for Sugihara algebras and monoids being a prime example (see [CPfree])—we do not need strongness, or even fullness. But knowing this does not lead to any worthwhile simplifications.
3. Sugihara algebras and monoids, odd and even cases
Given the freestanding treatment of the class of Sugihara algebras available in [CPsug] our aim as far as possible is to draw on the Sugihara algebra results to arrive at corresponding results for monoids, to avoid starting afresh. Therefore we shall regard the class of Sugihara monoids as being obtained by enriching the language of , instead of going in the opposite direction.
We recall that the variety of Sugihara algebras is generated by the algebra whose underlying lattice is the chain of integers. The negation and implication are given, respectively, by
[TABLE]
A finite Sugihara algebra is subdirectly irreducible if and only if it is (isomorphic to) some subalgebra (). This result dates back to Blok and Dzobiak [BD86]; see also [CPsug]*Section 2. Here the universe of is () and ().
The variety of Sugihara monoids consists of algebras such that the reduct belongs to and is a constant which is an identity for the derived fusion operation given by . It is useful to denote the derived constant by . When is odd. the Sugihara monoid associated with the Sugihara algebra has the constants and interpreted as [math]. When is even, is interpreted as and as . It has long been known (see [Du70] and also [AB75]*pp. 422–423) that the finite subdirectly irreducible members of are the algebras for . We let .
We next assemble information about finitely generated quasivarieties and varieties in and , drawing on some fundamental results from universal algebra. Suppose we have a variety , where is some finite algebra . Let be the set of subdirectly irreducible algebras in , up to isomorphism. Then Birkhoff’s Subdirect Product Theorem tells us that is finite and that . We shall be dealing with the situation in which is congruence-distributive. A corollary of Jónsson’s Lemma asserts that in such a variety, every subdirectly irreducible algebra is a homomorphic image of a subalgebra of . In addition, the lattice of subvarieties of is a finite distributive lattice. It follows that of subvarieties of is isomorphic to the lattice of down-sets of , where in if and only if (see for example [BD79]).
Take . We note that is a homomorphic image of via the homomorphism given by
[TABLE]
Proposition 3.1 leads to the diagram in [CPsug]*Figure 1 for the lattice of finitely generated subquasivarieties of . We omitted the justification there since we did not explicitly need the result. In this paper we do need it.
In [CPsug] we considered the chains of quasivarieties (odd case) and (even case) and presented dualities for and , for general . In Proposition 3.1 we have changed labels from to . Part (ii) explains why. In order to provide a multisorted duality for we would expect to draw on ingredients from the dualities for and at the same time and it is convenient subsequently to label the odd case quasivarieties as and the even case quasivarieties as . (The class is the trivial class and is term-equivalent to the variety of Boolean algebras, and we have nothing to say about either class.)
Proposition 3.1** (Sugihara algebras: quasivarieties and varieties).**
- (i)
, and so is a variety. 2. (ii)
* and .* 3. (iii)
.
Proof.
To apply Jónsson’s Lemma to the variety we need to investigate . By [CPsug]*Proposition 2.1, any given subalgebra of is isomorphic to some , where and is even if is even. Now consider a homomorphism with domain . Its image is isomorphic to a quotient , where is a congruence on . According to [CPsug]*Proposition 2.4, there exists such that if and only if or . Thus . We now separate the odd and even cases.
Assume . In this case . It follows that . This implies that every subdirectly irreducible algebra in belongs to and hence that . Hence the two classes coincide. We have proved (i).
Assume . Any member of which is already in certainly belongs to . Now suppose that we have a non-trivial congruence on some subalgebra , with even and . From above, . Since and , the quotient is isomorphic to a subalgebra of and so in . Clearly is not a variety for since it does not contain . We deduce that (i) holds.
Finally (iii) is now immediate from (i) and (ii). ∎
The following proposition parallels the content of Proposition 3.1 and can be proved in the same way. Note that has as an -morphic image: the surjective -morphism defined above is an -morphism.
Proposition 3.2** (Sugihara monoids: quasivarieties and varieties).**
- (i)
, and so is a variety. 2. (ii)
* and .* 3. (iii)
*The inclusion orderings of the subquasivarieties of and of the subvarieties of are as shown in Figure *1.
Proof.
(i) and (ii) can be proved in the same way as the corresponding claims for Sugihara algebras (see also for example [OR07]*Section 3). It is trivial that for each and that . It is not true that belongs to (or to ) for any . If it did, would have to be a homomorphic image of a subalgebra of . But this is impossible since the constants and are distinct in but coincide in any member of . It is also not true that belongs to any when . ∎
The cornerstone for our development of amenable single-sorted dualities for the quasivarieties , for both odd and even, was our analysis of the partial endomorphisms of the algebras . The results in [CPsug]*Section 2 are equally important in the multisorted case and we shall want their analogues for Sugihara monoids too.
We recall for reference the definitions of the maps from to itself that [CPsug]*Proposition 2.9 shows constitute a generating set for :
[TABLE]
We remark that, of course, any morphism between Sugihara monoids necessarily includes the constants and in its domain and image. This ensures that the family of partial endomorphisms of a Sugihara monoid forms a monoid under composition. (Cf. the comments in [CPsug]* for the algebra case.)
We shall adopt the convention that the same symbol is used for two morphisms, one of Sugihara algebras and the other of Sugihara monoids, when they have the same underlying set map. However we shall distinguish sets of (partial) endomorphisms and, later, (partial) homomorphisms of Sugihara monoids from their Sugihara algebra counterparts by including a superscript t. This usage accords with that used for R-mingle logics. For partial endomorphisms of Sugihara monoids we have the following analogue of [CPsug]*Propositions 2.8 and 2.9.
Proposition 3.3** (partial endomorphism of Sugihara monoids, odd case).**
- (i)
The endomorphisms of are the same as those of . 2. (ii)
* is generated by .*
Proof.
(i) Since [math] is the unique -fixed point in , every endomorphism of is also an endomorphism of .
For (ii) we first note that [math] is in the domain of any element of and since preserves . The only member of our standard generating set for whose domain omits [math] is .
We aim to show that any finite composition of partial endomorphisms of which includes one or more occurrences of fails to include [math] in its domain and so cannot be a member of . Consider , where abs is a composition not including . Then is defined and . But is undefined when . Hence . When and/or is absent the argument is even simpler.
Conversely, every element of preserves [math] and so any composition of maps from this set belongs to . ∎
We now turn to the even case. Here [CPsug]*Proposition 2.8 tells us that is generated by the following maps: is defined by
[TABLE]
and by
[TABLE]
We have used different symbols here for the maps from those used in [CPsug] to avoid a conflict of notation when we work with the variety generated by and shall need to consider and at the same time.
Each partial endomorphism of must include in its domain and must fix these points. Assume . For each element we define as follows:
[TABLE]
Proposition 3.4** (partial endomorphisms of Sugihara monoids, even case).**
- (i)
The only endomorphism of is the identity map. 2. (ii)
Let and define as above. Then sets up a bijection between and . Moreover, is generated by .
Proof.
Certainly is a partial endomorphism of for each . Also, every element of is injective, so the same must be true of elements of . It follows from this that is surjective. The map inverse to acts by restricting to , relabelling domain and image in the obvious way to realise this as an element of .
The claim concerning a generating set for follows from the corresponding result for (see [CPsug]*Proposition 2.8). ∎
4. Multisorted dualities for
Sugihara algebras
As promised in Section 1, we shall present multisorted dualities for the classes (the odd case) and (even case). In the odd case our sole purpose here is to recast our Piggyback Strong Duality Theorem [CPsug]*Theorem 4.3 in two-sorted form, with a view to future applications. The process we use to convert our earlier two-carrier duality for could be used more generally to split a sort with more than one carrier map into separate sorts, with suitable adaptations being necessary to the alter ego.
Our first—and principal—task is to establish appropriate notation. Fix . We create two disjoint copies of and call these and . Let and denote, respectively, the natural isomorphisms from to and from to . When working with and individually we shall often think of each of them as equal to . When working with both sorts at the same time, we shall use superscripts to indicate interpretations on and . For example, and denote the interpretations on and of the endomorphism of .
We define carrier maps from and into as follows: and , where
[TABLE]
(cf. [CPsug]*Section 4). (Because we are working here with and shall later bring into the picture as well, we reserve the symbols as used with in [CPsug]*Section 4 to use for carrier maps on .)
To illustrate the use of multisorted structures we shall present in full the check of the separation property needed in our application of Theorem 2.1; compare the following lemma with the single-sorted version, [CPsug]*Lemma 4.1.
Lemma 4.1** **(separation lemma for two-sorted duality for
).
Let . Let with . Then there exists and a homomorphism such that . Here is either the identity map on one of the sorts or is a composite of maps drawn from .
Proof.
We may without loss of generality assume that .
Suppose first that . Let and . Next suppose that . Let and . Then .
Now take . Let and . Then . Finally suppose . Again let and let . Then . ∎
Our next task is to identify the piggyback subalgebras. In [CPsug]*Proposition 4.2, for the single-sorted case, we showed that every piggyback relation (maximal or not) is the graph of a partial endomorphism of or the converse of such a graph. Switching to the two-sorted version, nothing changes except that we replace our piggyback subalgebras of by the corresponding subalgebras of , where , with the appropriate carrier map acting on each coordinate. For that we need to set the following notation, given we let denote the set of -morphisms with and .
Proposition 4.2** (multisorted piggyback relations for ).**
- (i)
A subalgebra of is the graph of some . 2. (ii)
A subalgebra of is the converse of the graph of some . 3. (iii)
A subalgebra of is the graph of some for which and . 4. (iv)
A subalgebra of is the graph of some or is the converse of the graph of some .
Proposition 4.3 will allow us to avoid ‘doubling up’ of mirror-image structure, since we have included the linking isomorphisms between the sorts. This idea will enable us in due course to streamline our multisorted alter ego for . We opt to let the sort bear the brunt of structuring the alter ego. But there is complete symmetry between the sorts and we could equally well have prioritised .
Proposition 4.3** (entailment of partial endomorphisms and homomorphisms, odd case).**
Any map in
[TABLE]
is obtained by composition by a generating set for , whose members are interpreted on , together with .
Proof.
The claim in the proposition for a map of type (i) is immediate. A map of type (ii), (iii) or (iv) is, respectively, expressible in the form , or , where . ∎
We now present our promised two-sorted strong duality theorem for . As anticipated, it has a clear relationship to its single-sorted, multi-carrier, counterpart. In particular we incorporate into the alter ego (a copy of) the same generating set for as we used in [CPsug]*Theorem 4.3; see Section 3, recalling [CPsug]*Proposition 2.9.
Theorem 4.4** **(Two-sorted Piggyback Strong Duality Theorem
for ).
Fix with . Take disjoint sorts and each isomorphic to . Let and . Consider the two-sorted structure based on having universe M_{0}:=P^{-}\smash{\,\cup\kern-4.49997pt\raisebox{4.30554pt}{\cdot}}\,\,P^{+}. Let
[TABLE]
(Here are to be interpreted on .) Then \smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}}:=(M_{0};G,H,K,\mathcal{T}) yields a strong and hence full duality on .
Proof.
We proceed in the same way as in the proof of [CPsug]*Theorem 4.3, but invoking Theorem 2.1 instead of the single-sorted, multi-carrier Piggyback Strong Duality Theorem given in [CPsug]*Theorem 3.3. We know that every non-trivial subalgebra of each of and is subdirectly irreducible. Lemma 4.1 established the separation condition. Finally we want to invoke the Shift Lemma as given in 2.2 to confirm that our chosen, slimmed down, alter ego strongly dualises . Propositions 4.2 and 4.3 provide all the facts we need. ∎
Our next goal is a three-sorted duality for the variety , for . Formally our sorts will have disjoint(ified) universes. We include two copies, and , of and a single copy of . We shall sometimes treat the sorts as though identified with the appropriate , being more explicit when this is warranted.
In the odd case we introduced the maps and so as to avoid including in our two-sorted alter ego sets of partial homomorphisms for all four choices of from . Likewise, with the third sort now in play we want to use linking maps between and to avoid our alter ego needing to include partial homomorphisms going between and the other sorts. We already in Section 3 made use of the surjective homomorphism . This gives rise to surjective homomorphisms . When we restrict to we obtain a bijective homomorphism mapping onto . We denote its inverse by . Corresponding claims hold for . See Figure 2.
We now set up the carrier maps we shall need in order to satisfy the separation condition in the Piggyback Theorem. As for the odd case we take
[TABLE]
We take , , and . For , we write for the unique element of .
Lemma 4.5** (separation lemma for ).**
Define as above.
Let . and in . Then there exists and such that , where is an identity map on one of the sorts or is a composite of maps drawn from .
Proof.
Lemma 4.1 covers the cases in which . So let in . If and are of opposite sign then and we take and . Now take in . Then in . Let and and proceed as in the proof of Lemma 4.1. Similarly, if in then in . Again we can now argue as in the proof of Lemma 4.1. ∎
We must now describe the multisorted piggyback relations for . Given , we shall write for the set of universes of subalgebras of such that and is maximal with respect to this containment.
We already know that every piggyback relation in the odd case (maximal or not) is the graph of a partial homomorphism or the converse of such a graph. In addition, every relation in is the graph of a member of , by [CPsug]*Proposition 6.3. We shall subsequently want to present a duality for the Sugihara monoid variety by making small adaptations to that for . This means that it is expedient when we encounter graphs of -morphisms in the algebra setting we should be sufficiently explicit to be able detect easily whether -morphisms are also available. Furthermore our structural analysis of Sugihara algebras and monoids in succeeding papers requires detailed information on piggyback relations and it is convenient to record this now.
Proposition 4.6** (multisorted piggyback relations for ).**
Let . For each choice of , the entry in the -cell in Table 1 shows the form that a member of must take. If appears in that cell it is to be assumed that is a partial homomorphism with and , with additional properties as stipulated. In cases in which appears then is to be taken to be a homomorphism with and . Necessary restrictions arising from are left implicit.
Proof.
The entries in the four corner cells in the table deal with the forms taken by the piggyback relations in the sets for which neither nor is ; see Proposition 4.2. The results originate in [CPsug]*Proposition 4.2, applied with . The dichotomy in the entry in the bottom left corner is explained in item (iv) of that proposition. To describe the members of we call on [CPsug]*Proposition 6.3: any (maximal) piggyback subalgebra is the graph of a (necessarily invertible) partial endomorphism.
We now deal with the four remaining cases, in which we need to consider sorts of different parities.
Throughout we work with initially viewed as a subalgebra of , with identified with and whichever of or is in play in a particular item identified with ; in this setting we regard and as subalgebras of . We may then regard and , as restrictions to of the maps and used as carrier maps for the duality for as and . Our strategy for classifying piggyback relations linking with the sorts and will be first to realise them, up to isomorphism, as subalgebras of associated with appropriate piggyback relations for the odd case. We then wish to assert that the piggyback relations from which we started are graphs of partial homomorphisms or converses thereof, where We take account of any constraints inherent in the various cases as regards domain and image of the partial maps which can arise. To justify our claims two approaches are available. We can appeal directly to [CPsug]*Proposition 4.2 and then switch into the language of sorts or alternatively we can translate to sorts first and then call on Proposition 4.2. The approaches are equivalent but, either way, some obvious re-alignment of notation is required.
- :
Consider a subalgebra of contained in . Then and together imply . This implies that forces since does not arise. Then is the graph of a partial endomorphism of , where omits and omits [math]. Translating into the language of sorts, we obtain the characterisation of shown in the table.
- :
Let be a subalgebra of for which . This time we may view as a subalgebra of within ; necessarily, S\cap\bigl{(}\{0\}\times\mathbf{Z}_{2m}\bigr{)}=\emptyset. We deduce that . As such, is the graph of a member of . Restating in terms of sorts, we obtain the required result.
- :
Let be a subalgebra of for which . This time implies so that , regarded as a subalgebra of , is contained in . Any allowable subalgebra is the graph of a partial endomorphism of which excludes [math] from both domain and image. In terms of sorts, this gives the graph of a partial homomorphism whose image excludes [math].
- :
Let be a subalgebra of contained in . View as a subalgebra of . Here implies , and forces . But for such this last condition is the same as forces . Hence is the graph of a partial endomorphism of , by [CPsug]*Proposition 4.2(ii). We require (this is of course necessary) and . So can be viewed as a partial homomorphism from into . ∎
A few additional remarks on the entries in Table 1 are in order. First of all there is more symmetry than may at first sight appear. The elements of are graphs of partial endomorphisms of . Any such is invertible and is such that . When we translate from into partial maps between sorts, presence or absence of [math] from domain or image is automatic.
We shall derive an analogue of Proposition 4.3, now also dealing with entailment of partial homomorphisms between non-isomorphic sorts. Refer back to the -Shift Strong Duality Lemma 2.2 to see the relevance of the conditions. Those familiar with the requisite technicalities can rephrase the claims in Proposition 4.7 in terms of hom-entailment.
Proposition 4.7** (partial homomorphisms between sorts).**
- (i)
Any is expressible as a composite of maps drawn from .
Any is expressible as a composition of maps drawn from . 2. (ii)
Any expressible as the restriction of a composition of maps drawn from .
Any is expressible as the restriction of a composition of maps drawn from .
Proof.
We showed in [CPsug]*Proposition 2.6 that for any and for and there exists such that for . Moreover extends to a partial endomorphism of which sends [math] to [math]. Necessarily if and only if . We may assume that in the odd case and in the even case.
Consider (i). Take . Necessarily (since has no fixed point). Then is injective and so . (See [CPsug]*Proposition 2.2.) But is also a subalgebra of of cardinality . Moreover, both and are strictly monotonic. Hence there exists with for and . Therefore . This proves the first claim in (i).
Consider . From above, for some . Now observe that . This completes the proof of (i).
Now consider (ii). Take . First assume . Then maps into and [CPsug]*Proposition 2.2 implies that is injective and is also injective. Then there exists such that and for all . Thus .
Now assume that . Then there exists a minimal such that . Let , Then is a homomorphism from into . Both and are strictly monotonic on . There exists a partial endomorphism of with and for and . Since and the maps and agree on the domain of . This completes the proof of the first assertion in (ii).
For the second assertion we consider . ∎
We have assembled all the ingredients for our duality theorem for . Table 2 indicates the maps we shall include in our multisorted alter ego. In the table all undecorated maps are to be viewed as being interpreted as maps between the indicated sorts. That is, we have omitted the superscripts previously used to indicate the sorts when interpretations of -morphisms between . , and their subalgebras, are involved. (The position of each entry dictates the intended interpretations of the maps.)
Our duality theorem is proved in essentially the same way as that for the odd case, and we need only give a sketch of the proof.
Theorem 4.8** **(Multisorted Strong Duality Theorem for
).
Let , and be disjointified copies of , and , respectively, with carrier maps , and , respectively. Let and let be the disjoint union topology on M_{0}:=P^{-}\smash{\,\cup\kern-4.49997pt\raisebox{4.30554pt}{\cdot}}\,\,P^{+}\smash{\,\cup\kern-4.49997pt\raisebox{4.30554pt}{\cdot}}\,\,Q derived from the discrete topology on each sort. Let \smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}}=(M_{0};G,H,K,\mathcal{T}), where the elements of are the maps presented in Table 2 and . Then \smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}} strongly dualises .
Proof.
With our selected sorts and carrier maps, the proposed alter ego ensures that the separation condition is satisfied; see Lemma 4.5. We now consider an enlarged alter ego in which we include all the structure that Theorem 2.1 tells us will give a strong duality, Then we can discard from this relational structure any operations, partial operations, relations or constants which are entailed by the structure we retain. Proposition 4.6 implies that all the piggyback relations are entailed by the full sets of partial endomorphisms and partial homomorphisms which we have included in our enlarged alter ego to guarantee strongness. Observe that coincides with . Hence, by [CPsug]*Propositions 2.8 and 2.9, every element of and can be obtain as a composition of maps in . Finally we call on Proposition 4.3 and Proposition 4.7. We conclude that, with as in our proposed alter ego, we indeed obtain a strong duality for . ∎
We have made our duality economical at the price of a loss of symmetry as regards and . When working with the duality it is likely to be convenient to think in terms of a symmetric formulation. However it is worth noting that we cannot thereby dispense with the linking maps and since these are needed for the separation lemma. The same comment applies to the duality for .
We should expect some asymmetry in relation to the piggyback relations, in Theorems 4.4 and 4.8, and in their single-sorted counterparts in [CPsug]. This stems from the way the carrier maps operate. Hints of this feature will be visible in our discussion of Kleene algebras in Section 6 and it will come to the fore when we later use our duality to describe free algebras [CPfree].
We draw attention to the omission of from that was made possible by the presence of the (necessary) map which links and . This aside, the duality theorem for encodes within it all the information for the duality theorem for . We just delete all reference to the sort and maps which involve it, and insert to recapture all the information required for Theorem 4.4.
5. Multisorted dualities for
Sugihara monoids
We now consider the monoid case, referring back to Section 3 for the basic algebraic results. We shall head straight for a multisorted duality for the variety , encompassing along the way rather than separating it out. In all other respects, we shall structure our argument in the same way as the corresponding argument in Section 4: sorts and linking maps; carrier maps and separation; piggyback relations; entailment of maps on and between sorts; the strong duality theorem for . Throughout we highlight where adaptations do and do not need to be made to transition from to . Let denote the natural forgetful functor. Thus for each .
We replace the three sorts and from Section 4 by sorts denoted and . The latter will be disjointified copies of and , respectively. We may assume that and .
Sugihara monoid homomorphisms must preserve (and also ). The isomorphisms and are -morphisms between and and Proposition 4.3 carries over, mutatis mutandis, to the monoid case.
Since [math] in any Sugihara monoid is a fixed point for , there are no monoid (partial) homomorphisms from to any even Sugihara monoid. Any -morphism from to any must send to [math]. The previously-defined map sends to [math] and so also serves as an -morphism from onto . We define in just the same way as before, but now using the monoid sorts.
We shall need an analogue of Proposition 4.7, whereby partial homomorphisms between sorts are derived by composition from link maps between sorts and generating sets for partial endomorphism monoids. We do still have available the endomorphism which played an important role in the proof of Proposition 4.7(ii). A key difference however emerges with (i). The distinguished constant(s) must be in the domain of any monoid (partial) homomorphism. Consequently the sets are empty, since any member of excludes [math] from its domain. Hence entailment does not arise. Note that analogues of the maps do not exist, but are not needed since was used in Proposition 4.7 only to handle .
When applying Proposition 5.1 later we shall take advantage of Propositions 3.3 and 3.4.
Proposition 5.1** (partial endomorphisms and homomorphisms).**
- (i)
Any member of , , or is expressible as a composition of maps drawn from a set obtained by adding and to a generating set for whose members are interpreted on . 2. (ii)
Any is entailed by a generating set for interpreted on . 3. (iii)
Any is expressible as a restriction of a composition of maps drawn from a set obtained by adding to a generating set for interpreted on .
Any is expressible as a restriction of a composition of maps drawn from a set obtained by adding and to a generating set for interpreted on .
Carrier maps act on the lattice reducts of the sorts and no change is required when we pass to Sugihara monoids. So we take , and . Lemma 4.5 established the separation condition for the algebra case. All the maps used there are -homomorphism so separation also holds for the monoid case.
We want to identify the forms taken by (maximal) -subalgebras of sublattices of , where .
Consider first the choices of for which a characterisation is available of all -subalgebras of , where , as a graph of an -partial homomorphism or converse of such a graph. The only situation in which we identified only the maximal -subalgebras of was that in which . So suppose is an -subalgebra of , where and are not both . Then takes the form shown in the cell in Table 1. This tells us that , or its converse, is the graph of an -morphism, possibly with additional restrictions on domain and/or image of the map. We must then insist that the morphism be an -morphism, and consider whether any restrictions on domain or image impose further constraints. Specifically, let , so and . For sorts and , necessarily and . In addition, a subalgebra of a product of sorts contains . We note in particular that belongs to any -subalgebra of . Since and there are no -subalgebras of or of . This signals the key differences between the dualities for Sugihara algebras and monoids, in both odd and even cases.
The -subalgebras of require special consideration. We know that a maximal -subalgebra of is the graph of an -homomorphism. But there may be fewer -subalgebras of than -subalgebras, and we have no guarantee that a maximal element in will be the graph of an -homomorphism. Hence we need to re-run the proof of the result in [CPsug]*Proposition 6.3 (residual case (a)) to check it works analogously when applied in the setting. Table 3 parallels Table 1.
We identified generating sets for the partial endomorphisms of and of in Lemmas 3.3 and 3.4 and we incorporate these into our alter ego for .
We present without further comment our duality theorems for and . The requisite facts have been established and no new features arise.
Theorem 5.2** **(Two-sorted Piggyback Strong Duality Theorem for
).
Fix with . Take disjoint sorts and each isomorphic to . Let and . Consider the two-sorted structure based on having universe M_{0}:=S^{-}\smash{\,\cup\kern-4.49997pt\raisebox{4.30554pt}{\cdot}}\,\,S^{+}. Let
[TABLE]
(Here are to be interpreted on .) Then \smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}}:=(M_{0};G,H,K,\mathcal{T}) strongly dualises .
Theorem 5.3** **(Three-sorted Piggyback Strong Duality Theorem for
).
Let , and be disjointified copies of , and , respectively, with carrier maps , and , respectively. Let and let be the disjoint union topology on M_{0}:=S^{-}\smash{\,\cup\kern-4.49997pt\raisebox{4.30554pt}{\cdot}}\,\,S^{+}\smash{\,\cup\kern-4.49997pt\raisebox{4.30554pt}{\cdot}}\,\,T derived from the discrete topology on each sort. Let \smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}}=(M_{0};G,H,K,\mathcal{T}), where the elements of are the maps presented in Table 4 and . Then \smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}} strongly dualises .
Observe how our elimination of the partial endomorphism from our alter ego for the duality for allows better alignment between the duality theorems for and than if we had retained it.
6. Appendix: The case for multisorted dualities
Here we give a brief contextual appraisal of the role of multisorted duality theory, as it applies to distributive-lattice-based algebras and illustrated by Kleene algebras and lattices. We do not include in this appendix any results not previously known. However the material is scattered across a number of sources and the methods we want to discuss are often applied to families of classes of algebras, and this can obscure the ideas. Our purpose here is to exemplify through our running examples how a multisorted approach can be seen as a facilitator, allowing different types of dual representation to operate collaboratively. We shall take these ideas forward for Sugihara monoids and algebras in subsequent papers, in the first instance in [CPfree].
Quasivarieties generated by small finite distributive lattices with additional operations, with or without distinguished constants, provided a rich source of examples on which Davey and Werner were able to test the power of the foundational theory. The emphasis here is on small. Davey and Werner’s method relied on their NU Duality Theorem: for a lattice-based quasivariety this yields a dualising alter ego . Taking this forward to arrive at a workable duality necessitated describing all subalgebras of and then using entailment constructs to weed out superfluous relations.
Example 6.1** **(Kleene algebras and lattices:
hand-crafted single-sorted dualities).
Let , where is the distributive lattice with underlying order and is the involution given by , and . The class of Kleene algebras is ; it coincides with . Moreover, is the unique proper subvariety of the variety of De Morgan algebras which covers Boolean algebras. Specifically, is characterised within by the law (which can equivalently be captured by ). The class of Kleene lattices is , where is obtained by omitting the constants from the language.
Davey and Werner’s duality for has alter ego \smash{\underset{\raise 1.61458pt\hbox{\smash{\sim}}}{\boldsymbol{3}}}\vphantom{\underline{\boldsymbol{3}}}=(\{0,a,1\};\preccurlyeq,-,K_{0},\mathcal{T}), where is the partial order with , and [math] and incomparable, is and [DW83] (or see [CD98]*4.3.10). This was proved by listing all subalgebras of and whittling down the list down by exhibiting entailments.
A minor adaptation yields an alter ego \smash{\underset{\raise 1.61458pt\hbox{\smash{\sim}}}{\boldsymbol{3}_{u}}}\vphantom{\underline{\boldsymbol{3}_{u}}} for , viz. we add the one-element subalgebra , regarded as a nullary operation, to \smash{\underset{\raise 1.61458pt\hbox{\smash{\sim}}}{\boldsymbol{3}}}\vphantom{\underline{\boldsymbol{3}}}. (A detailed account is given in [FG17]*Section 4. See also Example 6.3 below.)
The number is small. The ad hoc method in Example 6.1 will rarely be viable for quasivarieties , either by hand or even with computer assistance: the number of subalgebras of is liable to be unmanageably large. This led Davey and Werner to develop their piggyback method [DW85]. It applies to certain quasivarieties , where is finite, with a distributive lattice reduct (with or without bounds). The idea is to exploit Priestley duality as it applies to the reducts to identify a dualising alter ego more refined than that delivered by the NU Duality Theorem. But in its original form piggybacking is contingent on there being a single carrier map (a homomorphism from (the reduct of) into ) which, composed with the operations of , separates the points of . The separation condition fails for Kleene algebras, as explained in the introduction to [DP87]. It was their analysis of this ‘rogue’ example which led Davey and Priestley to introduce multisorted dualities and to develop a far-reaching generalisation of the piggyback method. The latter is applicable to any quasivariety or variety generated by a finite distributive-lattice-based algebra . This subsumes a brute force version for a quasivariety whereby all homomorphisms from (the reduct of) into are employed as carrier maps. This was what we used in [CPsug]*Theorem 6.4.
Example 6.2** **(Kleene algebras and lattices: piggyback dualities with two carrier
maps).
Consider . We let be the algebra defined in Example 6.1 and let be its reduct in . Let , respectively , the -homomorphism from to sending to , respectively to [math]. Then
[TABLE]
We obtain a dualising alter ego \smash{\underset{\raise 1.61458pt\hbox{\smash{\sim}}}{\boldsymbol{3}}}\vphantom{\underline{\boldsymbol{3}}} for by taking the first three of these relations and the discrete topology. This duality is already strong. We thereby recapture Davey and Werner’s original duality for .
For Kleene lattices, the Piggyback Strong Duality Theorem as formulated in [CPsug]*Theorem 3.3, for single-sorted piggybacking over , applies directly (or see [FG17]*Section 4 for a treatment based on the NU Strong Duality Theorem).
The dualities for and recalled in Example 6.1 have disadvantages. The roles of the elements , and in the alter ego are far from obvious, so the dualities lack intuitive appeal, and the axiomatisation of the dual categories (see [CD98]*4.3.9 and [FG17]*Proposition 4,3) does little to assist. In addition, obtaining , the free Kleene algebra on generators, from its natural dual \smash{\underset{\raise 1.61458pt\hbox{\smash{\sim}}}{\boldsymbol{3}}}\vphantom{\underline{\boldsymbol{3}}}^{S} is not the transparent process we could wish.
Example 6.3** (Kleene algebras: a rival duality).**
Cornish and Fowler [CF79] proved that the category of Kleene algebras is dually equivalent to the category of Kleene spaces. This provides what would now be referred to as a restricted Priestley duality111The nomenclature is a little ambiguous and the term ‘enriched’ is sometimes used instead of ‘restricted’. Often both adjectives have a valid connotation, with ‘restricted’ referring to the forgetful functor to Priestley spaces not in general being surjective, whereas ‘enriched’ refers to the dual objects being Priestley spaces with extra structure, usually relations or operations, with appropriate topological conditions imposed.; see [DG17]. Here the objects of are topologised structures where is a Priestley space and is a continuous order-reversing involution on such that \forall y\,\bigl{(}y\geqslant g(y)\text{ or }y\leqslant g(y)\bigr{)}; the morphisms are continuous maps preserving and . It is an easy exercise in Priestley duality to show that the existence of a map , as in the definition of a Kleene space, is exactly what is needed to capture the Kleene negation on the Priestley second dual of the reduct of a Kleene algebra. The objective of Cornish and Fowler was to describe coproducts, and in particular free algebras, in by using the duality, This was successful, but the construction is convoluted.
A version of Cornish and Fowler’s duality exists for Kleene lattices, in which the dual category involves pointed Priestley spaces.
Restricted Priestley dualities have the advantage of providing a set-based representation, akin to Kripke semantics but with dual spaces which are relational structures equipped also with topology. However, as might be expected of second-hand dualities, restricted Priestley dualities often lack many of the good features of a natural duality, such as direct access to free algebras, whose natural dual spaces are given by concrete powers. By contrast, Cornish and Fowler’s use of their duality to describe free Kleene algebras is far from transparent. For a finitely generated variety or quasivariety of distributive-lattice-based algebras, a natural duality and a restricted Priestley duality each has a role to play. But for duality methods to be at their most powerful we need to be able translate backwards and forwards between the two dual categories.
We now play the multisortedness trump card. Moving to a dual category of multisorted structures will make it clear how to reconcile the single-sorted natural dualities in 6.2 and the restricted Priestley dualities in 6.3 once the former are recast in terms of dual categories of multisorted structures.
Example 6.4** (Kleene algebras: two-sorted duality).**
Take disjoint copies of , denoted and . Define carrier maps as before, allocating to and to . For temporary convenience, we denote the universe of by . We form an alter ego \smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}} based on the set \{0^{-},a^{-},1^{-}\}\smash{\,\cup\kern-4.49997pt\raisebox{4.30554pt}{\cdot}}\,\,\{0^{+},a^{+},1^{+}\}. We equip this with the relations which are maximal subalgebras of sublattices , where range over . These binary relations are the same as those in 6.2 except that the coordinates now need to be tagged to indicate the sorts to which these refer.
Figure 3 depicts the alter ego, and its relations.
A key feature of the multisorted approach is that duals of free algebras are calculated ‘by sorts’. In the case of this means that the dual of , the free Kleene algebra on generators, has universe (M^{-})^{s}\smash{\,\cup\kern-4.49997pt\raisebox{4.30554pt}{\cdot}}\,\,(M^{+})^{s}, with , and lifted pointwise.
Davey and Priestley in [DP87]*Theorem 3.8 presented the first systematic translation process for toggling between natural dualities and their restricted Priestley duality counterparts. The context there, and in [CD98]*Section 7.6 too, was Ockham algebras:: within a much wider framework, Kleene algebras provide the simplest non-trivial example. The results given in [DP87]*Section 3 apply to Ockham algebra quasivarieties. They are heavy on notation and hide the simplicity of the ideas.
Example 6.5** (Reconciliations: the best of both worlds).**
We don’t give a full translation, preferring to illustrate the process as it applies to and . The dual spaces of these algebras are, respectively, \smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}} and \smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}}^{2}. We may view the union of the multisorted piggyback relations,
[TABLE]
as a preorder on . When we quotient by to obtain a partial order, the each of the pairs , and , collapses to a point. On the resulting poset, , the linking maps and induce a well-defined order-reversing involution . We have obtained the Kleene space which is the Cornish–Fowler dual of .
With \smash{\underset{\lower 2.79857pt\hbox{\smash{\widetilde{\phantom{rr!!r}}}}}{\mathcal{M}}}^{2} we proceed similarly, remembering that the power is formed ‘by sorts’; see Figure 4. The natural dual of is shown in Figure 4(a). Quotienting, we obtain the ordered set shown in (b). The isomorphisms and linking the two sorts encode, after the quotienting, the map in the restricted Priestley duality. The Kleene example is particularly simple because the map is determined by the order structure.
Denote the quotienting map by . Then, in the quotient, and . We are looking here at the dual spaces of a very particular algebra in , but this behaviour is exhibited quite generally. This reflects the fact that single-carrier, single-sorted piggybacking does not work. See [CD98]*Section 7.2, [DP87] and [CPcop]*Section 3 for detailed explanations.
Likewise to find the cardinality and the structure of a free Kleene algebra , a good way to proceed is to form its 2-sorted natural dual and then to pass to the restricted Priestley dual.
For , the translation works in the same way, but now piggybacking is over ; when recapturing the reduct of an algebra from its the duality used is that between and doubly pointed Priestley spaces, as in [CD98]*Section 1.2 and Theorem 4.3.2. The lattice reduct of has a join-irreducible top and meet-irreducible bottom. Simply delete these elements to obtain .
Further examples of translation between dualities of different types are given in [HPLuk, DBlat, CPGo] and a systematic account of this process, for the underlying lattices, is presented in [CPcop]. However one would not expect straightforward, or uniform, procedures for capturing algebraic operations of arity in dual terms, and for translating between different types of dual representations.
Discussion of this important aspect of our methodology, and its application to finitely generated free Sugihara algebras and monoids, is deferred to a later paper.
References
