Skip to main content
Elsevier
View Cart
My account

Books in Order lattices ordered algebraic structures

BooksJournals

    • Semihypergroup Theory

      • 1st Edition
      • June 2, 2016
      • Bijan Davvaz
      • English
      • Paperback
        9 7 8 0 1 2 8 0 9 8 1 5 8
      • eBook
        9 7 8 0 1 2 8 0 9 9 2 5 4
      Semihypergroup Theory is the first book devoted to the semihypergroup theory and it includes basic results concerning semigroup theory and algebraic hyperstructures, which represent the most general algebraic context in which reality can be modelled. Hyperstructures represent a natural extension of classical algebraic structures and they were introduced in 1934 by the French mathematician Marty. Since then, hundreds of papers have been published on this subject.

    • Group Representations

      • 1st Edition
      • Volume 4
      • June 6, 2016
      • Gregory Karpilovsky
      • English
      • eBook
        9 7 8 1 4 8 3 2 9 5 1 0 7
      This volume is divided into three parts. Part I provides the foundations of the theory of modular representations. Special attention is drawn to the Brauer-Swan theory and the theory of Brauer characters. A detailed investigation of quadratic, symplectic and symmetric modules is also provided. Part II is devoted entirely to the Green theory: vertices and sources, the Green correspondence, the Green ring, etc. In Part III, permutation modules are investigated with an emphasis on the study of p-permutation modules and Burnside rings.The material is developed with sufficient attention to detail so that it can easily be read by the novice, although its chief appeal will be to specialists. A number of the results presented in this volume have almost certainly never been published before.

    • Residuated Lattices: An Algebraic Glimpse at Substructural Logics

      • 1st Edition
      • Volume 151
      • April 25, 2007
      • Nikolaos Galatos + 3 more
      • English
      • Paperback
        9 7 8 0 4 4 4 5 5 0 6 6 8
      • Hardback
        9 7 8 0 4 4 4 5 2 1 4 1 5
      • eBook
        9 7 8 0 0 8 0 4 8 9 6 4 3
      The book is meant to serve two purposes. The first and more obvious one is to present state of the art results in algebraic research into residuated structures related to substructural logics. The second, less obvious but equally important, is to provide a reasonably gentle introduction to algebraic logic. At the beginning, the second objective is predominant. Thus, in the first few chapters the reader will find a primer of universal algebra for logicians, a crash course in nonclassical logics for algebraists, an introduction to residuated structures, an outline of Gentzen-style calculi as well as some titbits of proof theory - the celebrated Hauptsatz, or cut elimination theorem, among them. These lead naturally to a discussion of interconnections between logic and algebra, where we try to demonstrate how they form two sides of the same coin. We envisage that the initial chapters could be used as a textbook for a graduate course, perhaps entitled Algebra and Substructural Logics. As the book progresses the first objective gains predominance over the second. Although the precise point of equilibrium would be difficult to specify, it is safe to say that we enter the technical part with the discussion of various completions of residuated structures. These include Dedekind-McNeille completions and canonical extensions. Completions are used later in investigating several finiteness properties such as the finite model property, generation of varieties by their finite members, and finite embeddability. The algebraic analysis of cut elimination that follows, also takes recourse to completions. Decidability of logics, equational and quasi-equational theories comes next, where we show how proof theoretical methods like cut elimination are preferable for small logics/theories, but semantic tools like Rabin's theorem work better for big ones. Then we turn to Glivenko's theorem, which says that a formula is an intuitionistic tautology if and only if its double negation is a classical one. We generalise it to the substructural setting, identifying for each substructural logic its Glivenko equivalence class with smallest and largest element. This is also where we begin investigating lattices of logics and varieties, rather than particular examples. We continue in this vein by presenting a number of results concerning minimal varieties/maximal logics. A typical theorem there says that for some given well-known variety its subvariety lattice has precisely such-and-such number of minimal members (where values for such-and-such include, but are not limited to, continuum, countably many and two). In the last two chapters we focus on the lattice of varieties corresponding to logics without contraction. In one we prove a negative result: that there are no nontrivial splittings in that variety. In the other, we prove a positive one: that semisimple varieties coincide with discriminator ones. Within the second, more technical part of the book another transition process may be traced. Namely, we begin with logically inclined technicalities and end with algebraically inclined ones. Here, perhaps, algebraic rendering of Glivenko theorems marks the equilibrium point, at least in the sense that finiteness properties, decidability and Glivenko theorems are of clear interest to logicians, whereas semisimplicity and discriminator varieties are universal algebra par exellence. It is for the reader to judge whether we succeeded in weaving these threads into a seamless fabric.

    • Handbook of Algebra

      • 1st Edition
      • Volume 4
      • May 30, 2006
      • M. Hazewinkel
      • English
      • Paperback
        9 7 8 0 4 4 4 5 6 1 2 1 3
      • Hardback
        9 7 8 0 4 4 4 5 2 2 1 3 9
      • eBook
        9 7 8 0 0 8 0 4 6 2 4 9 3
      Algebra, as we know it today, consists of many different ideas, concepts and results. A reasonable estimate of the number of these different items would be somewhere between 50,000 and 200,000. Many of these have been named and many more could (and perhaps should) have a name or a convenient designation. Even the nonspecialist is likely to encounter most of these, either somewhere in the literature, disguised as a definition or a theorem or to hear about them and feel the need for more information. If this happens, one should be able to find enough information in this Handbook to judge if it is worthwhile to pursue the quest.In addition to the primary information given in the Handbook, there are references to relevant articles, books or lecture notes to help the reader. An excellent index has been included which is extensive and not limited to definitions, theorems etc.The Handbook of Algebra will publish articles as they are received and thus the reader will find in this third volume articles from twelve different sections. The advantages of this scheme are two-fold: accepted articles will be published quickly and the outline of the Handbook can be allowed to evolve as the various volumes are published.A particularly important function of the Handbook is to provide professional mathematicians working in an area other than their own with sufficient information on the topic in question if and when it is needed.

    • Computable Structures and the Hyperarithmetical Hierarchy

      • 1st Edition
      • Volume 144
      • June 16, 2000
      • C.J. Ash + 1 more
      • English
      • Hardback
        9 7 8 0 4 4 4 5 0 0 7 2 4
      • eBook
        9 7 8 0 0 8 0 5 2 9 5 2 3
      This book describes a program of research in computable structure theory. The goal is to find definability conditions corresponding to bounds on complexity which persist under isomorphism. The results apply to familiar kinds of structures (groups, fields, vector spaces, linear orderings Boolean algebras, Abelian p-groups, models of arithmetic). There are many interesting results already, but there are also many natural questions still to be answered. The book is self-contained in that it includes necessary background material from recursion theory (ordinal notations, the hyperarithmetical hierarchy) and model theory (infinitary formulas, consistency properties).

    • Combinatorics '90

      • 1st Edition
      • Volume 52
      • August 17, 1992
      • A. Barlotti + 3 more
      • English
      • eBook
        9 7 8 0 0 8 0 8 6 7 9 2 2
      This volume forms a valuable source of information on recent developments in research in combinatorics, with special regard to the geometric point of view. Topics covered include: finite geometries (arcs, caps, special varieties in a Galois space; generalized quadrangles; Benz planes; foundation of geometry), partial geometries, Buekenhout geometries, transitive permutation sets, flat-transitive geometries, design theory, finite groups, near-rings and semifields, MV-algebras, coding theory, cryptography and graph theory in its geometric and design aspects.

    • Lukasiewicz-Moisil Algebras

      • 1st Edition
      • Volume 49
      • May 13, 1991
      • V. Boicescu + 3 more
      • English
      • Paperback
        9 7 8 0 4 4 4 5 5 8 3 7 4
      • eBook
        9 7 8 0 0 8 0 8 6 7 8 9 2
      The Lukasiewicz-Moisil algebras were created by Moisil as an algebraic counterpart for the many-valued logics of Lukasiewicz. The theory of LM-algebras has developed to a considerable extent both as an algebraic theory of intrinsic interest and in view of its applications to logic and switching theory.This book gives an overview of the theory, comprising both classical results and recent contributions, including those of the authors. N-valued and &THgr;-valued algebras are presented, as well as &THgr;-algebras with negation.Mathematici... interested in lattice theory or symbolic logic, and computer scientists, will find in this monograph stimulating material for further research.