The study of information-based actions and processes has been a vibrant - terface between logic and computer science for several decades now. Indeed, several natural perspectives come together here. On the one hand, logical s- tems may be used to describe the dynamics of arbitrary computational p- cesses as in the many sophisticated process logics available today. But also, key logical notions such as model checking or proof search are themselves informational processes involving agents with goals. The interplay between these descriptive and dynamic aspects shows even in our ordinary language. A word like proof hdenotes both a static certificate of truth, and an activity which humans or machines engage in. Increasing our understanding of l- ics of this sort tells us something about computer science, and about cognitive actions in general. The individual chapters of this book show the state of the art in current - vestigations of process calculi such as linear logic, and with mainly two major paradigms at work, namely, linear logic and modal logic. These techniques are applied to the title themes of concurrency and synchronisation, but there are also many repercussions for topics such as the geometry of proofs, categorial semantics, and logics of graphs. Viewed - gether, the chapters also offer exciting glimpses of future integration, as the reader moves back and forth through the book."

Flexible Neuro-Fuzzy Systems is the first professional literature about the new class of powerful, flexible fuzzy systems. The author incorporates various flexibility parameters to the construction of neuro-fuzzy systems. This approach dramatically improves their performance, allowing the systems to perfectly represent the pattern encoded in data. Flexible Neuro-Fuzzy Systems is the only book that proposes a flexible approach to fuzzy modeling and fills the gap in existing literature. This book introduces new fuzzy systems which outperform previous approaches to system modeling and classification, and has the following features: -Provides a framework for unification, construction and development of neuro-fuzzy systems; -Presents complete algorithms in a systematic and structured fashion, facilitating understanding and implementation, -Covers not only advanced topics but also fundamentals of fuzzy sets, -Includes problems and exercises following each chapter, -Illustrates the results on a wide variety of simulations, -Provides tools for possible applications in business and economics, medicine and bioengineering, automatic control, robotics and civil engineering.

The book "Foundational Theories of Classical and Constructive Mathematics" is a book on the classical topic of foundations of mathematics. Its originality resides mainly in its treating at the same time foundations of classical and foundations of constructive mathematics. This confrontation of two kinds of foundations contributes to answering questions such as: Are foundations/foundational theories of classical mathematics of a different nature compared to those of constructive mathematics? Do they play the same role for the resp. mathematics? Are there connections between the two kinds of foundational theories? etc. The confrontation and comparison is often implicit and sometimes explicit. Its great advantage is to extend the traditional discussion of the foundations of mathematics and to render it at the same time more subtle and more differentiated. Another important aspect of the book is that some of its contributions are of a more philosophical, others of a more technical nature. This double face is emphasized, since foundations of mathematics is an eminent topic in the philosophy of mathematics: hence both sides of this discipline ought to be and are being paid due to.

This book constitutes the refereed proceedings of the 12th International Conference on Unconventional Computation and Natural Computation, UCNC 2013, held in Milan, Italy, in July 2013. The 30 papers (28 full papers, 8 poster papers, and 2 invited papers) were carefully reviewed and selected from 46 submissions. The topics of the volume include: quantum, cellular, molecular, neural, DNA, membrane, and evolutionary computing; cellular automata; computation based on chaos and dynamical systems; massive parallel computation; collective intelligence; computation based on physical principles such as relativistic, optical, spatial, collision-based computing; amorphous computing; physarum computing; hypercomputation; fuzzy and rough computing; swarm intelligence; artificial immune systems; physics of computation; chemical computation; evolving hardware; the computational nature of self-assembly, developmental processes, bacterial communication, and brain processes.

This book constitutes the proceedings of the 17th International Conference on Developments in Language Theory, DLT 2013, held in Marne-la-Vallee, France, in June 2013. The 34 full papers presented in this volume were carefully reviewed and selected from 63 submissions. The scope of the conference includes, among others, the following topics and areas: combinatorial and algebraic properties of words and languages; grammars, acceptors and transducers for strings, trees, graphs, arrays; algebraic theories for automata and languages; codes; efficient text algorithms; symbolic dynamics; decision problems; relationships to complexity theory and logic; picture description and analysis; polyominoes and bidimensional patterns; cryptography; concurrency; cellular automata; bio-inspired computing; and quantum computing.

Set theory is the mathematics of infinity and part of the core curriculum for mathematics majors. This book blends theory and connections with other parts of mathematics so that readers can understand the place of set theory within the wider context. Beginning with the theoretical fundamentals, the author proceeds to illustrate applications to topology, analysis and combinatorics, as well as to pure set theory. Concepts such as Boolean algebras, trees, games, dense linear orderings, ideals, filters and club and stationary sets are also developed. Pitched specifically at undergraduate students, the approach is neither esoteric nor encyclopedic. The author, an experienced instructor, includes motivating examples and over 100 exercises designed for homework assignments, reviews and exams. It is appropriate for undergraduates as a course textbook or for self-study. Graduate students and researchers will also find it useful as a refresher or to solidify their understanding of basic set theory.

Set theory is the mathematics of infinity and part of the core curriculum for mathematics majors. This book blends theory and connections with other parts of mathematics so that readers can understand the place of set theory within the wider context. Beginning with the theoretical fundamentals, the author proceeds to illustrate applications to topology, analysis and combinatorics, as well as to pure set theory. Concepts such as Boolean algebras, trees, games, dense linear orderings, ideals, filters and club and stationary sets are also developed. Pitched specifically at undergraduate students, the approach is neither esoteric nor encyclopedic. The author, an experienced instructor, includes motivating examples and over 100 exercises designed for homework assignments, reviews and exams. It is appropriate for undergraduates as a course textbook or for self-study. Graduate students and researchers will also find it useful as a refresher or to solidify their understanding of basic set theory.

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."

This book addresses a gap in the model-theoretic understanding of valued fields that had limited the interactions of model theory with geometry. It contains significant developments in both pure and applied model theory. Part I of the book is a study of stably dominated types. These form a subset of the type space of a theory that behaves in many ways like the space of types in a stable theory. This part begins with an introduction to the key ideas of stability theory for stably dominated types. Part II continues with an outline of some classical results in the model theory of valued fields and explores the application of stable domination to algebraically closed valued fields. The research presented here is made accessible to the general model theorist by the inclusion of the introductory sections of each part.

In the 1990s Kim and Pillay generalized stability, a major model theoretic idea developed by Shelah twenty-five years earlier, to the study of simple theories. This book is an up-to-date introduction to simple theories and hyperimaginaries, with special attention to Lascar strong types and elimination of hyperimaginary problems. Assuming only knowledge of general model theory, the foundations of forking, stability, and simplicity are presented in full detail. The treatment of the topics is as general as possible, working with stable formulas and types and assuming stability or simplicity of the theory only when necessary. The author offers an introduction to independence relations as well as a full account of canonical bases of types in stable and simple theories. In the last chapters the notions of internality and analyzability are discussed and used to provide a self-contained proof of elimination of hyperimaginaries in supersimple theories.

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.

Mountaineers use pitons to protect themselves from falls. The lead climber wears a harness to which a rope is tied. As the climber ascends, the rope is paid out by a partner on the ground. As described thus far, the climber receives no protection from the rope or the partner. However, the climber generally carries several spike-like pitons and stops when possible to drive one into a small crack or crevice in the rock face. After climbing just above the piton, the climber clips the rope to the piton, using slings and carabiners. A subsequent fall would result in the climber hanging from the piton if the piton stays in the rock, the slings and carabiners do not fail, the rope does not break, the partner is holding the rope taut and secure, and the climber had not climbed too high above the piton before falling. The climber's safety clearly depends on all of the components of the system. But the piton is distinguished because it connects the natural to the artificial. In 1987 I designed an assembly-level language for Warren Hunt's FM8501 verified microprocessor. I wanted the language to be conveniently used as the object code produced by verified compilers. Thus, I envisioned the language as the first software link in a trusted chain from verified hardware to verified applications programs. Thinking of the hardware as the "rock" I named the language "Piton."

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.

Change, Choice and Inference unifies lively and significant strands of research in logic, philosophy, economics and artificial intelligence.

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.

This comprehensive two-volume work is devoted to the most general beginnings of mathematics. It goes back to Hausdorff's classic Set Theory (2nd ed., 1927), where set theory and the theory of functions were expounded as the fundamental parts of mathematics in such a way that there was no need for references to other sources. Along the lines of Hausdorff's initial work (1st ed., 1914), measure and integration theory is also included here as the third fundamental part of contemporary mathematics. The material about sets and numbers is placed in Volume 1 and the material about functions and measures is placed in Volume 2. Contents Historical foreword on the centenary after Felix Hausdorff's classic Set Theory Fundamentals of the theory of functions Fundamentals of the measure theory Historical notes on the Riesz - Radon - Frechet problem of characterization of Radon integrals as linear functionals

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.

Paolo Mancosu presents a series of innovative studies in the history and the philosophy of logic and mathematics in the first half of the twentieth century. The Adventure of Reason is divided into five main sections: history of logic (from Russell to Tarski); foundational issues (Hilbert's program, constructivity, Wittgenstein, Goedel); mathematics and phenomenology (Weyl, Becker, Mahnke); nominalism (Quine, Tarski); semantics (Tarski, Carnap, Neurath). Mancosu exploits extensive untapped archival sources to make available a wealth of new material that deepens in significant ways our understanding of these fascinating areas of modern intellectual history. At the same time, the book is a contribution to recent philosophical debates, in particular on the prospects for a successful nominalist reconstruction of mathematics, the nature of finitist intuition, the viability of alternative definitions of logical consequence, and the extent to which phenomenology can hope to account for the exact sciences.

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.