2014 Reprint of 1962 Edition. Full facsimile of the original edition, not reproduced with Optical Recognition Software. In "Algebraic Logic" Halmos devised polyadic algebras, an algebraic version of first-order logic differing from the better known cylindric algebras of Alfred Tarski and his students. An elementary version of polyadic algebra is described in monadic Boolean algebra. This book addresses some of the problems of mathematical logic and the theory of polyadic Boolean algebras in particular. It is intended to be an efficient (...) way of treating algebraic logic in a unified manner. (shrink)

We present a Kripke model for Girard's Linear Logic (without exponentials) in a conservative fashion where the logical functors beyond the basic lattice operations may be added one by one without recourse to such things as negation. You can either have some logical functors or not as you choose. Commutatively and associatively are isolated in such a way that the base Kripke model is a model for noncommutative, nonassociative Linear Logic. We also extend the logic by adding a coimplication operator, (...) similar to Curry's subtraction operator, which is resituated with Linear Logic's contensor product. And we can add contraction to get nondistributive Relevance Logic. The model rests heavily on Urquhart's representation of nondistributive lattices and also on Dunn's Gaggle Theory. Indeed, the paper may be viewed as an investigation into nondistributive Gaggle Theory restricted to binary operations. The valuations on the Kripke model are three valued: true, false, and indifferent. The lattice representation theorem of Urquhart has the nice feature of yielding Priestley's representation theorem for distributive lattices if the original lattice happens to be distributive. Hence the representation is consistent with Stone's representation of distributive and Boolean lattices, and our semantics is consistent with the Lemmon-Scott representation of modal algebras and the Routley-Meyer semantics for Relevance Logic. (shrink)

A systematic approach to the algebraic and Kripke semantics for logics with restricted structural rules, notably for logics on an underlying non-distributive lattice, is developed. We provide a new topological representation theorem for general lattices, using the filter space X. Our representation involves a galois connection on subsets of X, hence a closure operator $\Gamma$, and the image of the representation map is characterized as the collection of $\Gamma$-stable, compact-open subsets of the filter space . The original lattice ${\cal L}$ (...) is thus imbedded in the complete lattice of stable sets. The representation is shown to be functorial and is extended to a Stone-type duality. ;In the presence of additional operators, the extension problem is addressed in terms of what we call adjoint completions of normal operators. An operator f on a lattice L is normal if f: $L\sp{} \times \cdots \times L\sp{} \to L\sp{}$ is a monotone map, where each $L\sp{}$, $i \in n$ + 1, is either L or $L\sp{op}$ and f sends finite joins of $L\sp{}$ to joins in $L\sp{}$. Every familiar operator, such as $\circ$ , + , $\gets, \to, \neg, \square$ O is normal. By a uniform argument we show that normal operators $f\sb{i}$ on L extend to operators $F\sb{i}$ on $\Gamma X$ that distribute over arbitrary joins or meets and that \sb{i\in I})$ is a universal such extension. ;We also raise and resolve the question of representability of operators on stable sets by relations. We give an extensive number of examples of representation of specific operators and provide explicit constructions of canonical Kripke frames, based on our extension arguments, for a number of logical systems, notably for Intuitionistic and Classical Linear Logics, or Non-commutative Linear Logic and of fragments thereof. (shrink)

W. J. Blok and Don Pigozzi set out to try to answer the question of what it means for a logic to have algebraic semantics. In this seminal book they transformed the study of algebraic logic by giving a general framework for the study of logics by algebraic means. The Dutch mathematician W. J. Blok (1947-2003) received his doctorate from the University of Amsterdam in 1979 and was Professor of Mathematics at the University of Illinois, Chicago until his death in (...) an automobile accident. Don Pigozzi (1935- ) grew up in Oakland, California, received his doctorate from the University of California, Berkeley in 1970, and was Professor of Mathematics at Iowa State University until his retirement in 2002. The Advanced Reasoning Forum is pleased to make available in its Classic Reprints series this exact reproduction of the 1989 text, with a new errata sheet prepared by Don Pigozzi. (shrink)

This paper presents duality results between categories of neighbourhood frames for modal logic and categories of modal algebras (i.e. Boolean algebras with an additional unary operation). These results extend results of Goldblatt and Thomason about categories of relational frames for modal logic.

The purpose of this paper is to connect the proof theory and the model theory of a family of propositional logics weaker than Heyting's. This family includes systems analogous to the Lambek calculus of syntactic categories, systems of relevant logic, systems related toBCK algebras, and, finally, Johansson's and Heyting's logic. First, sequent-systems are given for these logics, and cut-elimination results are proved. In these sequent-systems the rules for the logical operations are never changed: all changes are made in the structural (...) rules. Next, Hubert-style formulations are given for these logics, and algebraic completeness results are demonstrated with respect to residuated lattice-ordered groupoids. Finally, model structures related to relevant model structures (of Urquhart, Fine, Routley, Meyer, and Maksimova) are given for our logics. These model structures are based on groupoids parallel to the sequent-systems. This paper lays the ground for a kind of correspondence theory for axioms of logics with implication weaker than Heyting's, a correspondence theory analogous to the correspondence theory for modal axioms of normal modal logics.The first part of the paper, which follows, contains the first two sections, which deal with sequent-systems and Hubert-formulations. The second part, due to appear in the next issue of this journal, will contain the third section, which deals with groupoid models. (shrink)

The initial sections of this text deal with syntactical matters such as logical formalism, cut-elimination, and the embedding of intuitionistic logic in classical linear logic. Concluding chapters focus on proofnets for the multiplicative fragment and the algorithmic interpretation of cut-elimination in proofnets.

Substructural logics are logics obtained from a sequent formulation of intuitionistic or classical logic by rejecting some structural rules. The substructural logics considered here are linear logic, relevant logic and BCK logic. It is proved that first-order variants of these logics with an intuitionistic negation can be embedded by modal translations into S4-type extensions of these logics with a classical, involutive, negation. Related embeddings via translations like the double-negation translation are also considered. Embeddings into analogues of S4 are obtained with (...) the help of cut elimination for sequent formulations of our substructural logics and their modal extensions. These results are proved for systems with equality too. (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)

This paper is an investigation into the logic of information flow. The basic perspective is that logic flows in virtue of constraints and that constraints classify channels connecting particulars In this paper we explore some logics intended to model reasoning in the case of idealized information flow, that is, where the constraints involved are exceptionless. We look at this as a step toward the far more challenging task of understanding the logic of imperfect information flow, that is where the constraints (...) admit of exceptional connections. This paper continues and amplifies work presented by the same authors in [10]. (shrink)

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)

Although we believe the results reported below to have direct philosophical import, we shall for the most part confine our remarks to the realm of mathematics. The reader is referred to [4] for a philosophically oriented discussion, comprehensible to mathematicians, of tense logic.The “minimal” tense logicT0is the system having connectives ∼, →,F(“at some future time”), andP(“at some past time”); the following axioms:(whereGandHabbreviate ∼F∼ and ∼P∼ respectively); and the following rules:(8) fromαandα → β, inferβ,(9) fromα, infer any substitution instance ofα,(10) fromα, (...) inferGα,(11) fromα, inferHα.A tense logic is a systemTwhose language is that ofT0and whose axioms and rules include (1)–(11). The axioms and rules ofTother than (1)–(11) are calledproperaxioms and rules.We shall investigate three systems of semantics for tense logics, i.e. three notions ofstructureand three relations ⊧ which stand between structures and formulas. One reads⊧αas “αis valid in.” A structureis amodelof a tense logicTif every formula provable inTis valid in. A semantics isadequateforTif the set of models ofTin the semantics is characteristic forT, i.e. if wheneverT ∀ αthen there is a modelofTin the semantics such that∀ α. Two structuresand, possibly from different semantics, are calledequivalent(∼) if exactly the same formulas are valid inas in. (shrink)