رکورد قبلیرکورد بعدی

" Power Algebras over Semirings "


Document Type : BL
Record Number : 579184
Doc. No : b408403
Main Entry : Golan, Jonathan S.
Title & Author : Power Algebras over Semirings : With Applications in Mathematics and Computer Science /\ by Jonathan S. Golan.
Publication Statement : Dordrecht :: Springer Netherlands :: Imprint: Springer,, 1999.
Series Statement : Mathematics and Its Applications ;; 488
ISBN : 9789401592413
: : 9789048152704
Contents : Some (hopefully) motivating examples -- 0: Background material -- 1: Powers of a semiring -- 2: Relations with values in a semiring -- 3: Change of base semirings -- 4: Convolutions -- 5: Semiring-valued subsemigroups and submonoids -- 6: Semiring-valued groups -- 7: Semiring-valued submodules and subspaces -- 8: Semiring-valued ideals in semirings and rings -- References.
Abstract : This monograph is a continuation of several themes presented in my previous books [146, 149]. In those volumes, I was concerned primarily with the properties of semirings. Here, the objects of investigation are sets of the form RA, where R is a semiring and A is a set having a certain structure. The problem is one of translating that structure to RA in some "natural" way. As such, it tries to find a unified way of dealing with diverse topics in mathematics and theoretical com puter science as formal language theory, the theory of fuzzy algebraic structures, models of optimal control, and many others. Another special case is the creation of "idempotent analysis" and similar work in optimization theory. Unlike the case of the previous work, which rested on a fairly established mathematical foundation, the approach here is much more tentative and docimastic. This is an introduction to, not a definitative presentation of, an area of mathematics still very much in the making. The basic philosphical problem lurking in the background is one stated suc cinctly by Hahle and Sostak [185]: ". . . to what extent basic fields of mathematics like algebra and topology are dependent on the underlying set theory?" The conflicting definitions proposed by various researchers in search of a resolution to this conundrum show just how difficult this problem is to see in a proper light.
Subject : Mathematics.
Subject : Computational complexity.
Subject : Algebra.
Subject : Logic, Symbolic and mathematical.
Added Entry : SpringerLink (Online service)
کپی لینک

پیشنهاد خرید
پیوستها
Search result is zero
نظرسنجی
نظرسنجی منابع دیجیتال

1 - آیا از کیفیت منابع دیجیتال راضی هستید؟