This book presents the foundations of a general theory of algebras. Often called “universal algebra”, this theory provides a common framework for all algebraic systems, including groups, rings, modules, fields, and lattices. Each chapter is replete with useful illustrations and exercises that solidify the reader's understanding. The book begins by developing the main concepts and working tools of algebras and lattices, and continues with examples of classical algebraic systems like groups, semigroups, monoids, and categories. The essence of the book lies (...) in Chapter 4, which provides not only basic concepts and results of general algebra, but also the perspectives and intuitions shared by practitioners of the field. The book finishes with a study of possible uniqueness of factorizations of an algebra into a direct product of directly indecomposable algebras. There is enough material in this text for a two semester course sequence, but a one semester course could also focus primarily on Chapter 4, with additional topics selected from throughout the text. (shrink)

In this paper, we study three representations of lattices by means of a set with a binary relation of compatibility in the tradition of Ploščica. The standard representations of complete ortholattices and complete perfect Heyting algebras drop out as special cases of the first representation, while the second covers arbitrary complete lattices, as well as complete lattices equipped with a negation we call a protocomplementation. The third topological representation is a variant of that of Craig, Haviar, and Priestley. We then (...) extend each of the three representations to lattices with a multiplicative unary modality; the representing structures, like so-called graph-based frames, add a second relation of accessibility interacting with compatibility. The three representations generalize possibility semantics for classical modal logics to non-classical modal logics, motivated by a recent application of modal orthologic to natural language semantics. (shrink)

This new edition of Introduction to Lattices and Order presents a radical reorganization and updating, though its primary aim is unchanged. The explosive development of theoretical computer science in recent years has, in particular, influenced the book's evolution: a fresh treatment of fixpoints testifies to this and Galois connections now feature prominently. An early presentation of concept analysis gives both a concrete foundation for the subsequent theory of complete lattices and a glimpse of a methodology for data analysis that is (...) of commercial value in social science. Classroom experience has led to numerous pedagogical improvements and many new exercises have been added. As before, exposure to elementary abstract algebra and the notation of set theory are the only prerequisites, making the book suitable for advanced undergraduates and beginning graduate students. It will also be a valuable resource for anyone who meets ordered structures. (shrink)

Earlier algebraic semantics for Belnapian modal logics were defined in terms of twist-structures over modal algebras. In this paper we introduce the class of BK -lattices, show that this class coincides with the abstract closure of the class of twist-structures, and it forms a variety. We prove that the lattice of subvarieties of the variety of BK -lattices is dually isomorphic to the lattice of extensions of Belnapian modal logic BK . Finally, we describe invariants determining a twist-structure (...) over a modal algebra. (shrink)

This is also where we begin investigating lattices of logics and varieties, rather than particular examples.

Lattice logic, bilattice logic, and paraconsistent quantum logic are investigated based on monosequent systems. Paraconsistent quantum logic is an extension of lattice logic, and bilattice logic is an extension of paraconsistent quantum logic. Monosequent system is a sequent calculus based on the restricted sequent that contains exactly one formula in both the antecedent and succedent. It is known that a completeness theorem with respect to a lattice-valued semantics holds for a monosequent system for lattice logic. A (...) completeness theorem with respect to a lattice-valued semantics is proved for paraconsistent quantum logic, and a completeness theorem with respect to a bilattice-valued semantics is proved for bilattice logic. Some syntactical properties, including cut-elimination and duality, are also investigated for the monosequent systems for these logics. (shrink)

In this paper a solution of Whitehead’s problem is presented: Starting with a purely mereological system of regions a topological space is constructed such that the class of regions is isomorphic to the Boolean lattice of regular open sets of that space. This construction may be considered as a generalized completion in analogy to the well-known Dedekind completion of the rational numbers yielding the real numbers . The argument of the paper relies on the theories of continuous lattices and (...) “pointless” topology.

. (shrink)

We study the lattice of extensions of four-valued Belnap–Dunn logic, called super-Belnap logics by analogy with superintuitionistic logics. We describe the global structure of this lattice by splitting it into several subintervals, and prove some new completeness theorems for super-Belnap logics. The crucial technical tool for this purpose will be the so-called antiaxiomatic (or explosive) part operator. The antiaxiomatic (or explosive) extensions of Belnap–Dunn logic turn out to be of particular interest owing to their connection to graph theory: (...) the lattice of finitary antiaxiomatic extensions of Belnap–Dunn logic is isomorphic to the lattice of upsets in the homomorphism order on finite graphs (with loops allowed). In particular, there is a continuum of finitary super-Belnap logics. Moreover, a non-finitary super-Belnap logic can be constructed with the help of this isomorphism. As algebraic corollaries we obtain the existence of a continuum of antivarieties of De Morgan algebras and the existence of a prevariety of De Morgan algebras which is not a quasivariety. (shrink)

The literature on quantum logic emphasizes that the algebraic structures involved with orthodox quantum mechanics are non distributive. In this paper we develop a particular algebraic structure, the quasi-lattice ( $${\mathfrak{I}}$$ -lattice), which can be modeled by an algebraic structure built in quasi-set theory $${\mathfrak{Q}}$$. This structure is non distributive and involve indiscernible elements. Thus we show that in taking into account indiscernibility as a primitive concept, the quasi-lattice that ‘naturally’ arises is non distributive.

The lattices of the title generalize the concept of a De Morgan lattice. A representation in terms of ordered topological spaces is described. This topological duality is applied to describe homomorphisms, congruences, and subdirectly irreducible and free lattices in the category. In addition, certain equational subclasses are described in detail.

In lattice theory the two well known equational class of lattices are the distributive lattices and the modular lattices. All distributive lattices are modular however a modular lattice in general is not distributive. In this book, new classes of lattices called supermodular lattices and semi-supermodular lattices are introduced and characterized.

A finitely alternative normal tense logic \ is a normal tense logic characterized by frames in which every point has at most n future alternatives and m past alternatives. The structure of the lattice \\) is described. There are \ logics in \\) without the finite model property, and only one pretabular logic in \\). There are \ logics in \\) which are not finitely axiomatizable. For \, there are \ logics in \\) without the FMP, and infinitely many (...) pretabular extensions of \. (shrink)

Let K be the least normal modal logic and BK its Belnapian version, which enriches K with ‘strong negation’. We carry out a systematic study of the lattice of logics containing BK based on: • introducing the classes of so-called explosive, complete and classical Belnapian modal logics; • assigning to every normal modal logic three special conservative extensions in these classes; • associating with every Belnapian modal logic its explosive, complete and classical counterparts. We investigate the relationships between special (...) extensions and counterparts, provide certain handy characterisations and suggest a useful decomposition of the lattice of logics containing BK. (shrink)

A lattice-valued set theory is formulated by introducing the logical implication $\to$ which represents the order relation on the lattice.

A latarre is a lattice with an arrow. Its axiomatization looks natural. Latarres have a nontrivial theory which permits many constructions of latarres. Latarres appear as an end result of a series of generalizations of better known structures. These include Boolean algebras and Heyting algebras. Latarres need not have a distributive lattice.

In this paper an algebraic system of the new type is proposed (namely, a vectorial lattice). This algebraic system is a lattice for the language of Aristotle’s syllogistic and as well as a lattice for the language of Vasiľév’s syllogistic. A lattice for the language of Aristotle’s syllogistic is called a vectorial lattice on cap-semilattice and a lattice for the language of Vasiľév’s syllogistic is called a vectorial lattice on closure cap-semilattice. These constructions (...) are introduced for the first time. (shrink)

In this note we introduce and study algebras of type such that is a bounded distributive lattice and ⌝ is an operator that satisfies the condition ⌝ = a ⌝ b and ⌝ 0 = 1. We develop the topological duality between these algebras and Priestley spaces with a relation. In addition, we characterize the congruences and the subalgebras of such an algebra. As an application, we will determine the Priestley spaces of quasi-Stone algebras.

Let $\mathcal{M}$ be an o-minimal expansion of a real closed field $R$. We define the notion of a lattice in a locally definable group and then prove that every connected, definably generated subgroup of $\langle R^{n},+\rangle$ contains a definable generic set and therefore admits a lattice.

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)

A polymodal lattice is a distributive lattice carrying an n-place operator preserving top elements and certain finite meets. After exploring some of the basic properties of such structures, we investigate their freely generated instances and apply the results to the corresponding logical systems — polymodal logics — which constitute natural generalizations of the usual systems of modal logic familiar from the literature. We conclude by formulating an extension of Kripke semantics to classical polymodal logic and proving soundness and (...) completeness theorems. (shrink)

In this paper authors for the first time define a new notion called neutrosophic lattices. We define few properties related with them. Three types of neutrosophic lattices are defined and the special properties about these new class of lattices are discussed and developed. This paper is organised into three sections. First section introduces the concept of partially ordered neutrosophic set and neutrosophic lattices. Section two introduces different types of neutrosophic lattices and the final section studies neutrosophic Boolean algebras. Conclusions and (...) results are provided in section three. (shrink)

We give a characterization of the fixed points and of the lattices of fixed points of fuzzy Galois connections. It is shown that fixed points are naturally interpreted as concepts in the sense of traditional logic.

First, we prove that the lattice of all structural strengthenings of a given strongly finite consequence operation is both atomic and coatomic, it has finitely many atoms and coatoms, each coatom is strongly finite but atoms are not of this kind — we settle this by constructing a suitable counterexample. Second, we deal with the notions of hereditary: algebraicness, strong finitisticity and finite approximability of a strongly finite consequence operation. Third, we formulate some conditions which tell us when the (...) lattice of all structural strengthenings of a given strongly finite consequence operation is finite, and subsequently we give some applications of them. (shrink)

Logics designed to deal with vague statements typically allow algebraic semantics such that propositions are interpreted by elements of residuated lattices. The structure of these algebras is in general still unknown, and in the cases that a detailed description is available, to understand its significance for logics can be difficult. So the question seems interesting under which circumstances residuated lattices arise from simpler algebras in some natural way. A possible construction is described in this paper.Namely, we consider pairs consisting of (...) a Brouwerian algebra and an equivalence relation. The latter is assumed to be in a certain sense compatible with the partial order, with the formation of differences, and with the formation of suprema of pseudoorthogonal elements; we then call it an s-equivalence relation. We consider operations which, under a suitable additional assumption, naturally arise on the quotient set. The result is that the quotient set bears the structure of a residuated lattice. Further postulates lead to dual BL-algebras. In the case that we begin with Boolean algebras instead, we arrive at dual MV-algebras. (shrink)

Modal logics are studied in their algebraic disguise of varieties of so-called modal algebras. This enables us to apply strong results of a universal algebraic nature, notably those obtained by B. Jonsson. It is shown that the degree of incompleteness with respect to Kripke semantics of any modal logic containing the axiom □ p → p or containing an axiom of the form $\square^mp \leftrightarrow\square^{m + 1}p$ for some natural number m is 2 ℵ 0 . Furthermore, we show that (...) there exists an immediate predecessor of classical logic (axiomatized by $p \leftrightarrow \square p$ ) which is not characterized by any finite algebra. The existence of modal logics having 2 ℵ 0 immediate predecessors is established. In contrast with these results we prove that the lattice of extensions of S4 behaves much better: a logic extending S4 is characterized by a finite algebra iff it has finitely many extensions and any such logic has only finitely many immediate predecessors, all of which are characterized by a finite algebra. (shrink)

We focus on a particular class of computably enumerable degrees, the array noncomputable degrees defined by Downey, Jockusch, and Stob, to answer questions related to lattice embeddings and definability in the partial ordering of c. e. degrees under Turing reducibility. We demonstrate that the latticeM5 cannot be embedded into the c. e. degrees below every array noncomputable degree, or even below every nonlow array noncomputable degree. As Downey and Shore have proved that M5 can be embedded below every nonlow2 (...) degree, our result is the best possible in terms of array noncomputable degrees and jump classes. Further, this result shows that the array noncomputable degrees are definably different from the nonlow2 degrees. We note also that there are embeddings of M5 in which all five degrees are array noncomputable, and in which the bottom degree is the computable degree 0 but the other four are array noncomputable. (shrink)

It was shown in [3] (see also [5]) that there is a duality between the category of bounded distributive lattices endowed with a join-homomorphism and the category of Priestley spaces endowed with a Priestley relation. In this paper, bounded distributive lattices endowed with a join-homomorphism, are considered as algebras and we characterize the congruences of these algebras in terms of the mentioned duality and certain closed subsets of Priestley spaces. This enable us to characterize the simple and subdirectly irreducible algebras. (...) In particular, Priestley relations enable us to characterize the congruence lattice of the Q-distributive lattices considered in [4]. Moreover, these results give us an effective method to characterize the simple and subdirectly irreducible monadic De Morgan algebras [7].The duality considered in [4], was obtained in terms of the range of the quantifiers, and such a duality was enough to obtain the simple and subdirectly irreducible algebras, but not to characterize the congruences. (shrink)

Special groups [M. Dickmann, F. Miraglia, Special Groups : Boolean-Theoretic Methods in the Theory of Quadratic Forms, Memoirs Amer. Math. Soc., vol. 689, Amer. Math. Soc., Providence, RI, 2000] are a first-order axiomatization of the theory of quadratic forms. In Section 2 we investigate reduced special groups which are a lattice under their natural representation partial order ; we show that this lattice property is preserved under most of the standard constructions on RSGs; in particular finite RSGs and (...) RSGs of finite chain length are lattice ordered. We prove that the lattice property fails for the RSGs of function fields of real algebraic varieties over a uniquely ordered field dense in its real closure, unless their stability index is 1 . We show that Open Problem 1 has a positive answer for the RSG of the field Q . In the final section we explore the meaning of Open Problem 1 for formally real fields, in terms of their orders and real valuations; we introduce the notion of “parameter-rank” of a positive-primitive first-order formula of the language for special groups. (shrink)

Over the past 50 years, Nelson algebras have been extensively studied by distinguished scholars as the algebraic counterpart of Nelson's constructive logic with strong negation. Despite these studies, a comprehensive survey of the topic is currently lacking, and the theory of Nelson algebras remains largely unknown to most logicians. This paper aims to fill this gap by focussing on the essential developments in the field over the past two decades. Additionally, we explore generalisations of Nelson algebras, such as N4-lattices which (...) correspond to the paraconsistent version of Nelson's logic, as well as their applications to other areas of interest to logicians, such as duality and rough set theory. A general representation theorem states that each Nelson algebra is isomorphic to a subalgebra of a rough set-based Nelson algebra induced by a quasiorder. Furthermore, a formula is a theorem of Nelson logic if and only if it is valid in every finite Nelson algebra induced by a quasiorder. (shrink)

The goal of the paper is to develop a universal semantic approach to derivable rules of propositional multiple-conclusion sequent calculi with structural rules, which explicitly involve not only atomic formulas, treated as metavariables for formulas, but also formula set variables, upon the basis of the conception of model introduced in :27–37, 2001). One of the main results of the paper is that any regular sequent calculus with structural rules has such class of sequent models that a rule is derivable in (...) the calculus iff it is sound with respect to each model of the semantics. We then show how semantics of admissible rules of such calculi can be found with using a method of free models. Next, our universal approach is applied to sequent calculi for many-valued logics with equality determinant. Finally, we exemplify this application by studying sequent calculi for some of such logics. (shrink)

This paper concerns intermediate structure lattices Lt, where [MATHEMATICAL SCRIPT CAPITAL N] is an almost minimal elementary end extension of the model ℳ of Peano Arithmetic. For the purposes of this abstract only, let us say that ℳ attains L if L ≅ Lt for some almost minimal elementary end extension of [MATHEMATICAL SCRIPT CAPITAL N]. If T is a completion of PA and L is a finite lattice, then: If some model of T attains L, then every countable (...) model of T does. If some rather classless, ℵ1-saturated model of T attains L, then every model of T does. (shrink)

The well-known logic first degree entailment logic (FDE), introduced by Belnap and Dunn, is defined with |$\wedge $|⁠, |$\vee $| and |$\sim $| as the sole primitive connectives. The aim of this paper is to establish the lattice formed by the class of all 4-valued C-extending implicative expansions of FDE verifying the axioms and rules of Routley and Meyer’s basic logic B and its useful disjunctive extension B|$^{\textrm {d}}$|⁠. It is to be noted that Boolean negation (so, classical propositional (...) logic) is definable in the strongest element in the said class. (shrink)

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}$.

An Ockham lattice is defined to be a distributive lattice with 0 and 1 which is equipped with a dual homomorphic operation. In this paper we prove: (1) The lattice of all equational classes of Ockham lattices is isomorphic to a lattice of easily described first-order theories and is uncountable, (2) every such equational class is generated by its finite members. In the proof of (2) a characterization of orderings of with respect to which the successor (...) function is decreasing is given. (shrink)

-autonomous lattices are the algebraic exponentials and without additive constants. In this paper, we investigate the structure theory of this variety and some of its subvarieties, as well as its relationships with other classes of algebras.

Lattice-gas cellular automaton (LGCA) and lattice Boltzmann (LB) models are promising models for studying emergent behaviour of transport and interaction processes in biological systems. In this chapter, we will emphasise the use of LGCA/LB models and the derivation and analysis of LGCA models ranging from the classical example dynamics of fluid flow to clotting phenomena in cerebral aneurysms and the invasion of tumour cells.

Let T be a one-based theory. We define a notion of width, in the case of T having the finiteness property, for the lattice of finitely generated algebraically closed sets and prove Theorem. Let T be one-based with the finiteness property. If T is of bounded width, then every type in T is nonorthogonal to a weight one type. If T is countable, the converse is true.

Following the idea of L -fuzzy generalized neighborhood systems as introduced by Zhao et al., we will give the join-complete lattice structures of lower and upper approximation operators based on L -fuzzy generalized neighborhood systems. In particular, as special approximation operators based on L -fuzzy generalized neighborhood systems, we will give the complete lattice structures of lower and upper approximation operators based on L -fuzzy relations. Furthermore, if L satisfies the double negative law, then there exists an order (...) isomorphic mapping between upper and lower approximation operators based on L -fuzzy generalized neighborhood systems; when L -fuzzy generalized neighborhood system is serial, reflexive, and transitive, there still exists an order isomorphic mapping between upper and lower approximation operators, respectively, and both lower and upper approximation operators based on L -fuzzy relations are complete lattice isomorphism. (shrink)

In the present paper we continue the investigation of the lattice of subvarieties of the variety of ${\sqrt{\prime}}$ quasi-MV algebras, already started in [6]. Beside some general results on the structure of such a lattice, the main contribution of this work is the solution of a long-standing open problem concerning these algebras: namely, we show that the variety generated by the standard disk algebra D r is not finitely based, and we provide an infinite equational basis for the (...) same variety. (shrink)

ABSTRACTCorrespondence and Shalqvist theories for Modal Logics rely on the simple observation that a relational structure is at the same time the basis for a model of modal logic and for a model of first-order logic with a binary predicate for the accessibility relation. If the underlying set of the frame is split into two components,, and, then frames are at the same time the basis for models of non-distributive lattice logic and of two-sorted, residuated modal logic. This suggests (...) that a reduction of the first to the latter may be possible, encoding Positive Lattice Logic as a fragment of Two-Sorted, Residuated Modal Logic. The reduction is analogous to the well-known Gödel-McKinsey-Tarski translation of Intuitionistic Logic into the S4 system of normal modal logic. In this article, we carry out this reduction in detail and we derive some properties of PLL from corresponding properties of First-Order Logic. The reduction we present is extendible to the case of lattices with operators, making use of recent results by this author on the relational representation of normal lattice expansions. (shrink)

Most material below is ranked around the splittings of lattices of normal modal logics. These splittings are generated by nite subdirect irreducible modal algebras. The actual computation of the splittings is often a rather delicate task. Rened model structures are very useful to this purpose, as well as they are in many other respects. E.g. the analysis of various lattices of extensions, like ES5, ES4:3 etc becomes rather simple, if rened structures are used. But this point will not be touched (...) here. The variety T BA , which corresponds to S4, is congruence- distributive. Hence any every tabular extension L S4 has nite many extensions only. Around 1975 it has been proved by several authors, that also the converse is true: If L S4 has nitely many extensions only, then L is necessarely tabular. These and other results will be extended to much richer lattices. For simplicity we state the results explicitely only for the lattice N of modal logics with one modal operator. But most of them carry over literally to the lattice Nk of k-ramied normal modal logics . It is easy to construct examples of 2-ramied modal logics which are P OST-complete but not tabular. Whether this will be possible for normal modal logic seems to be an open problem. In view of results below it seems very unlikely that such examples exist. (shrink)

In this note we shall show that if L is a balanced pseudocomplemented Ockham algebra then the set ${\fancyscript{I}_{k}(L)}$ of kernel ideals of L is a Heyting lattice that is isomorphic to the lattice of congruences on B(L) where ${B(L) = \{x^* | x \in L\}}$ . In particular, we show that ${\fancyscript{I}_{k}(L)}$ is boolean if and only if B(L) is finite, if and only if every kernel ideal of L is principal.

The theory of concept lattices is approached from the point of view of fuzzy logic. The notions of partial order, lattice order, and formal concept are generalized for fuzzy setting. Presented is a theorem characterizing the hierarchical structure of formal fuzzy concepts arising in a given formal fuzzy context. Also, as an application of the present approach, Dedekind–MacNeille completion of a partial fuzzy order is described. The approach and results provide foundations for formal concept analysis of vague data—the propositions (...) “object x has attribute y”, which form the input data to formal concept analysis, are now allowed to have also intermediate truth values, meeting reality better. (shrink)

Lattice BCK logic is the expansion of the well known Meredith implicational logic BCK expanded with lattice conjunction and disjunction. Although its natural axiomatization has three rules named modus ponens, ∨‐rule and ∧‐rule, we show that we can give an equivalent presentation with just modus ponens and ∧‐rule, however it is impossible to obtain an equivalent presentation with modus ponens as unique rule. In this paper we study and characterize all axiomatic extensions of lattice BCK logic with (...) modus ponens as unique rule. We obtain an infinite chain of proper axiomatic extensions with this property. Moreover, we prove that there is no weakest axiomatic extension of Lattice BCK‐logic admitting modus ponens as unique rule. (shrink)