In his rich and varied career as a mathematician, computer scientist, and educator, Jacob T. Schwartz wrote seminal works in analysis, mathematical economics, programming languages, algorithmics, and computational geometry. In this volume of essays, his friends, students, and collaborators at the Courant Institute of Mathematical Sciences present recent results in some of the fields that Schwartz explored: quantum theory, the theory and practice of programming, program correctness and decision procedures, dextrous manipulation in Robotics, motion planning, and genomics. In addition to presenting recent results in these fields, these essays illuminate the astonishingly productive trajectory of a brilliant and original scientist and thinker.

Every mathematician agrees that every mathematician must know some set theory; the disagreement begins in trying to decide how much is some. This book contains my answer to that question. The purpose of the book is to tell the beginning student of advanced mathematics the basic set theoretic facts of life, and to do so with the minimum of philosophical discourse and logical formalism. The point of view throughout is that of a prospective mathematician anxious to study groups, or integrals, or manifolds. From this point of view the concepts and methods of this book are merely some of the standard mathematical tools; the expert specialist will find nothing new here. Scholarly bibliographical credits and references are out of place in a purely expository book such as this one. The student who gets interested in set theory for its own sake should know, however, that there is much more to the subject than there is in this book. One of the most beautiful sources of set-theoretic wisdom is still Hausdorff's Set theory. A recent and highly readable addition to the literature, with an extensive and up-to-date bibliography, is Axiomatic set theory by Suppes."

Computing systems are of growing importance because of their wide use in many areas including those in safety-critical systems. This book describes the basic models and approaches to the reliability analysis of such systems. An extensive review is provided and models are categorized into different types. Some Markov models are extended to the analysis of some specific computing systems such as combined software and hardware, imperfect debugging processes, failure correlation, multi-state systems, heterogeneous subsystems, etc. One of the aims of the presentation is that based on the sound analysis and simplicity of the approaches, the use of Markov models can be better implemented in the computing system reliability.

One of the attractions of fuzzy logic is its utility in solving many real engineering problems. As many have realised, the major obstacles in building a real intelligent machine involve dealing with random disturbances, processing large amounts of imprecise data, interacting with a dynamically changing environment, and coping with uncertainty. Neural-fuzzy techniques help one to solve many of these problems. Fuzzy Logic and Intelligent Systems reflects the most recent developments in neural networks and fuzzy logic, and their application in intelligent systems. In addition, the balance between theoretical work and applications makes the book suitable for both researchers and engineers, as well as for graduate students.

Fuzzy theory is an interesting name for a method that has been highly effective in a wide variety of significant, real-world applications. A few examples make this readily apparent. As the result of a faulty design the method of computer-programmed trading, the biggest stock market crash in history was triggered by a small fraction of a percent change in the interest rate in a Western European country. A fuzzy theory ap proach would have weighed a number of relevant variables and the ranges of values for each of these variables. Another example, which is rather simple but pervasive, is that of an electronic thermostat that turns on heat or air conditioning at a specific temperature setting. In fact, actual comfort level involves other variables such as humidity and the location of the sun with respect to windows in a home, among others. Because of its great applied significance, fuzzy theory has generated widespread activity internationally. In fact, institutions devoted to research in this area have come into being. As the above examples suggest, Fuzzy Systems Theory is of fundamen tal importance for the analysis and design of a wide variety of dynamic systems. This clearly manifests the fundamental importance of time con siderations in the Fuzzy Systems design approach in dynamic systems. This textbook by Prof. Dr. Jernej Virant provides what is evidently a uniquely significant and comprehensive treatment of this subject on the international scene."

L.E.J. Brouwer (1881-1966) is best known for his revolutionary ideas on topology and foundations of mathematics (intuitionism). The present collection contains a mixture of letters; university and faculty correspondence has been included, some of which shed light on the student years, and in particular on the exchange of letters with his PhD adviser, Korteweg. Acting as the natural sequel to the publication of Brouwer's biography, this book provides instrumental reading for those wishing to gain a deeper understanding of Brouwer and his role in the twentieth century. Striking a good balance of biographical and scientific information, the latter deals with innovations in topology (Cantor-Schoenflies style and the new topology) and foundations. The topological period in his research is well represented in correspondence with Hilbert, Schoenflies, Poincare, Blumenthal, Lebesgue, Baire, Koebe, and foundational topics are discussed in letters exchanged with Weyl, Fraenkel, Heyting, van Dantzig and others. There is also a large part of correspondence on matters related to the interbellum scientific politics. This book will appeal to both graduate students and researchers with an interest in topology, the history of mathematics, the foundations of mathematics, philosophy and general science.

In recent years, an impetuous development of new, unconventional theories, methods, techniques and technologies in computer and information sciences, systems analysis, decision-making and control, expert systems, data modelling, engineering, etc. , resulted in a considerable increase of interest in adequate mathematical description and analysis of objects, phenomena, and processes which are vague or imprecise by their very nature. Classical two-valued logic and the related notion of a set, together with its mathematical consequences, are then often inadequate or insufficient formal tools, and can even become useless for applications because of their (too) categorical character: 'true - false', 'belongs - does not belong', 'is - is not', 'black - white', '0 - 1', etc. This is why one replaces classical logic by various types of many-valued logics and, on the other hand, more general notions are introduced instead of or beside that of a set. Let us mention, for instance, fuzzy sets and derivative concepts, flou sets and twofold fuzzy sets, which have been created for different purposes as well as using distinct formal and informal motivations. A kind of numerical information concerning of 'how many' elements those objects are composed seems to be one of the simplest and more important types of information about them. To get it, one needs a suitable notion of cardinality and, moreover, a possibility to calculate with such cardinalities. Unfortunately, neither fuzzy sets nor the other nonclassical concepts have been equipped with a satisfactory (nonclassical) cardinality theory.

This book grew out of my confusion. If logic is objective how can there be so many logics? Is there one right logic, or many right ones? Is there some underlying unity that connects them? What is the significance of the mathematical theorems about logic which I've learned if they have no connection to our everyday reasoning? The answers I propose revolve around the perception that what one pays attention to in reasoning determines which logic is appropriate. The act of abstracting from our reasoning in our usual language is the stepping stone from reasoned argument to logic. We cannot take this step alone, for we reason together: logic is reasoning which has some objective value. For you to understand my answers, or perhaps better, conjectures, I have retraced my steps: from the concrete to the abstract, from examples, to general theory, to further confirming examples, to reflections on the significance of the work.

This book presents logical foundations of dual tableaux together with a number of their applications both to logics traditionally dealt with in mathematics and philosophy (such as modal, intuitionistic, relevant, and many-valued logics) and to various applied theories of computational logic (such as temporal reasoning, spatial reasoning, fuzzy-set-based reasoning, rough-set-based reasoning, order-of magnitude reasoning, reasoning about programs, threshold logics, logics of conditional decisions). The distinguishing feature of most of these applications is that the corresponding dual tableaux are built in a relational language which provides useful means of presentation of the theories. In this way modularity of dual tableaux is ensured. We do not need to develop and implement each dual tableau from scratch, we should only extend the relational core common to many theories with the rules specific for a particular theory.

Intended for researchers and graduate students in theoretical computer science and mathematical logic, this volume contains accessible surveys by leading researchers from areas of current work in logical aspects of computer science, where both finite and infinite model-theoretic methods play an important role. Notably, the articles in this collection emphasize points of contact and connections between finite and infinite model theory in computer science that may suggest new directions for interaction. Among the topics discussed are: algorithmic model theory, descriptive complexity theory, finite model theory, finite variable logic, model checking, model theory for restricted classes of finite structures, and spatial databases. The chapters all include extensive bibliographies facilitating deeper exploration of the literature and further research.

During 1996-97 MSRI held a full academic-year program on combinatorics, with special emphasis on its connections to other branches of mathematics, such as algebraic geometry, topology, commutative algebra, representation theory, and convex geometry. The rich combinatorial problems arising from the study of various algebraic structures are the subject of this book, which features work done or presented at the program's seminars. The text contains contributions on matroid bundles, combinatorial representation theory, lattice points in polyhedra, bilinear forms, combinatorial differential topology and geometry, Macdonald polynomials and geometry, enumeration of matchings, the generalized Baues problem, and Littlewood-Richardson semigroups. These expository articles, written by some of the most respected researchers in the field, present the state of the art to graduate students and researchers in combinatorics as well as in algebra, geometry, and topology.

This volume contains the accounts of papers delivered at the Nato Advanced Study Institute on Finite and Infinite Combinatorics in Sets and Logic held at the Banff Centre, Alberta, Canada from April 21 to May 4, 1991. As the title suggests the meeting brought together workers interested in the interplay between finite and infinite combinatorics, set theory, graph theory and logic. It used to be that infinite set theory, finite combinatorics and logic could be viewed as quite separate and independent subjects. But more and more those disciplines grow together and become interdependent of each other with ever more problems and results appearing which concern all of those disciplines. I appreciate the financial support which was provided by the N. A. T. O. Advanced Study Institute programme, the Natural Sciences and Engineering Research Council of Canada and the Department of Mathematics and Statistics of the University of Calgary. 11l'te meeting on Finite and Infinite Combinatorics in Sets and Logic followed two other meetings on discrete mathematics held in Banff, the Symposium on Ordered Sets in 1981 and the Symposium on Graphs and Order in 1984. The growing inter-relation between the different areas in discrete mathematics is maybe best illustrated by the fact that many of the participants who were present at the previous meetings also attended this meeting on Finite and Infinite Combinatorics in Sets and Logic.

This volume offers comprehensive coverage of intelligent systems, including fundamental aspects, software-, sensors-, and hardware-related issues. Moreover, the contributors to this volume provide, beyond a systematic overview of intelligent interfaces and systems, deep, practical knowledge in building and using intelligent systems in various applications. Special emphasis is placed on specific aspects and requirements in applications.

Knowledge discovery is an area of computer science that attempts to uncover interesting and useful patterns in data that permit a computer to perform a task autonomously or assist a human in performing a task more efficiently. Soft Computing for Knowledge Discovery provides a self-contained and systematic exposition of the key theory and algorithms that form the core of knowledge discovery from a soft computing perspective. It focuses on knowledge representation, machine learning, and the key methodologies that make up the fabric of soft computing - fuzzy set theory, fuzzy logic, evolutionary computing, and various theories of probability (e.g. naive Bayes and Bayesian networks, Dempster-Shafer theory, mass assignment theory, and others). In addition to describing many state-of-the-art soft computing approaches to knowledge discovery, the author introduces Cartesian granule features and their corresponding learning algorithms as an intuitive approach to knowledge discovery. This new approach embraces the synergistic spirit of soft computing and exploits uncertainty in order to achieve tractability, transparency and generalization. Parallels are drawn between this approach and other well known approaches (such as naive Bayes and decision trees) leading to equivalences under certain conditions. The approaches presented are further illustrated in a battery of both artificial and real-world problems. Knowledge discovery in real-world problems, such as object recognition in outdoor scenes, medical diagnosis and control, is described in detail. These case studies provide further examples of how to apply the presented concepts and algorithms to practical problems. The author provides web page access to an online bibliography, datasets, source codes for several algorithms described in the book, and other information. Soft Computing for Knowledge Discovery is for advanced undergraduates, professionals and researchers in computer science, engineering and business information systems who work or have an interest in the dynamic fields of knowledge discovery and soft computing.

Fuzzy Set Theory and Advanced Mathematical Applications contains contributions by many of the leading experts in the field, including coverage of the mathematical foundations of the theory, decision making and systems science, and recent developments in fuzzy neural control. The book supplies a readable, practical toolkit with a clear introduction to fuzzy set theory and its evolution in mathematics and new results on foundations of fuzzy set theory, decision making and systems science, and fuzzy control and neural systems. Each chapter is self-contained, providing up-to-date coverage of its subject. Audience: An important reference work for university students, and researchers and engineers working in both industrial and academic settings.

Advances in Computational Intelligence and Learning: Methods and Applications presents new developments and applications in the area of Computational Intelligence, which essentially describes methods and approaches that mimic biologically intelligent behavior in order to solve problems that have been difficult to solve by classical mathematics. Generally Fuzzy Technology, Artificial Neural Nets and Evolutionary Computing are considered to be such approaches.

The Editors have assembled new contributions in the areas of fuzzy sets, neural sets and machine learning, as well as combinations of them (so called hybrid methods) in the first part of the book. The second part of the book is dedicated to applications in the areas that are considered to be most relevant to Computational Intelligence.

This book is about Granular Computing (GC) - an emerging conceptual and of information processing. As the name suggests, GC concerns computing paradigm processing of complex information entities - information granules. In essence, information granules arise in the process of abstraction of data and derivation of knowledge from information. Information granules are everywhere. We commonly use granules of time (seconds, months, years). We granulate images; millions of pixels manipulated individually by computers appear to us as granules representing physical objects. In natural language, we operate on the basis of word-granules that become crucial entities used to realize interaction and communication between humans. Intuitively, we sense that information granules are at the heart of all our perceptual activities. In the past, several formal frameworks and tools, geared for processing specific information granules, have been proposed. Interval analysis, rough sets, fuzzy sets have all played important role in knowledge representation and processing. Subsequently, information granulation and information granules arose in numerous application domains. Well-known ideas of rule-based systems dwell inherently on information granules. Qualitative modeling, being one of the leading threads of AI, operates on a level of information granules. Multi-tier architectures and hierarchical systems (such as those encountered in control engineering), planning and scheduling systems all exploit information granularity. We also utilize information granules when it comes to functionality granulation, reusability of information and efficient ways of developing underlying information infrastructures.

Since the introduction of genetic algorithms in the 1970s, an enormous number of articles together with several significant monographs and books have been published on this methodology. As a result, genetic algorithms have made a major contribution to optimization, adaptation, and learning in a wide variety of unexpected fields. Over the years, many excellent books in genetic algorithm optimization have been published; however, they focus mainly on single-objective discrete or other hard optimization problems under certainty. There appears to be no book that is designed to present genetic algorithms for solving not only single-objective but also fuzzy and multiobjective optimization problems in a unified way. Genetic Algorithms And Fuzzy Multiobjective Optimization introduces the latest advances in the field of genetic algorithm optimization for 0-1 programming, integer programming, nonconvex programming, and job-shop scheduling problems under multiobjectiveness and fuzziness. In addition, the book treats a wide range of actual real world applications. The theoretical material and applications place special stress on interactive decision-making aspects of fuzzy multiobjective optimization for human-centered systems in most realistic situations when dealing with fuzziness. The intended readers of this book are senior undergraduate students, graduate students, researchers, and practitioners in the fields of operations research, computer science, industrial engineering, management science, systems engineering, and other engineering disciplines that deal with the subjects of multiobjective programming for discrete or other hard optimization problems under fuzziness. Real world research applications are used throughout the book to illustrate the presentation. These applications are drawn from complex problems. Examples include flexible scheduling in a machine center, operation planning of district heating and cooling plants, and coal purchase planning in an actual electric power plant.

The theory of finite automata on finite stings, infinite strings, and trees has had a dis tinguished history. First, automata were introduced to represent idealized switching circuits augmented by unit delays. This was the period of Shannon, McCullouch and Pitts, and Howard Aiken, ending about 1950. Then in the 1950s there was the work of Kleene on representable events, of Myhill and Nerode on finite coset congruence relations on strings, of Rabin and Scott on power set automata. In the 1960s, there was the work of Btichi on automata on infinite strings and the second order theory of one successor, then Rabin's 1968 result on automata on infinite trees and the second order theory of two successors. The latter was a mystery until the introduction of forgetful determinacy games by Gurevich and Harrington in 1982. Each of these developments has successful and prospective applications in computer science. They should all be part of every computer scientist's toolbox. Suppose that we take a computer scientist's point of view. One can think of finite automata as the mathematical representation of programs that run us ing fixed finite resources. Then Btichi's SIS can be thought of as a theory of programs which run forever (like operating systems or banking systems) and are deterministic. Finally, Rabin's S2S is a theory of programs which run forever and are nondeterministic. Indeed many questions of verification can be decided in the decidable theories of these automata.

The significance of foundational debate in mathematics that took place in the 1920s seems to have been recognized only in circles of mathematicians and philosophers. A period in the history of mathematics when mathematics and philosophy, usually so far away from each other, seemed to meet. The foundational debate is presented with all its brilliant contributions and its shortcomings, its new ideas and its misunderstandings.

Uncertainty has been of concern to engineers, managers and . scientists for many centuries. In management sciences there have existed definitions of uncertainty in a rather narrow sense since the beginning of this century. In engineering and uncertainty has for a long time been considered as in sciences, however, synonymous with random, stochastic, statistic, or probabilistic. Only since the early sixties views on uncertainty have ~ecome more heterogeneous and more tools to model uncertainty than statistics have been proposed by several scientists. The problem of modeling uncertainty adequately has become more important the more complex systems have become, the faster the scientific and engineering world develops, and the more important, but also more difficult, forecasting of future states of systems have become. The first question one should probably ask is whether uncertainty is a phenomenon, a feature of real world systems, a state of mind or a label for a situation in which a human being wants to make statements about phenomena, i. e. , reality, models, and theories, respectively. One cart also ask whether uncertainty is an objective fact or just a subjective impression which is closely related to individual persons. Whether uncertainty is an objective feature of physical real systems seems to be a philosophical question. This shall not be answered in this volume.

This book contains the lectures given at the NATO ASI 910820 "Cellular Automata and Cooperative Systems" Meeting which was held at the Centre de Physique des Houches, France, from June 22 to July 2, 1992. This workshop brought together mathematical physicists, theoretical physicists and mathe maticians working in fields related to local interacting systems, cellular and probabilistic automata, statistical physics, and complexity theory, as well as applications of these fields. We would like to thank our sponsors and supporters whose interest and help was essential for the success of the meeting: the NATO Scientific Affairs Division, the DRET (Direction des Recherches, Etudes et Techniques), the Ministere des Affaires Etrangeres, the National Science Foundation. We would also like to thank all the secretaries who helped us during the preparation of the meeting, in particular Maryse Cohen-Solal (CPT, Marseille) and Janice Nowinski (Courant Institute, New York). We are grateful for the fine work of Mrs. Gladys Cavallone in preparing this volume."

Fuzzy Sets in Decision Analysis, Operations Research and Statistics includes chapters on fuzzy preference modeling, multiple criteria analysis, ranking and sorting methods, group decision-making and fuzzy game theory. It also presents optimization techniques such as fuzzy linear and non-linear programming, applications to graph problems and fuzzy combinatorial methods such as fuzzy dynamic programming. In addition, the book also accounts for advances in fuzzy data analysis, fuzzy statistics, and applications to reliability analysis. These topics are covered within four parts: * Decision Making, * Mathematical Programming, * Statistics and Data Analysis, and * Reliability, Maintenance and Replacement. The scope and content of the book has resulted from multiple interactions between the editor of the volume, the series editors, the series advisory board, and experts in each chapter area. Each chapter was written by a well-known researcher on the topic and reviewed by other experts in the area. These expert reviewers sometimes became co-authors because of the extent of their contribution to the chapter.As a result, twenty-five authors from twelve countries and four continents were involved in the creation of the 13 chapters, which enhances the international character of the project and gives an idea of how carefully the Handbook has been developed.

This book digs deeper and shows not only that quantum gravity is more than just a physical theory-describing physical aspects-but also that, in fact, it covers "it all."

One of the characteristics of modern algebra is the development of new tools and concepts for exploring classes of algebraic systems, whereas the research on individual algebraic systems (e. g. , groups, rings, Lie algebras, etc. ) continues along traditional lines. The early work on classes of alge bras was concerned with showing that one class X of algebraic systems is actually contained in another class F. Modern research into the theory of classes was initiated in the 1930's by Birkhoff's work [1] on general varieties of algebras, and Neumann's work [1] on varieties of groups. A. I. Mal'cev made fundamental contributions to this modern development. ln his re ports [1, 3] of 1963 and 1966 to The Fourth All-Union Mathematics Con ference and to another international mathematics congress, striking the ories of classes of algebraic systems were presented. These were later included in his book [5]. International interest in the theory of formations of finite groups was aroused, and rapidly heated up, during this time, thanks to the work of Gaschiitz [8] in 1963, and the work of Carter and Hawkes [1] in 1967. The major topics considered were saturated formations, Fitting classes, and Schunck classes. A class of groups is called a formation if it is closed with respect to homomorphic images and subdirect products. A formation is called saturated provided that G E F whenever Gjip(G) E F.