![]() |
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
|
Your cart is empty |
||
|
Books > Science & Mathematics > Mathematics > Mathematical foundations > General
This book has a fundamental relationship to the International Seminar on Fuzzy Set Theory held each September in Linz, Austria. First, this volume is an extended account of the eleventh Seminar of 1989. Second, and more importantly, it is the culmination of the tradition of the preceding ten Seminars. The purpose of the Linz Seminar, since its inception, was and is to foster the development of the mathematical aspects of fuzzy sets. In the earlier years, this was accomplished by bringing together for a week small grou ps of mathematicians in various fields in an intimate, focused environment which promoted much informal, critical discussion in addition to formal presentations. Beginning with the tenth Seminar, the intimate setting was retained, but each Seminar narrowed in theme; and participation was broadened to include both younger scholars within, and established mathematicians outside, the mathematical mainstream of fuzzy sets theory. Most of the material of this book was developed over the years in close association with the Seminar or influenced by what transpired at Linz. For much of the content, it played a crucial role in either stimulating this material or in providing feedback and the necessary screening of ideas. Thus we may fairly say that the book, and the eleventh Seminar to which it is directly related, are in many respects a culmination of the previous Seminars.
This monograph treats the theory of Dirichlet forms from a
comprehensive point of view, using "nonstandard analysis." Thus, it
is close in spirit to the discrete classical formulation of
Dirichlet space theory by Beurling and Deny (1958). The discrete
infinitesimal setup makes it possible to study the diffusion and
the jump part using essentially the same methods. This setting has
the advantage of being independent of special topological
properties of the state space and in this sense is a natural one,
valid for both finite- and infinite-dimensional spaces.
Descriptive set theory has been one of the main areas of research
in set theory for almost a century. This text attempts to present a
largely balanced approach, which combines many elements of the
different traditions of the subject. It includes a wide variety of
examples, exercises (over 400), and applications, in order to
illustrate the general concepts and results of the theory.
This book constitutes the refereed proceedings of the 10th International Conference on Typed Lambda Calculi and Applications, TLCA 2011, held in Novi Sad, Serbia, in June 2011 as part of RDP 2011, the 6th Federated Conference on Rewriting, Deduction, and Programming. The 15 revised full papers presented were carefully reviewed and selected from 44 submissions. The papers provide prevailing research results on all current aspects of typed lambda calculi, ranging from theoretical and methodological issues to applications in various contexts addressing a wide variety of topics such as proof-theory, semantics, implementation, types, and programming.
Primarily consisting of talks presented at a workshop at the MSRI during its "Logic Year" 1989-90, this volume is intended to reflect the whole spectrum of activities in set theory. The first section of the book comprises the invited papers surveying the state of the art in a wide range of topics of set-theoretic research. The second section includes research papers on various aspects of set theory and its relation to algebra and topology. Contributors include: J.Bagaria, T. Bartoszynski, H. Becker, P. Dehornoy, Q. Feng, M. Foreman, M. Gitik, L. Harrington, S. Jackson, H. Judah, W. Just, A.S. Kechris, A. Louveau, S. MacLane, M. Magidor, A.R.D. Mathias, G. Melles, W.J. Mitchell, S. Shelah, R.A. Shore, R.I. Soare, L.J. Stanley, B. Velikovic, H. Woodin
Semiring theory stands with a foot in each of two mathematical domains. The first being abstract algebra and the other the fields of applied mathematics such as optimization theory, the theory of discrete-event dynamical systems, automata theory, and formal language theory, as well as from the allied areas of theoretical computer science and theoretical physics. Most important applications of semiring theory in these areas turn out to revolve around the problem of finding the equalizer of a pair of affine maps between two semimodules. In this volume, we chart the state of the art on solving this problem, and present many specific cases of applications. This book is essentially the third part of a trilogy, along with Semirings and their Applications, and Power Algebras over Semirings, both written by the same author and published by Kluwer Academic Publishers in 1999. While each book can be read independently of the others, to get the full force of the theory and applications one should have access to all three. This work will be of interest to academic and industrial researchers and graduate students. The intent of the book is to bring the applications to the attention of the abstract mathematicians and to make the abstract mathematics available to those who are using these tools in an ad-hoc manner without realizing the full force of the theory.
The modern discussion on the concept of truthlikeness was started in 1960. In his influential Word and Object, W. V. O. Quine argued that Charles Peirce's definition of truth as the limit of inquiry is faulty for the reason that the notion 'nearer than' is only "defined for numbers and not for theories." In his contribution to the 1960 International Congress for Logic, Methodology, and Philosophy of Science at Stan ford, Karl Popper defended the opposite view by defining a compara tive notion of verisimilitude for theories. was originally introduced by the The concept of verisimilitude Ancient sceptics to moderate their radical thesis of the inaccessibility of truth. But soon verisimilitudo, indicating likeness to the truth, was confused with probabilitas, which expresses an opiniotative attitude weaker than full certainty. The idea of truthlikeness fell in disrepute also as a result of the careless, often confused and metaphysically loaded way in which many philosophers used - and still use - such concepts as 'degree of truth', 'approximate truth', 'partial truth', and 'approach to the truth'. Popper's great achievement was his insight that the criticism against truthlikeness - by those who urge that it is meaningless to speak about 'closeness to truth' - is more based on prejudice than argument."
Relational methods can be found at various places in computer science, notably in data base theory, relational semantics of concurrency, relationaltype theory, analysis of rewriting systems, and modern programming language design. In addition, they appear in algorithms analysis and in the bulk of discrete mathematics taught to computer scientists. This book is devoted to the background of these methods. It explains how to use relational and graph-theoretic methods systematically in computer science. A powerful formal framework of relational algebra is developed with respect to applications to a diverse range of problem areas. Results are first motivated by practical examples, often visualized by both Boolean 0-1-matrices and graphs, and then derived algebraically.
Introduction to Fuzzy Reliability treats fuzzy methodology in hardware reliability and software reliability in a relatively systematic manner. The contents of this book are organized as follows. Chapter 1 places reliability engineering in the scope of a broader area, i.e. system failure engineering. Readers will find that although this book is confined to hardware and software reliability, it may be useful for other aspects of system failure engineering, like maintenance and quality control. Chapter 2 contains the elementary knowledge of fuzzy sets and possibility spaces which are required reading for the rest of this book. This chapter is included for the overall completeness of the book, but a few points (e.g. definition of conditional possibility and existence theorem of possibility space) may be new. Chapter 3 discusses how to calculate probist system reliability when the component reliabilities are represented by fuzzy numbers, and how to analyze fault trees when probabilities of basic events are fuzzy. Chapter 4 presents the basic theory of profust reliability, whereas Chapter 5 analyzes the profust reliability behavior of a number of engineering systems. Chapters 6 and 7 are devoted to probist reliability theory from two different perspectives. Chapter 8 discusses how to model software reliability behavior by using fuzzy methodology. Chapter 9 includes a number of mathematical problems which are raised by applications of fuzzy methodology in hardware and software reliability, but may be important for fuzzy set and possibility theories.
Relevance logics came of age with the one and only International Conference on relevant logics in 1974. They did not however become accepted, or easy to promulgate. In March 1981 we received most of the typescript of IN MEMORIAM: ALAN ROSS ANDERSON Proceedings of the International Conference of Relevant Logic from the original editors, Kenneth W. Collier, Ann Gasper and Robert G. Wolf of Southern Illinois University. 1 They had, most unfortunately, failed to find a publisher - not, it appears, because of overall lack of merit of the essays, but because of the expense of producing the collection, lack of institutional subsidization, and doubts of publishers as to whether an expensive collection of essays on such an esoteric, not to say deviant, subject would sell. We thought that the collection of essays was still (even after more than six years in the publishing trade limbo) well worth publishing, that the subject would remain undeservedly esoteric in North America while work on it could not find publishers (it is not so esoteric in academic circles in Continental Europe, Latin America and the Antipodes) and, quite important, that we could get the collection published, and furthermore, by resorting to local means, published comparatively cheaply. It is indeed no ordinary collection. It contains work by pioneers of the main types of broadly relevant systems, and by several of the most innovative non-classical logicians of the present flourishing logical period. We have slowly re-edited and reorganised the collection and made it camera-ready.
The first of a two volume set showcasing current research in model theory and its connections with number theory, algebraic geometry, real analytic geometry and differential algebra. Each volume contains a series of expository essays and research papers around the subject matter of a Newton Institute Semester on Model Theory and Applications to Algebra and Analysis. The articles convey outstanding new research on topics such as model theory and conjectures around Mordell-Lang; arithmetic of differential equations, and Galois theory of difference equations; model theory and complex analytic geometry; o-minimality; model theory and noncommutative geometry; definable groups of finite dimension; Hilbert's tenth problem; and Hrushovski constructions. With contributions from so many leaders in the field, this book will undoubtedly appeal to all mathematicians with an interest in model theory and its applications, from graduate students to senior researchers and from beginners to experts.
The second of a two volume set showcasing current research in model theory and its connections with number theory, algebraic geometry, real analytic geometry and differential algebra. Each volume contains a series of expository essays and research papers around the subject matter of a Newton Institute Semester on Model Theory and Applications to Algebra and Analysis. The articles convey outstanding new research on topics such as model theory and conjectures around Mordell-Lang; arithmetic of differential equations, and Galois theory of difference equations; model theory and complex analytic geometry; o-minimality; model theory and non-commutative geometry; definable groups of finite dimension; Hilbert's tenth problem; and Hrushovski constructions. With contributions from so many leaders in the field, this book will undoubtedly appeal to all mathematicians with an interest in model theory and its applications, from graduate students to senior researchers and from beginners to experts.
In the six years since the first edition of this book was published, the field of Structural Complexity has grown quite a bit. However, we are keeping this volume at the same basic level that it had in the first edition, and the only new result incorporated as an appendix is the closure under complementation of nondeterministic space classes, which in the previous edition was posed as an open problem. This result was already included in our Volume II, but we feel that due to the basic nature of the result, it belongs to this volume. There are of course other important results obtained during these last six years. However, as they belong to new areas opened in the field they are outside the scope of this fundamental volume. Other changes in this second edition are the update of some Bibliograph ical Remarks and references, correction of many mistakes and typos, and a renumbering of the definitions and results. Experience has shown us that this new numbering is a lot more friendly, and several readers have confirmed this opinion. For the sake of the reader of Volume II, where all references to Volume I follow the old numbering, we have included here a table indicating the new number corresponding to each of the old ones."
This is a motivated presentation of recent results on tree transducers, applied to studying the general properties of formal models and for providing semantics to context-free languages. The authors consider top-down tree transducers, macro tree transducers, attributed tree transducers, and macro attributed tree transducers. A unified terminology is used to define them, and their transformational capacities are compared. This handbook on tree transducers will serve as a base for further research.
Fuzzy technology has emerged as one of the most exciting new concepts available. Fuzzy Logic and its Applications... covers a wide range of the theory and applications of fuzzy logic and related systems, including industrial applications of fuzzy technology, implementing human intelligence in machines and systems. There are four main themes: intelligent systems, engineering, mathematical foundations, and information sciences. Both academics and the technical community will learn how and why fuzzy logic is appreciated in the conceptual, design and manufacturing stages of intelligent systems, gaining an improved understanding of the basic science and the foundations of human reasoning.
In 1965 Juris Hartmanis and Richard E. Stearns published a paper "On the Computational Complexity of Algorithms." The field of complexity theory takes its name from this seminal paper and many of the major concepts and issues of complexity theory were introduced by Hartmanis in subsequent work. In honor of the contribution of Juris Hartmanis to the field of complexity theory, a special session of invited talks by Richard E. Stearns, Allan Borodin and Paul Young was held at the third annual meeting of the Structure in Complexity conference, and the first three chapters of this book are the final versions of these talks. They recall intellectual and professional trends in Hartmanis' contributions. All but one of the remainder of the chapters in this volume originated as a presentation at one of the recent meetings of the Structure in Complexity Theory Conference and appeared in preliminary form in the conference proceedings. In all, these expositions form an excellent description of much of contemporary complexity theory.
Now approaching its tenth year, this hugely successful book
presents an unusual attempt to publicise the field of Complex
Dynamics. The text was originally conceived as a supplemented
catalogue to the exhibition "Frontiers of Chaos," seen in Europe
and the United States, and describes the context and meaning of
these fascinating images. A total of 184 illustrations - including
88 full-colour pictures of Julia sets - are suggestive of a
coffee-table book.
J. Richard Biichi is well known for his work in mathematical logic and theoretical computer science. (He himself would have sharply objected to the qualifier "theoretical," because he more or less identified science and theory, using "theory" in a broader sense and "science" in a narrower sense than usual.) We are happy to present here this collection of his papers. I (DS)1 worked with Biichi for many years, on and off, ever since I did my Ph.D. thesis on his Sequential Calculus. His way was to travel locally, not globally: When we met we would try some specific problem, but rarely dis cussed research we had done or might do. After he died in April 1984 I sifted through the manuscripts and notes left behind and was dumbfounded to see what areas he had been in. Essentially I knew about his work in finite au tomata, monadic second-order theories, and computability. But here were at least four layers on his writing desk, and evidently he had been working on them all in parallel. I am sure that many people who knew Biichi would tell an analogous story."
Approach your problems from the right end It isn't that they can't see the solution. It is and begin with the answers. Then one day, that they can't see the problem. perhaps you will tind the tinal question. G. K. Chesterton. The Scandal of Father Brown 'The point of a Pin'. 'The Hermit CIad in Crane Feathers' in R. van Gulik's The Chinese Maze Murders. Growing specialization and diversification have brought a host of monographs and textbooks on increasingly specialized topics. However, the "tree" of knowledge of mathematics and related fields does not grow only by putting forth new branches. It also happens, quite of ten in fact, that branches which were thought to be completely disparate are suddenly seen to be related. Further, the kind and level of sophistication of mathematics applied in various sciences has changed drastically in recent years: measure theory is used (non-trivially) in regional and theoretical economics; algebraic geometry interacts with physics; the Minkowsky lemma, coding theory and the structure of water meet one another in packing and covering theory; quantum fields, crystal defects and mathematical programming profit from homotopy theory; Lie algebras are relevant to fiItering; and prediction and electrical engineering can use Stein spaces. And in addition to this there are such new emerging subdisciplines as "experimental mathematics," "CFD," "completely integrable systems," "chaos, synergetics and large-scale order," which are almost impossible to fit into the existing classification schemes. They draw upon widely different sections of mathematics.
Since scientific software is the fuel that drives today's computers to solve a vast range of problems, huge efforts are being put into the development of new software, systems and algorithms for scientific problem solving. This book explores how scientific software impacts the structure of mathematics, how it creates new subfields, and how new classes of mathematical problems arise. The focus is on five topics where the impact is currently being felt and where important new challenges exist, namely: the new subfield of parallel and geometric computations, the emergence of symbolic computation systems into "general" use, the potential emergence of new, high-level mathematical systems, and the crucial question of how to measure the performance of mathematical problem solving tools.
This volume presents a unified approach to the mathematical theory of a wide class of non-additive set functions, the so called null-additive set functions, which also includes classical measure theory. It includes such important set functions as capacities, triangular set functions, some fuzzy measures, submeasures, decomposable measures, possibility measures, distorted probabilities, autocontinuous set functions, etc. The usefulness of the theory is demonstrated by applications in nonlinear differential and difference equations; fractal geometry in the theory of chaos; the approximation of functions in modular spaces by nonlinear singular integral operators; and in the theory of diagonal theorems as a universal method for proving general and fundamental theorems in functional analysis and measure theory. Audience: This book will be of value to researchers and postgraduate students in mathematics, as well as in such diverse fields as knowledge engineering, artificial intelligence, game theory, statistics, economics, sociology and industry.
This volume, the 6th volume in the DRUMS Handbook series, is part of the after math of the successful ESPRIT project DRUMS (Defeasible Reasoning and Un certainty Management Systems) which took place in two stages from 1989-1996. In the second stage (1993-1996) a work package was introduced devoted to the topics Reasoning and Dynamics, covering both the topics of 'Dynamics of Rea soning', where reasoning is viewed as a process, and 'Reasoning about Dynamics', which must be understood as pertaining to how both designers of and agents within dynamic systems may reason about these systems. The present volume presents work done in this context. This work has an emphasis on modelling and formal techniques in the investigation of the topic "Reasoning and Dynamics," but it is not mere theory that occupied us. Rather research was aimed at bridging the gap between theory and practice. Therefore also real-life applications of the modelling techniques were considered, and we hope this also shows in this volume, which is focused on the dynamics of reasoning processes. In order to give the book a broader perspective, we have invited a number of well-known researchers outside the project but working on similar topics to contribute as well. We have very pleasant recollections of the project, with its lively workshops and other meetings, with the many sites and researchers involved, both within and outside our own work package."
D. Hilbert, in his famous program, formulated many open mathematical problems which were stimulating for the development of mathematics and a fruitful source of very deep and fundamental ideas. During the whole 20th century, mathematicians and specialists in other fields have been solving problems which can be traced back to Hilbert's program, and today there are many basic results stimulated by this program. It is sure that even at the beginning of the third millennium, mathematicians will still have much to do. One of his most interesting ideas, lying between mathematics and physics, is his sixth problem: To find a few physical axioms which, similar to the axioms of geometry, can describe a theory for a class of physical events that is as large as possible. We try to present some ideas inspired by Hilbert's sixth problem and give some partial results which may contribute to its solution. In the Thirties the situation in both physics and mathematics was very interesting. A.N. Kolmogorov published his fundamental work Grundbegriffe der Wahrschein lichkeitsrechnung in which he, for the first time, axiomatized modern probability theory. From the mathematical point of view, in Kolmogorov's model, the set L of ex perimentally verifiable events forms a Boolean a-algebra and, by the Loomis-Sikorski theorem, roughly speaking can be represented by a a-algebra S of subsets of some non-void set n."
Many years of practical experience in teaching discrete mathematics form the basis of this text book. Part I contains problems on such topics as Boolean algebra, k-valued logics, graphs and networks, elements of coding theory, automata theory, algorithms theory, combinatorics, Boolean minimization and logical design. The exercises are preceded by ample theoretical background material. For further study the reader is referred to the extensive bibliography. Part II follows the same structure as Part I, and gives helpful hints and solutions. Audience: This book will be of great value to undergraduate students of discrete mathematics, whereas the more difficult exercises, which comprise about one-third of the material, will also appeal to postgraduates and researchers.
Despite decades of work in evolutionary algorithms, there remains a lot of uncertainty as to when it is beneficial or detrimental to use recombination or mutation. This book provides a characterization of the roles that recombination and mutation play in evolutionary algorithms. It integrates prior theoretical work and introduces new theoretical techniques for studying evolutionary algorithms. An aggregation algorithm for Markov chains is introduced which is useful for studying not only evolutionary algorithms specifically, but also complex systems in general. Practical consequences of the theory are explored and a novel method for comparing search and optimization algorithms is introduced. A focus on discrete rather than real-valued representations allows the book to bridge multiple communities, including evolutionary biologists and population geneticists. |
You may like...
The New Method Arithmetic [microform]
P (Phineas) McIntosh, C a (Carl Adolph) B 1879 Norman
Hardcover
R921
Discovery Miles 9 210
Key to Advanced Arithmetic for Canadian…
Barnard 1817-1876 Smith, Archibald McMurchy
Hardcover
R863
Discovery Miles 8 630
The High School Arithmetic - for Use in…
W. H. Ballard, A. C. McKay, …
Hardcover
R981
Discovery Miles 9 810
|