Contributions to General Algebra
Author:
Publisher:
Published: 1995
Total Pages: 672
ISBN-13:
DOWNLOAD EBOOKPosts
Hyperidentities and Clones
Author: Klaus Denecke
Publisher: CRC Press
Published: 2000-08-08
Total Pages: 334
ISBN-13: 9789056992354
DOWNLOAD EBOOKTheories and results on hyperidentities have been published in various areas of the literature over the last 18 years. Hyperidentities and Clones integrates these into a coherent framework for the first time. The author also includes some applications of hyperidentities to the functional completeness problem in multiple-valued logic and extends the general theory to partial algebras. The last chapter contains exercises and open problems with suggestions for future work in this area of research. Graduate students and mathematical researchers will find Hyperidentities and Clones a thought-provoking and illuminating text that offers a unique opportunity to study the topic in one source.
M-Solid Varieties of Algebras
Author: Jörg Koppitz
Publisher: Springer Science & Business Media
Published: 2006-06-18
Total Pages: 349
ISBN-13: 0387308067
DOWNLOAD EBOOKA complete and systematic introduction to the fundamentals of the hyperequational theory of universal algebra, offering the newest results on solid varieties of semirings and semigroups. The book aims to develop the theory of solid varieties as a system of mathematical discourse that is applicable in several concrete situations. A unique feature of this book is the use of Galois connections to integrate different topics.
Algebraic Informatics
Author: Franz Winkler
Publisher: Springer Science & Business Media
Published: 2011-06-16
Total Pages: 270
ISBN-13: 3642214924
DOWNLOAD EBOOKThis book constitutes the refereed proceedings of the 4th International Conference on Algebraic Informatics, CAI 2011, held in Linz, Austria, in June 2011. The 12 revised full papers presented together with 4 invited articles were carefully reviewed and selected from numerous submissions. The papers cover topics such as algebraic semantics on graph and trees, formal power series, syntactic objects, algebraic picture processing, finite and infinite computations, acceptors and transducers for strings, trees, graphs arrays, etc. decision problems, algebraic characterization of logical theories, process algebra, algebraic algorithms, algebraic coding theory, and algebraic aspects of cryptography.
Polynomial Completeness in Algebraic Systems
Author: Kalle Kaarli
Publisher: CRC Press
Published: 2000-07-21
Total Pages: 375
ISBN-13: 1482285754
DOWNLOAD EBOOKThe study of polynomial completeness of algebraic systems has only recently matured, and until now, lacked a unified treatment. Polynomial Completeness in Algebraic Systems examines the entire field with one coherent approach. The authors focus on the theory of affine complete varieties but also give the primary known results on affine completeness in special varieties. The book includes an extensive introductory chapter that provides the necessary background and makes the results accessible to graduate students as well as researchers. Numerous exercises illustrate the theory, and examples-and counterexamples-clarify the boundaries of the subject.
Ordered Algebraic Structures
Author: W. Charles Holland
Publisher: CRC Press
Published: 2001-04-01
Total Pages: 214
ISBN-13: 9789056993252
DOWNLOAD EBOOKThis book is an outcome of the conference on ordered algebraic structures held at Nanjing. It covers a range of topics: lattice theory, ordered semi groups, partially ordered groups, totally ordered groups, lattice-ordered groups, and ordered fields.
Galois Connections and Applications
Author: K. Denecke
Publisher: Springer Science & Business Media
Published: 2013-11-11
Total Pages: 511
ISBN-13: 1402018983
DOWNLOAD EBOOKGalois connections provide the order- or structure-preserving passage between two worlds of our imagination - and thus are inherent in hu man thinking wherever logical or mathematical reasoning about cer tain hierarchical structures is involved. Order-theoretically, a Galois connection is given simply by two opposite order-inverting (or order preserving) maps whose composition yields two closure operations (or one closure and one kernel operation in the order-preserving case). Thus, the "hierarchies" in the two opposite worlds are reversed or transported when passing to the other world, and going forth and back becomes a stationary process when iterated. The advantage of such an "adjoint situation" is that information about objects and relationships in one of the two worlds may be used to gain new information about the other world, and vice versa. In classical Galois theory, for instance, properties of permutation groups are used to study field extensions. Or, in algebraic geometry, a good knowledge of polynomial rings gives insight into the structure of curves, surfaces and other algebraic vari eties, and conversely. Moreover, restriction to the "Galois-closed" or "Galois-open" objects (the fixed points of the composite maps) leads to a precise "duality between two maximal subworlds".
Concept Lattices and Their Applications
Author: Engelbert Mephu Nguifo
Publisher: Springer Science & Business Media
Published: 2008-03-28
Total Pages: 292
ISBN-13: 3540789200
DOWNLOAD EBOOKAs the refereed proceedings of the Fourth International Conference on Concept Lattices and their Applications, CLA 2006, these 18 revised full papers, together with 3 invited contributions, presented were carefully reviewed and selected from 41 submissions.
Universal Algebra and Applications in Theoretical Computer Science
Author: Klaus Denecke
Publisher: CRC Press
Published: 2018-10-03
Total Pages: 396
ISBN-13: 1482285835
DOWNLOAD EBOOKOver the past 20 years, the emergence of clone theory, hyperequational theory, commutator theory and tame congruence theory has led to a growth of universal algebra both in richness and in applications, especially in computer science. Yet most of the classic books on the subject are long out of print and, to date, no other book has integrated these theories with the long-established work that supports them. Universal Algebra and Applications in Theoretical Computer Science introduces the basic concepts of universal algebra and surveys some of the newer developments in the field. The first half of the book provides a solid grounding in the core material. A leisurely pace, careful exposition, numerous examples, and exercises combine to form an introduction to the subject ideal for beginning graduate students or researchers from other areas. The second half of the book focuses on applications in theoretical computer science and advanced topics, including Mal'cev conditions, tame congruence theory, clones, and commutators. The impact of the advances in universal algebra on computer science is just beginning to be realized, and the field will undoubtedly continue to grow and mature. Universal Algebra and Applications in Theoretical Computer Science forms an outstanding text and offers a unique opportunity to build the foundation needed for further developments in its theory and in its computer science applications.
Polyadic Groups
Author: Wieslaw A. Dudek
Publisher: CRC Press
Published: 2024-03-22
Total Pages: 1736
ISBN-13: 1040001106
DOWNLOAD EBOOKThis book provides a general, unified approach to the theory of polyadic groups, their normal subgroups and matrix representations. The author focuses on those properties of polyadic groups which are not present in the binary case. These properties indicate a strong relationship between polyadic groups and various group-like algebras, as well as ternary Hopf algebras and n-Lie algebras that are widely used in theoretical physics. The relationships of polyadic groups with special types of binary groups, called covering groups and binary retracts, are described. These relationships allow the study of polyadic groups using these binary groups and their automorphisms. The book also describes the affine geometry induced by polyadic groups and fuzzy subsets defined on polyadic groups. Finally, we discuss the categories of polyadic groups and the relationships between the different varieties of polyadic groups. In many cases, we give elegant new proofs of known theorems. We also give many interesting examples and applications. The book contains many little-known results from articles previously published in hard-to-reach Russian, Ukrainian and Macedonian journals. These articles are not in English.
