An l-hemi-implicative semilattice is an algebra $$\mathbf {A} = $$ A= such that $$$$ is a semilattice with a greatest element 1 and satisfies: for every $$a,b,c\in A$$ a,b,c∈A, $$a\le b\rightarrow c$$ a≤b→c implies $$a\wedge b \le c$$ a∧b≤c and $$a\rightarrow a = 1$$ a→a=1. An l-hemi-implicative semilattice is commutative if if it satisfies that $$a\rightarrow b = b\rightarrow a$$ a→b=b→a for every $$a,b\in A$$ a,b∈A. It is shown that the class of l-hemi-implicative semilattices (...) is a variety. These algebras provide a general framework for the study of different algebras of interest in algebraic logic. In any l-hemi-implicative semilattice it is possible to define an derived operation by $$a \sim b := \wedge $$ a∼b:=∧. Endowing $$$$ with the binary operation $$\sim $$ ∼ the algebra $$$$ results an l-hemi-implicative semilattice, which also satisfies the identity $$a \sim b = b \sim a$$ a∼b=b∼a. In this article, we characterize the commutative l-hemi-implicative semilattices. We also provide many new examples of l-hemi-implicative semilattice on any semillatice with greatest element. Finally, we characterize congruences on the classes of l-hemi-implicative semilattices introduced earlier and we characterize the principal congruences of l-hemi-implicative semilattices. (shrink)

Hilbert algebras provide the equivalent algebraic semantics in the sense of Blok and Pigozzi to the implication fragment of intuitionistic logic. They are closely related to implicative semilattices. Porta proved that every Hilbert algebra has a free implicative semilattice extension. In this paper we introduce the notion of an optimal deductive filter of a Hilbert algebra and use it to provide a different proof of the existence of the free implicative semilattice extension of a Hilbert (...) algebra as well as a simplified characterization of it. The optimal deductive filters turn out to be the traces in the Hilbert algebra of the prime filters of the distributive lattice free extension of the free implicative semilattice extension of the Hilbert algebra. To define the concept of optimal deductive filter we need to introduce the concept of a strong Frink ideal for Hilbert algebras which generalizes the concept of a Frink ideal for posets. (shrink)

We present here, without proofs, some results from a paper which will appear in Latvijskij Matematiˇceckij Ezegodnik.

We prove that the equational theory of a semigroups becomes undecidable if we add a semilattice structure with a ‘touch of symmetric difference’. As a corollary we obtain that the variety of all Boolean algebras with an associative binary operator has a ‘hereditarily’ undecidable equational theory. Our results have implications in logic, e.g. they imply undecidability of modal logics extending the Lambek Calculus and undecidability of Arrow Logics with an associative arrow modality.

Our concern is the completeness problem for spi-logics, that is, sets of implications between strictly positive formulas built from propositional variables, conjunction and modal diamond operators. Originated in logic, algebra and computer science, spi-logics have two natural semantics: meet-semilattices with monotone operators providing Birkhoff-style calculi and first-order relational structures (aka Kripke frames) often used as the intended structures in applications. Here we lay foundations for a completeness theory that aims to answer the question whether the two semantics define the same (...) consequence relations for a given spi-logic. (shrink)

The variety \ of implication zroupoids and a constant 0) was defined and investigated by Sankappanavar :21–50, 2012), as a generalization of De Morgan algebras. Also, in Sankappanavar :21–50, 2012), several subvarieties of \ were introduced, including the subvariety \, defined by the identity: \, which plays a crucial role in this paper. Some more new subvarieties of \ are studied in Cornejo and Sankappanavar that includes the subvariety \ of semilattices with a least element 0. An explicit description of (...) semisimple subvarieties of \ is given in Cornejo and Sankappanavar. It is a well known fact that there is a partial order ) induced by the operation ∧, both in the variety \ of semilattices with a least element and in the variety \ of De Morgan algebras. As both \ and \ are subvarieties of \ and the definition of partial order can be expressed in terms of the implication and the constant, it is but natural to ask whether the relation \ on \ is actually a partial order in some subvariety of \ that includes both \ and \. The purpose of the present paper is two-fold: Firstly, a complete answer is given to the above mentioned problem. Indeed, our first main theorem shows that the variety \ is a maximal subvariety of \ with respect to the property that the relation \ is a partial order on its members. In view of this result, one is then naturally led to consider the problem of determining the number of non-isomorphic algebras in \ that can be defined on an n-element chain -chains), n being a natural number. Secondly, we answer this problem in our second main theorem which says that, for each \, there are exactly n nonisomorphic \-chains of size n. (shrink)

In this article, I provide Urquhart-style semilattice semantics for three connexive logics in an implication-negation language (I call these “pure theories of connexive implication”). The systems semantically characterized include the implication-negation fragment of a connexive logic of Wansing, a relevant connexive logic recently developed proof-theoretically by Francez, and an intermediate system that is novel to this article. Simple proofs of soundness and completeness are given and the semantics is used to establish various facts about the systems (e.g., that two (...) of the systems have the variable sharing property). I emphasize the intuitive content of the semantics and discuss how natural informational considerations underly each of the examined systems. (shrink)

It is well-known that intuitionistic logics can be formalized by means of Heyting algebras, i.e. relatively pseudocomplemented semilattices. Within such algebras the logical connectives implication and conjunction are formalized as the relative pseudocomplement and the semilattice operation meet, respectively. If the Heyting algebra has a bottom element |$0$|⁠, then the relative pseudocomplement with respect to |$0$| is called the pseudocomplement and it is considered as the connective negation in this logic. Our idea is to consider an arbitrary meet-semilattice (...) with |$0$| satisfying only the Ascending Chain Condition (these assumptions are trivially satisfied in finite meet-semilattices) and introduce the operators formalizing the connectives negation |$x^{0}$| and implication |$x\rightarrow y$| as the set of all maximal elements |$z$| satisfying |$x\wedge z=0$| and as the set of all maximal elements |$z$| satisfying |$x\wedge z\leq y$|⁠, respectively. Such a negation and implication is ‘unsharp’ since it assigns to one entry |$x$| or to two entries |$x$| and |$y$| belonging to the semilattice, respectively, a subset instead of an element of the semilattice. Surprisingly, this kind of negation and implication still shares a number of properties of these connectives in intuitionistic logic, in particular the derivation rule Modus Ponens. Moreover, unsharp negation and unsharp implication can be characterized by means of five, respectively seven simple axioms. We present several examples. The concepts of a deductive system and of a filter are introduced as well as the congruence determined by such a filter. We finally describe certain relationships between these concepts. (shrink)

Recent research on algebraic models of _quasi-Nelson logic_ has brought new attention to a number of classes of algebras which result from enriching (subreducts of) Heyting algebras with a special modal operator, known in the literature as a _nucleus_. Among these various algebraic structures, for which we employ the umbrella term _intuitionistic modal algebras_, some have been studied since at least the 1970s, usually within the framework of topology and sheaf theory. Others may seem more exotic, for their primitive operations (...) arise from algebraic terms of the intuitionistic modal language which have not been previously considered. We shall for instance investigate the variety of _weak implicative semilattices_, whose members are (non-necessarily distributive) meet semilattices endowed with a nucleus and an implication operation which is not a relative pseudo-complement but satisfies the postulates of Celani and Jansana’s strict implication. For each of these new classes of algebras we establish a representation and a topological duality which generalize the known ones for Heyting algebras enriched with a nucleus. (shrink)

This volume is dedicated to Leo Esakia's contributions to the theory of modal and intuitionistic systems. Consisting of 10 chapters, written by leading experts, this volume discusses Esakia’s original contributions and consequent developments that have helped to shape duality theory for modal and intuitionistic logics and to utilize it to obtain some major results in the area. Beginning with a chapter which explores Esakia duality for S4-algebras, the volume goes on to explore Esakia duality for Heyting algebras and its generalizations (...) to weak Heyting algebras and implicative semilattices. The book also dives into the Blok-Esakia theorem and provides an outline of the intuitionistic modal logic KM which is closely related to the Gödel-Löb provability logic GL. One chapter scrutinizes Esakia’s work interpreting modal diamond as the derivative of a topological space within the setting of point-free topology. The final chapter in the volume is dedicated to the derivational semantics of modal logic and other related issues. (shrink)

The variety of Heyting algebras has two well-behaved locally finite reducts, the variety of bounded distributive lattices and the variety of implicative semilattices. The variety of bounded distributive lattices is generated by the →-free reducts of Heyting algebras, while the variety of implicative semilattices is generated by the ∨-free reducts. Each of these reducts gives rise to canonical formulas that generalize Jankov formulas and provide an axiomatization of all superintuitionistic logics. The ∨-free reducts of Heyting algebras give rise (...) to the -canonical formulas that we studied in an earlier work. Here we introduce the -canonical formulas, which are obtained from the study of the →-free reducts of Heyting algebras. We prove that every si-logic is axiomatizable by -canonical formulas. We also discuss the similarities and differences between these two kinds of canonical formulas. One of the main ingredients of these formulas is a designated subset D of pairs of elements of a finite subdirectly irreducible Heyting algebra A. When D=A2, we show that the -canonical formula of A is equivalent to the Jankov formula of A. On the other hand, when D=∅, the -canonical formulas produce a new class of si-logics we term stable si-logics. We prove that there are continuum many stable si-logics and that all stable si-logics have the finite model property. We also compare stable si-logics to splitting and subframe si-logics. (shrink)

Sahlqvist theory is extended to the fragments of the intuitionistic propositional calculus that include the conjunction connective. This allows us to introduce a Sahlqvist theory of intuitionistic character amenable to arbitrary protoalgebraic deductive systems. As an application, we obtain a Sahlqvist theorem for the fragments of the intuitionistic propositional calculus that include the implication connective and for the extensions of the intuitionistic linear logic.

If $\mathbf{S}$ is a semilattice with operators, then there is an implicational theory $\mathscr{Q}$ such that the congruence lattice $\operatorname{Con}$ is isomorphic to the lattice of all implicational theories containing $\mathscr{Q}$.

I discuss a collection of problems in relevance logic. The main problems discussed are: the decidability of the positive semilattice system, decidability of the fragments of R in a restricted number of variables, and the complexity of the decision problem for the implicational fragment of R. Some related problems are discussed along the way.

A Hilbert algebra with supremum is a Hilbert algebra where the associated order is a join-semilattice. This class of algebras is a variety and was studied in Celani and Montangie . In this paper we shall introduce and study the variety of $${H_{\Diamond}^{\vee}}$$ H ◊ ∨ -algebras, which are Hilbert algebras with supremum endowed with a modal operator $${\Diamond}$$ ◊ . We give a topological representation for these algebras using the topological spectral-like representation for Hilbert algebras with supremum given (...) in Celani and Montangie . We will consider some particular varieties of $${H_{\Diamond}^{\vee}}$$ H ◊ ∨ -algebras. These varieties are the algebraic counterpart of extensions of the implicative fragment of the intuitionistic modal logic $${\mathbf{IntK}_{\Diamond}}$$ IntK ◊ . We also determine the congruences of $${H_{\Diamond}^{\vee}}$$ H ◊ ∨ -algebras in terms of certain closed subsets of the associated space, and in terms of a particular class of deductive systems. These results enable us to characterize the simple and subdirectly irreducible $${H_{\Diamond}^{\vee }}$$ H ◊ ∨ -algebras. (shrink)

In this paper we introduce a class of inquisitive Heyting algebras as algebraic structures that are isomorphic to algebras of finite antichains of bounded implicative meet semilattices. It is argued that these structures are suitable for algebraic semantics of inquisitive superintuitionistic logics, i.e. logics of questions based on intuitionistic logic and its extensions. We explain how questions are represented in these structures and provide several alternative characterizations of these algebras. For instance, it is shown that a Heyting algebra is (...) inquisitive if and only if its prime filters and filters generated by sets of prime elements coincide and prime elements are closed under relative pseudocomplement. We prove that the weakest inquisitive superintuitionistic logic is sound with respect to a Heyting algebra iff the algebra is what we call a homomorphic p-image of some inquisitive Heyting algebra. It is also shown that a logic is inquisitive iff its Lindenbaum–Tarski algebra is an inquisitive Heyting algebra. (shrink)

The semilattice relevant logics ∪R, ∪T, ∪RW, and ∪TW are defined by semilattice models in which conjunction and disjunction are interpreted in a natural way. For each of them, there is a cut-free labelled sequent calculus with plural succedents . We prove that these systems are equivalent, with respect to provable formulas, to the restricted systems with single succedents . Moreover, using this equivalence, we give a new Hilbert-style axiomatizations for ∪R and ∪T and prove equivalence between two (...) semantics for the contractionless logics ∪RW and ∪TW. (shrink)

Boolean algebras are one of the main algebraic tools in the region-based theory of space. T. Ivanova provided strong motivations for the study of mere semilattices with a contact relation. Another significant motivation for considering an even weaker underlying structure comes from event structures with binary conflict in the theory of concurrent systems in computer science. All the above-hinted notions deal with a binary contact relation. Several authors suggested the more general study of n-ary ‘hypercontact’ relations. A similar evolution occurred (...) in the study of the just mentioned event structures in computer science. To unify the above lines of research, in this paper, we study joining semilattices with a hypercontact relation. We provide representation theorems into Boolean algebras. With a single exception, our proofs are choice-free. We also present several examples and problems; in particular, we briefly discuss some connections with event structures and hypergraphs. (shrink)

We devise exact conditions under which a join semilattice with a weak contact relation can be semilattice embedded into a Boolean algebra with an overlap contact relation, equivalently, into a distributive lattice with additive contact relation. A similar characterization is proved with respect to Boolean algebras and distributive lattices with weak contact, not necessarily additive, nor overlap.

Boolean algebras are one of the main algebraic tools in the region-based theory of space. T. Ivanova provided strong motivations for the study of mere semilattices with a contact relation. Another significant motivation for considering an even weaker underlying structure comes from event structures with binary conflict in the theory of concurrent systems in computer science. All the above-hinted notions deal with a binary contact relation. Several authors suggested the more general study of n-ary ‘hypercontact’ relations. A similar evolution occurred (...) in the study of the just mentioned event structures in computer science. To unify the above lines of research, in this paper, we study joining semilattices with a hypercontact relation. We provide representation theorems into Boolean algebras. With a single exception, our proofs are choice-free. We also present several examples and problems; in particular, we briefly discuss some connections with event structures and hypergraphs. (shrink)

The operational semantics of Urquhart is a deep and important part of the development of relevant logics. In this paper, I present an overview of work on Urquhart’s operational semantics. I then present the basics of collection frames. Finally, I show how one kind of collection frame, namely, functional set frames, is equivalent to Urquhart’s semilattice semantics.

Let a be a Kleene's ordinal notation of a nonzero computable ordinal. We give a sufficient condition on a, so that for every \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\Sigma ^{-1}_a$\end{document}‐computable family of two embedded sets, i.e., two sets A, B, with A properly contained in B, the Rogers semilattice of the family is infinite. This condition is satisfied by every notation of ω; moreover every nonzero computable ordinal that is not sum of any two smaller ordinals has a notation that satisfies this condition. On (...) the other hand, we also give a sufficient condition on a, that yields that there is a \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\Sigma ^{-1}_a$\end{document}‐computable family of two embedded sets, whose Rogers semilattice consists of exactly one element; this condition is satisfied by all notations of every successor ordinal bigger than 1, and by all notations of the ordinal ω + ω; moreover every computable ordinal that is sum of two smaller ordinals has a notation that satisfies this condition. We also show that for every nonzero n ∈ ω, or n = ω, and every notation a of a nonzero ordinal there exists a \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\Sigma ^{-1}_a$\end{document}‐computable family of cardinality n, whose Rogers semilattice consists of exactly one element. (shrink)

Limitwise monotonic sets and functions constitute an important tool in computable structure theory. We investigate limitwise monotonic numberings. A numbering ν of a family is limitwise monotonic (l.m.) if every set is the range of a limitwise monotonic function, uniformly in k. The set of all l.m. numberings of S induces the Rogers semilattice. The semilattices exhibit a peculiar behavior, which puts them in‐between the classical Rogers semilattices (for computable families) and Rogers semilattices of ‐computable families. We show that (...) every Rogers semilattice of a ‐computable family is isomorphic to some semilattice. On the other hand, there are infinitely many isomorphism types of classical Rogers semilattices which can be realized as semilattices. In particular, there is an l.m. family S such that is isomorphic to the upper semilattice of c.e. m‐degrees. We prove that if an l.m. family S contains more than one element, then the poset is infinite, and it is not a lattice. The l.m. numberings form an ideal (w.r.t. reducibility between numberings) inside the class of all ‐computable numberings. We prove that inside this class, the index set of l.m. numberings is ‐complete. (shrink)

We look at lower semilattice-ordered residuated semigroups and, in particular, the representable ones, i.e., those that are isomorphic to algebras of binary relations. We will evaluate expressions in representable algebras and give finite axiomatizations for several notions of validity. These results will be applied in the context of substructural logics.

Let MK3 I and MK3 II be Kleene's strong 3-valued matrix with only one and two designated values, respectively. Next, let MK3 G be defined exactly as MK3 I, except th...

Contact algebra is one of the main tools in region-based theory of space. In it is generalized by dropping the operation Boolean complement. Furthermore we can generalize contact algebra by dropping also the operation meet. Thus we obtain structures, called contact join-semilattices and structures, called distributive contact join-semilattices. We obtain a set-theoretical representation theorem for CJS and a relational representation theorem for DCJS. As corollaries we get also topological representation theorems. We prove that the universal theory of CJS and of (...) DCJS is the same and is decidable. (shrink)

The paper discusses regularisation of dualities. A given duality between (concrete) categories, e.g. a variety of algebras and a category of representation spaces, is lifted to a duality between the respective categories of semilattice representations in the category of algebras and the category of spaces. In particular, this gives duality for the regularisation of an irregular variety that has a duality. If the type of the variety includes constants, then the regularisation depends critically on the location or absence of (...) constants within the defining identities. The role of schizophrenic objects is discussed, and a number of applications are given. Among these applications are different forms of regularisation of Priestley, Stone and Pontryagin dualities. (shrink)

Belnap and Dunn’s well-known 4-valued logic FDE is an interesting and useful non-classical logic. FDE is defined by using conjunction, disjunction and negation as the sole propositional connectives. Then the question of expanding FDE with an implication connective is of course of great interest. In this sense, some implicative expansions of FDE have been proposed in the literature, among which Brady’s logic BN4 seems to be the preferred option of relevant logicians. The aim of this paper is to define (...) a class of implicative expansions of FDE in whose elements Boolean negation is definable, whence strong logics such as the paraconsistent and paracomplete logic PŁ4 and BN4 itself are definable, in addition to classical propositional logic. (shrink)

The present paper is a sequel to Robles et al. :349–374, 2020. https://doi.org/10.1007/s10849-019-09306-2). A class of implicative expansions of Kleene’s 3-valued logic functionally including Łukasiewicz’s logic Ł3 is defined. Several properties of this class and/or some of its subclasses are investigated. Properties contemplated include functional completeness for the 3-element set of truth-values, presence of natural conditionals, variable-sharing property and vsp-related properties.

In the early 1970s, Alasdair Urquhart proposed a semilattice semantics for relevance logic which he provided with an influential informational interpretation. In this article, I propose a BHK-inspired reinterpretation of the semantics which is related to Kit Fine’s truthmaker semantics. I discuss and compare Urquhart’s and Fine’s semantics and show how simple modifications of Urquhart’s semantics can be used to characterize both full propositional intuitionistic logic and Jankov’s logic. I then present (quasi-)relevant companions for both of these systems. Finally, (...) I provide sound and complete labelled sequent calculi for all of the systems discussed. (shrink)

We consider${\cal S}$, the class of finite semilattices;${\cal T}$, the class of finite treeable semilattices; and${{\cal T}_m}$, the subclass of${\cal T}$which contains trees with branching bounded bym. We prove that${\cal E}{\cal S}$, the class of finite lattices with linear extensions, is a Ramsey class. We calculate Ramsey degrees for structures in${\cal S}$,${\cal T}$, and${{\cal T}_m}$. In addition to this we give a topological interpretation of our results and we apply our result to canonization of linear orderings on finite semilattices. In (...) particular, we give an example of a Fraïssé class${\cal K}$which is not a Hrushovski class, and for which the automorphism group of the Fraïssé limit of${\cal K}$is not extremely amenable but is uniquely ergodic. (shrink)

Using data on submitted and published manuscripts in Feminist Economics from 1995 to 2019, we examine differences in method and scope used by authors residing in the Global North and Global South. We specifically focus on research methods, intersectional analyses, region of analysis, and co-authorship status. Further, using logistic regression models, we examine the relationship between authors’ location and use of research methods. We find authors in the Global South are more likely to engage in empirical and mixed-methods papers compared (...) to Global North authors in our sample. Moreover, a greater share of Global South authors engage in intersectional analysis and exhibit geographical focus on developing countries. Drawing insights from the Feminist Economics manuscripts data, we argue that encouraging Global South research can contribute to the goals of the field of feminist economics – aimed at inclusivity, diversity of standpoints, and plurality in research methods, thereby improving overall economic research. (shrink)

The duality between congruence lattices of semilattices, and algebraic subsets of an algebraic lattice, is extended to include semilattices with operators. For a set G of operators on a semilattice S, we have \ \cong^{d} {{\rm S}_{p}}}\), where L is the ideal lattice of S, and H is a corresponding set of adjoint maps on L. This duality is used to find some representations of lattices as congruence lattices of semilattices with operators. It is also shown that these congruence (...) lattices satisfy the Jónsson–Kiefer property. (shrink)

ABSTRACTA conditional is natural if it fulfils the three following conditions. It coincides with the classical conditional when restricted to the classical values T and F; it satisfies the Modus Ponens; and it is assigned a designated value whenever the value assigned to its antecedent is less than or equal to the value assigned to its consequent. The aim of this paper is to provide a ‘bivalent’ Belnap-Dunn semantics for all natural implicative expansions of Kleene's strong 3-valued matrix with (...) two designated elements. (shrink)