SearcharxivSearch

arXiv subjects

Andrew Craig

Publications and source records attributed to Andrew Craig.

15 recordsLinked to original sources

Contractions of quasi relation algebras and applications to representability

Quasi relation algebras (qRAs) were first described by Galatos and Jipsen in 2013. They are generalisations of relation algebras and can also be viewed as certain residuated lattice expansions. We identify positive symmetric idempotent elements in qRAs and show that they can be used to construct new qRAs, so-called contractions of the original algebra. We then show that the contraction of a distributive qRA will be representable when the original algebra is representable. Further, we identify a class of distributive qRAs that are not finitely representable.

cs.LO

Pregroup representable expansions of residuated lattices

Group representable relation algebras play an important role in the study of representable relation algebras. The class of distributive involutive FL-algebras (DInFL-algebras) generalises relation algebras, as well as Sugihara monoids and MV-algebras. We construct DInFL-algebras from pregroups and show that they can be represented as algebras of binary relations. Even for finite pregroups we obtain relational representations of DInFL-algebras with non-Boolean lattice reducts. If the pregroup is enriched with a particular unary order-reversing operation, then our construction yields representation results for distributive quasi relation algebras.

cs.LO

Dual Plo\v{s}\v{c}ica spaces of ortholattices

We describe digraphs with topology which give dual representations of ortholattices. This is done via so-called dual Plo\v{s}\v{c}ica spaces of lattices. First, we improve the definition of Plo\v{s}\v{c}ica spaces from an earlier paper to give a straight and natural generalisation of the total order disconnectedness of Priestley spaces. Then we define the dual space of a general ortholattice as the dual Plo\v{s}\v{c}ica space of the lattice-reduct of the ortholattice equipped with a map representing the orthocomplement operation. We introduce an abstract ortho-Plo\v{s}\v{c}ica space capturing the properties of the dual space of an ortholattice, and we present dual representation theorems between general ortholattices and the ortho-Plo\v{s}\v{c}ica spaces. We illustrate our dual representations by examples.

math.RA

Dual spaces of lattices and semidistributive lattices

Birkhoff's 1937 dual representation of finite distributive lattices via finite posets was in 1970 extended to a dual representation of arbitrary distributive lattices via compact totally order-disconnected topological spaces by Priestley. This result enabled the development of natural duality theory in the 1980s by Davey and Werner, later on also in collaboration with Clark and Priestley. In 1978 Urquhart extended Priestley's representation to general lattices via compact doubly quasi-ordered topological spaces (L-spaces). In 1995 Plo\v{s}\v{c}ica presented Urquhart's representation in the spirit of natural duality theory by replacing, on the dual side, Urquhart's two quasiorders with a digraph relation generalising Priestley's order relation. In this paper we translate, following the spirit of natural duality theory, Urquhart's L-spaces into newly introduced \emph{Plo\v{s}\v{c}ica spaces}. We then prove that every Plo\v{s}\v{c}ica space is the dual space of some general lattice. Based on the authors' 2022 characterisation of finite join and meet semidistributive lattices via their dual digraphs, we initiate a study of general (possibly infinite) join and meet semidistributive lattices via their dual digraphs. We illustrate our results on examples and formulate three open problems.

math.RA

Duality theory and representations for distributive quasi relation algebras and DInFL-algebras

We develop dualities for complete perfect distributive quasi relation algebras and complete perfect distributive involutive FL-algebras. The duals are partially ordered frames with additional structure. These frames are analogous to the atom structures used to study relation algebras. We also extend the duality from complete perfect algebras to all algebras, using so-called doubly-pointed frames with a Priestley topology. We then turn to the representability of these algebras as lattices of binary relations. Some algebras can be realised as term subreducts of representable relation algebras and are hence representable. We provide a detailed account of known representations for all algebras up to size six.

cs.LO

Representability for distributive quasi relation algebras via nested sums

We extend the work of Galatos (2004) on nested sums, originally called generalised ordinal sums, of residuated lattices. We show that the nested sum of an odd quasi relation algebra (qRA) satisfying certain conditions and an arbitrary qRA is again a qRA. In a recent paper by Craig and Robinson (2025) the notion of representability for distributive quasi relation algebras (DqRAs) was developed. For certain pairs of representable DqRAs, we prove that their nested sum is again representable. An important consequence of this result is that finite Sugihara chains are finitely representable.

math.LO

Representing Sugihara monoids via weakening relations

We show that all Sugihara monoids can be represented as algebras of binary relations, with the monoid operation given by relational composition. Moreover, the binary relations are weakening relations. The first step is to obtain an explicit relational representation of all finite odd Sugihara chains. Our construction mimics that of Maddux (2010), where a relational representation of the finite even Sugihara chains is given. We define the class of representable Sugihara monoids as those which can be represented as reducts of distributive involutive FL-algebras of binary relations. We then show that the class of representable distributive involutive FL-algebras is closed under ultraproducts. This fact is used to demonstrate that the two infinite Sugihara monoids that generate the quasivariety are also representable. From this it follows that all Sugihara monoids are representable.

cs.LO

Representable distributive quasi relation algebras

We give a definition of representability for distributive quasi relation algebras (DqRAs). These algebras are a generalisation of relation algebras and were first described by Galatos and Jipsen (2013). Our definition uses a construction that starts with a poset. The algebra is concretely constructed as the lattice of upsets of a partially ordered equivalence relation. The key to defining the three negation-like unary operations is to impose certain symmetry requirements on the partial order. Our definition of representable distributive quasi relation algebras is easily seen to be a generalisation of the definition of representable relations algebras by Jonsson and Tarski (1948). We give examples of representable DqRAs and give a necessary condition for an algebra to be finitely representable. We leave open the questions of whether every DqRA is representable, and also whether the class of representable DqRAs forms a variety. Moreover, our definition provides many other opportunities for investigations in the spirit of those carried out for representable relation algebras.

math.LO

Dual digraphs of finite meet-distributive and modular lattices

We describe the digraphs that are dual representations of finite lattices satisfying conditions related to meet-distributivity and modularity. This is done using the dual digraph representation of finite lattices by Craig, Gouveia and Haviar (2015). These digraphs, known as TiRS digraphs, have their origins in the dual representations of lattices by Urquhart (1978) and Plo\v{s}\v{c}ica (1995). We describe two properties of finite lattices which are weakenings of (upper) semimodularity and lower semimodularity respectively, and then show how these properties have a simple description in the dual digraphs. Combined with previous work on dual digraphs of semidistributive lattices (2022), it leads to a dual representation of finite meet-distributive lattices. This provides a natural link to finite convex geometries. In addition, we present two sufficient conditions on a finite TiRS digraph for its dual lattice to be modular. We close by posing four open problems.

math.RA

Expanding Belnap 2: the dual category in depth

Bilattices, which provide an algebraic tool for simultaneously modelling knowledge and truth, were introduced by N.D. Belnap in a 1977 paper entitled 'How a computer should think'. Prioritised default bilattices include not only Belnap's four values, for `true' ($t$), `false'($f$), `contradiction' ($\top$) and `no information' ($\bot$), but also indexed families of default values for simultaneously modelling degrees of knowledge and truth. Prioritised default bilattices have applications in a number of areas including artificial intelligence. In our companion paper, we introduced a new family of prioritised default bilattices, $\mathbf J_n$, for $n \in \omega$, with $\mathbf J_0$ being Belnap's seminal example. We gave a duality for the variety $\mathcal V_n$ generated by $\mathbf J_n$, with the objects of the dual category $\mathcal X_n$ being multi-sorted topological structures. Here we study the dual category in depth. We give an axiomatisation of the category $\mathcal X_n$ and show that it is isomorphic to a category $\mathcal Y_n$ of single-sorted topological structures. The objects of $\mathcal Y_n$ are Priestley spaces endowed with a continuous retraction in which the order has a natural ranking. We show how to construct the Priestley dual of the underlying bounded distributive lattice of an algebra in $\mathcal V_n$ via its dual in $\mathcal Y_n$; as an application we show that the size of the free algebra $\mathbf F_{\mathcal V_n}(1)$ is given by a polynomial in $n$ of degree $6$.

math.LO

Modelling competing theories

We introduce a complete many-valued semantics for two normal lattice-based modal logics. This semantics is based on reflexive many-valued graphs. We discuss an interpretation and possible applications of this logical framework in the context of the formal analysis of the interaction between (competing) scientific theories.

math.LO

Modelling informational entropy

By 'informational entropy', we understand an inherent boundary to knowability, due e.g. to perceptual, theoretical, evidential or linguistic limits. In this paper, we discuss a logical framework in which this boundary is incorporated into the semantic and deductive machinery, and outline how this framework can be used to model various situations in which informational entropy arises.

math.LO

Expanding Belnap: dualities for a new class of default bilattices

Bilattices provide an algebraic tool with which to model simultaneously knowledge and truth. They were introduced by Belnap in 1977 in a paper entitled \emph{How a computer should think}. Belnap argued that instead of using a logic with two values, for `true' ($t$) and `false' ($f$), a computer should use a logic with two further values, for `contradiction' ($\top$) and `no information' ($\bot$). The resulting structure is equipped with two lattice orders, a \emph{knowledge order} and a \emph{truth order}, and hence is called a \emph{bilattice}. Prioritised default bilattices include not only values for `true' ($t_0$), `false' ($f_0$), `contradiction' and `no information', but also indexed families of default values, $t_1, \dots, t_n$ and $f_1, \dots, f_n$, for simultaneous modelling of degrees of knowledge and truth. We focus on a new family of prioritised default bilattices: $\mathbf J_n$, for $n \in \omega$. The bilattice $\mathbf J_0$ is precisely Belnap's seminal example. We address mathematical rather than logical aspects of our prioritised default bilattices. We obtain a single-sorted topological representation for the bilattices in the quasivariety $\mathcal J_n$ generated by $\mathbf J_n$, and separately a multi-sorted topological representation for the bilattices in the variety $\mathcal V_n$ generated by $\mathbf J_n$. Our results provide an interesting example where the multi-sorted duality for the variety has a simpler structure than the single-sorted duality for the quasivariety.

math.LO

Constructive canonicity for lattice-based fixed point logics

We prove the algorithmic canonicity of two classes of $\mu$-inequalities in a constructive meta-theory of normal lattice expansions. This result simultaneously generalizes Conradie and Craig's canonicity for $\mu$-inequalities based on a bi-intuitionistic bi-modal language, and Conradie and Palmigiano's constructive canonicity for inductive inequalities (restricted to normal lattice expansions to keep the page limit). Besides the greater generality, the unification of these strands smoothes the existing treatments for the canonicity of $\mu$-formulas and inequalities. In particular, the rules of the algorithm ALBA used for this result have exactly the same formulation as those of Conradie and Palmigiano, with no additional rule added specifically to handle the fixed point binders. Rather, fixed points are accounted for by certain restrictions on the application of the rules, concerning the order-theoretic properties of the term functions associated with the formulas to which the rules are applied.

math.LO

Canonicity results for mu-calculi: an algorithmic approach

We investigate the canonicity of inequalities of the intuitionistic mu-calculus. The notion of canonicity in the presence of fixed point operators is not entirely straightforward. In the algebraic setting of canonical extensions we examine both the usual notion of canonicity and what we will call tame canonicity. This latter concept has previously been investigated for the classical mu-calculus by Bezhanishvili and Hodkinson. Our approach is in the spirit of Sahlqvist theory. That is, we identify syntactically-defined classes of inequalities, namely the restricted inductive and tame inductive inequalities, which are, respectively, canonical or tame canonical. Our approach is to use an algorithm which processes inequalities with the aim of eliminating propositional variables. The algorithm we introduce is closely related to the algorithms ALBA and mu-ALBA studied by Conradie, Palmigiano, et al. It is based on a calculus of rewrite rules, the soundness of which rests upon the way in which algebras embed into their canonical extensions and the order-theoretic properties of the latter. We show that the algorithm succeeds on every restricted inductive inequality by means of a so-called proper run, and that this is sufficient to guarantee their canonicity. Likewise, we are able to show that the algorithm succeeds on every tame inductive inequality by means of a so-called tame run. In turn, this guarantees their tame canonicity.

math.LO