Fuzzy geometric programming was originated by the author in the Proceed ing of the second IFSA conferences, 1987(Tokyo) 14 years ago. Later, the paper was invited for formal publication in the International Journal of Fuzzy Sets and Systems. From then on, more and more papers have been written by scholars all over the world who have been interested in its research. So this programming method has been acknowledged by experts and has gradually formed a new branch of fuzzy mathematics. lnspired by Zadeh's fuzzy sets theory, fuzzy geometric programming emerges from the combination of fuzzy sets theory with geometric programming, where models are built in the fuzzy posynomial and the reverse geometric program ming. The present book is intended to discuss fuzziness of objective function and constraint conditions, a variety of fuzzy numbers in coefficients and vari ables and problems about multi-objective fuzzy geometric programming. It establishes and rounds out an entire theory system, showing that there exist conditions of fuzzy optimal or most satisfactory solutions in fuzzy geometric ptogramming, and it develops some effective algorithms. In order to introduce this new branch, the book aims at the exposition of three points: encompassing ideas and conception, theory and methods, and diffusion and application. lt lays more emphasis on the second point than the first one, and less on the third. Besides, it introduces some knowledge of classical geometric programming and of fuzzy sets theory and application examples of fuzzy geometric programming in electric power systems as weil."

The book presents a thoroughly elaborated logical theory of generalized truth-values understood as subsets of some established set of (basic) truth values. After elucidating the importance of the very notion of a truth value in logic and philosophy, we examine some possible ways of generalizing this notion. The useful four-valued logic of first-degree entailment by Nuel Belnap and the notion of a bilattice (a lattice of truth values with two ordering relations) constitute the basis for further generalizations. By doing so we elaborate the idea of a multilattice, and most notably, a trilattice of truth values - a specific algebraic structure with information ordering and two distinct logical orderings, one for truth and another for falsity. Each logical order not only induces its own logical vocabulary, but determines also its own entailment relation. We consider both semantic and syntactic ways of formalizing these relations and construct various logical calculi.

The theory presented in this book is developed constructively, is based on a few axioms encapsulating the notion of objects (points and sets) being apart, and encompasses both point-set topology and the theory of uniform spaces. While the classical-logic-based theory of proximity spaces provides some guidance for the theory of apartness, the notion of nearness/proximity does not embody enough algorithmic information for a deep constructive development. The use of constructive (intuitionistic) logic in this book requires much more technical ingenuity than one finds in classical proximity theory -- algorithmic information does not come cheaply -- but it often reveals distinctions that are rendered invisible by classical logic. In the first chapter the authors outline informal constructive logic and set theory, and, briefly, the basic notions and notations for metric and topological spaces. In the second they introduce axioms for a point-set apartness and then explore some of the consequences of those axioms. In particular, they examine a natural topology associated with an apartness space, and relations between various types of continuity of mappings. In the third chapter the authors extend the notion of point-set (pre-)apartness axiomatically to one of (pre-)apartness between subsets of an inhabited set. They then provide axioms for a quasiuniform space, perhaps the most important type of set-set apartness space. Quasiuniform spaces play a major role in the remainder of the chapter, which covers such topics as the connection between uniform and strong continuity (arguably the most technically difficult part of the book), apartness and convergence in function spaces, types of completeness, and neat compactness. Each chapter has a Notes section, in which are found comments on the definitions, results, and proofs, as well as occasional pointers to future work. The book ends with a Postlude that refers to other constructive approaches to topology, with emphasis on the relation between apartness spaces and formal topology. Largely an exposition of the authors' own research, this is the first book dealing with the apartness approach to constructive topology, and is a valuable addition to the literature on constructive mathematics and on topology in computer science. It is aimed at graduate students and advanced researchers in theoretical computer science, mathematics, and logic who are interested in constructive/algorithmic aspects of topology.

The primary purpose of this book is to present information about selected topics on the interactions and applications of fuzzy + neural. Most of the discussion centers around our own research in these areas. Fuzzy + neural can mean many things: (1) approximations between fuzzy systems and neu ral nets (Chapter 4); (2) building hybrid neural nets to equal fuzzy systems (Chapter 5); (3) using neura.l nets to solve fuzzy problems (Chapter 6); (4) approximations between fuzzy neural nets and other fuzzy systems (Chap ter 8); (5) constructing hybrid fuzzy neural nets for certain fuzzy systems (Chapters 9, 10); or (6) computing with words (Chapter 11). This book is not intend to be used primarily as a text book for a course in fuzzy + neural because we have not included problems at the end of each chapter, we have omitted most proofs (given in the references), and we have given very few references. We wanted to keep the mathematical prerequisites to a minimum so all longer, involved, proofs were omitted. Elementary dif ferential calculus is the only prerequisite needed since we do mention partial derivatives once or twice."

The impact and influence of Jean-Pierre Serre's work have been notable ever since his doctoral thesis on homotopy groups. The abundance of significant results and deep insight contained in his research and survey papers ranging through topology, several complex variables, and algebraic geometry to number theory, group theory, commutative algebra and modular forms, continues to provide inspiring reading for mathematicians working in these areas, in their research and their teaching. Characteristic of Serre's publications are the many open questions he formulated suggesting further research directions. Four volumes specify how he has provided comments on and corrections to most articles, and described the present status of the open questions with reference to later results. Jean-Pierre Serre is one of a few mathematicians to have won the Fields medal, the Abel prize, and the Wolf prize.

Gert H. Muller The growth of the number of publications in almost all scientific areas, as in the area of (mathematical) logic, is taken as a sign of our scientifically minded culture, but it also has a terrifying aspect. In addition, given the rapidly growing sophistica tion, specialization and hence subdivision of logic, researchers, students and teachers may have a hard time getting an overview of the existing literature, partic ularly if they do not have an extensive library available in their neighbourhood: they simply do not even know what to ask for! More specifically, if someone vaguely knows that something vaguely connected with his interests exists some where in the literature, he may not be able to find it even by searching through the publications scattered in the review journals. Answering this challenge was and is the central motivation for compiling this Bibliography. The Bibliography comprises (presently) the following six volumes (listed with the corresponding Editors): I. Classical Logic W. Rautenberg II. Non-classical Logics W. Rautenberg III. Model Theory H. -D. Ebbinghaus IV. Recursion Theory P. G. Hinman V. Set Theory A. R. Blass VI. Proof Theory; Constructive Mathematics J. E. Kister; D. van Dalen & A. S. Troelstra.

This monograph provides the first up-to-date and self-contained presentation of a recently discovered mathematical structure the Schrodinger-Virasoro algebra. Just as Poincare invariance or conformal (Virasoro) invariance play a key role in understanding, respectively, elementary particles and two-dimensional equilibrium statistical physics, this algebra of non-relativistic conformal symmetries may be expected to apply itself naturally to the study of some models of non-equilibrium statistical physics, or more specifically in the context of recent developments related to the non-relativistic AdS/CFT correspondence.

The study of the structure of this infinite-dimensional Lie algebra touches upon topics as various as statistical physics, vertex algebras, Poisson geometry, integrable systems and supergeometry as well as representation theory, the cohomology of infinite-dimensional Lie algebras, and the spectral theory of Schrodinger operators."

Some recent fuzzy database modeling advances for the non-traditional applications are introduced in this book. The focus is on database models for modeling complex information and uncertainty at the conceptual, logical, physical design levels and from integrity constraints defined on the fuzzy relations.
The database models addressed here are; the conceptual data models, including the ExIFO and ExIFO2 data models, the logical database models, including the extended NF2 database model, fuzzy object-oriented database model, and the fuzzy deductive object-oriented database model. Integrity constraints are defined on the fuzzy relations are also addressed. A continuing reason for the limited adoption of fuzzy database systems has been performance. There have been few efforts at defining physical structures that accomodate fuzzy information. A new access structure and data organization for fuzzy information is introduced in this book.

This completely revised and corrected version of the well-known Florence notes circulated by the authors together with E. Friedlander examines basic topology, emphasizing homotopy theory. Included is a discussion of Postnikov towers and rational homotopy theory. This is then followed by an in-depth look at differential forms and de Tham's theorem on simplicial complexes. In addition, Sullivan's results on computing the rational homotopy type from forms is presented. New to the Second Edition: *Fully-revised appendices including an expanded discussion of the Hirsch lemma *Presentation of a natural proof of a Serre spectral sequence result *Updated content throughout the book, reflecting advances in the area of homotopy theory With its modern approach and timely revisions, this second edition of Rational Homotopy Theory and Differential Forms will be a valuable resource for graduate students and researchers in algebraic topology, differential forms, and homotopy theory.

The impact and influence of Jean-Pierre Serre's work have been notable ever since his doctoral thesis on homotopy groups. The abundance of significant results and deep insight contained in his research and survey papers ranging through topology, several complex variables, and algebraic geometry to number theory, group theory, commutative algebra and modular forms, continues to provide inspiring reading for mathematicians working in these areas, in their research and their teaching. Characteristic of Serre's publications are the many open questions he formulated suggesting further research directions. Four volumes specify how he has provided comments on and corrections to most articles, and described the present status of the open questions with reference to later results. Jean-Pierre Serre is one of a few mathematicians to have won the Fields medal, the Abel prize, and the Wolf prize.

This book collects the papers presented at the 4th International Workshop on Logic, Rationality and Interaction/ (LORI-4), held in October 2013 at the /Center for the Study of Language and Cognition, Zhejiang University, Hangzhou, China. LORI is a series that brings together researchers from a variety of logic-related fields: Game and Decision Theory, Philosophy, Linguistics, Computer Science and AI. This year had a special emphasis on Norms and Argumentation. Out of 42 submissions, 23 full papers and 11 short contributions have been selected through peer-review for inclusion in the workshop program and in this volume. The quality and diversity of these contributions witnesses a lively, fast-growing, and interdisciplinary community working at the intersection of logic and rational interaction.

The origins of the harmonic analysis go back to an ingenious idea of Fourier that any reasonable function can be represented as an infinite linear combination of sines and cosines. Today's harmonic analysis incorporates the elements of geometric measure theory, number theory, probability, and has countless applications from data analysis to image recognition and from the study of sound and vibrations to the cutting edge of contemporary physics. The present volume is based on lectures presented at the summer school on Harmonic Analysis. These notes give fresh, concise, and high-level introductions to recent developments in the field, often with new arguments not found elsewhere. The volume will be of use both to graduate students seeking to enter the field and to senior researchers wishing to keep up with current developments.

The general aim of this book is to provide an elementary exposition of some basic concepts in terms of which both classical and non-dassicallogirs may be studied and appraised. Although quantificational logic is dealt with briefly in the last chapter, the discussion is chiefly concemed with propo- gjtional cakuli. Still, the subject, as it stands today, cannot br covered in one book of reasonable length. Rather than to try to include in the volume as much as possible, I have put emphasis on some selected topics. Even these could not be roverrd completely, but for each topic I have attempted to present a detailed and precise t'Xposition of several basic results including some which are non-trivial. The roots of some of the central ideas in the volume go back to J.Luka- siewicz's seminar on mathematicallogi

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.

This book intends to show that radical naturalism (or physicalism), nominalism and strict finitism account for the applications of classical mathematics in current scientific theories. The applied mathematical theories developed in the book include the basics of calculus, metric space theory, complex analysis, Lebesgue integration, Hilbert spaces, and semi-Riemann geometry (sufficient for the applications in classical quantum mechanics and general relativity). The fact that so much applied mathematics can be developed within such a weak, strictly finitistic system, is surprising in itself. It also shows that the applications of those classical theories to the finite physical world can be translated into the applications of strict finitism, which demonstrates the applicability of those classical theories without assuming the literal truth of those theories or the reality of infinity. Both professional researchers and students of philosophy of mathematics will benefit greatly from reading this book.

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.

"Intuition" has perhaps been the least understood and the most abused term in philosophy. It is often the term used when one has no plausible explanation for the source of a given belief or opinion. According to some sceptics, it is understood only in terms of what it is not, and it is not any of the better understood means for acquiring knowledge. In mathematics the term has also unfortunately been used in this way. Thus, intuition is sometimes portrayed as if it were the Third Eye, something only mathematical "mystics," like Ramanujan, possess. In mathematics the notion has also been used in a host of other senses: by "intuitive" one might mean informal, or non-rigourous, or visual, or holistic, or incomplete, or perhaps even convincing in spite of lack of proof. My aim in this book is to sweep all of this aside, to argue that there is a perfectly coherent, philosophically respectable notion of mathematical intuition according to which intuition is a condition necessary for mathemati cal knowledge. I shall argue that mathematical intuition is not any special or mysterious kind of faculty, and that it is possible to make progress in the philosophical analysis of this notion. This kind of undertaking has a precedent in the philosophy of Kant. While I shall be mostly developing ideas about intuition due to Edmund Husser there will be a kind of Kantian argument underlying the entire book."

There are many kinds of books on formal logic. Some have philosophers as their intended audience, some mathematicians, some computer scien tists. Although there is a common core to all such books, they will be very different in emphasis, methods, and even appearance. This book is intended for computer scientists. But even this is not precise. Within computer science formal logic turns up in a number of areas, from pro gram verification to logic programming to artificial intelligence. This book is intended for computer scientists interested in automated theo rem proving in classical logic. To be more precise yet, it is essentially a theoretical treatment, not a how-to book, although how-to issues are not neglected. This does not mean, of course, that the book will be of no interest to philosophers or mathematicians. It does contain a thorough presentation of formal logic and many proof techniques, and as such it contains all the material one would expect to find in a course in formal logic covering completeness but, not incompleteness issues. The first item to be addressed is, What are we talking about and why are we interested in it? We are primarily talking about truth as used in mathematical discourse, and our interest in it is, or should be, self evident. Truth is a semantic concept, so we begin with models and their properties. These are used to define our subject.

This book provides a comprehensive, up-to-date account on recent applications of fuzzy sets and possibility theory in reliability and safety analysis. Various aspects of system's reliability, quality control, reliability and safety of man-machine systems fault analysis, risk assessment and analysis, structural, seismic, safety, etc. are discussed. The book provides new tools for handling non-probabilistic aspects of uncertainty in these problems. It is the first in this field in the world literature.

The volume "Fuzziness in Database Management Systems" is a highly informative, well-organized and up-to-date collection of contributions authored by many of the leading experts in its field. Among the contributors are the editors, Professors Patrick Bose and Janusz Kacprzyk, both of whom are known internationally. The book is like a movie with an all-star cast. The issue of fuzziness in database management systems has a long history. It begins in 1968 and 1971, when I spent my sabbatical leaves at the IBM Research Laboratory in San Jose, California, as a visiting scholar. During these periods I was associated with Dr. E.F. Codd, the father of relational models of database systems, and came in contact with the developers ofiBMs System Rand SQL. These associations and contacts at a time when the methodology of relational models of data was in its formative stages, made me aware of the basic importance of such models and the desirability of extending them to fuzzy database systems and fuzzy query languages. This perception was reflected in my 1973 ffiM report which led to the paper on the concept of a linguistic variable and later to the paper on the meaning representation language PRUF (Possibilistic Relational Universal Fuzzy). More directly related to database issues during that period were the theses of my students V. Tahani, J. Yang, A. Bolour, M. Shen and R. Sheng, and many subsequent reports by both graduate and undergraduate students at Berkeley.

Optimization is of central concern to a number of discip lines. Operations Research and Decision Theory are often consi dered to be identical with optimizationo But also in other areas such as engineering design, regional policy, logistics and many others, the search for optimal solutions is one of the prime goals. The methods and models which have been used over the last decades in these areas have primarily been "hard" or "crisp," i. e. the solutions were considered to be either fea sible or unfeasible, either above a certain aspiration level or below. This dichotomous structure of methods very often forced the modeller to approximate real problem situations of the more-or-less type by yes-or-no-type models, the solutions of which might turn out not to be the solutions to the real prob lems. This is particularly true if the problem under considera tion includes vaguely defined relationships, human evaluations, uncertainty due to inconsistent or incomplete evidence, if na tural language has to be modelled or if state variables can only be described approximately. Until recently, everything which was not known with cer tainty, i. e. which was not known to be either true or false or which was not known to either happen with certainty or to be impossible to occur, was modelled by means of probabilitieso This holds in particular for uncertainties concerning the oc currence of events."

This book constitutes the refereed proceedings of the 11th International Conference on Typed Lambda Calculi and Applications, TLCA 2013, held in Eindhoven, The Netherlands, in June 2013 as part of RDP 2013, the 7th Federated Conference on Rewriting, Deduction, and Programming, together with the 24th International Conference on Rewriting Techniques and Applications, RTA 2013, and several related events.
The 15 revised full papers presented were carefully reviewed and selected from 41 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.

This volume offers a glimpse of the status of research in adaptive and learning systems in 1985. In recent years these areas have spawned a multiplicity of ideas so rapidly that the average research worker or practicing engineer is overwhelmed by the flood of information. The Yale Workshop on Applications of Adaptive Systems Theory was organized in 1979 to provide a brief respite from this deluge, wherein critical issues may be examined in a calm and collegial environment. The fourth of the series having been held in May 1985, it has now become well established as a biennial forum for the lively exchange of ideas in the ever changing domain of adaptive systems. The scope of this book is broad and ranges from theoretical investigations to practical applications. It includes twenty eight papers by leaders in the field, selected from the Pro ceedings of the Fourth Yale Workshop and divided into five sections. I have provided a brief introduction to each section so that it can be read as a self-contained unit. The first section, devoted to adaptive control theory, suggests the intensity of activity in the field and reveals signs of convergence towards some common themes by workers with rather different moti vation. Preliminary results concerning the reduced order model problem are dramatically changing the way we view the field and bringing it closer to other areas such as robust linear control where major advances have been recently reported.

In many areas of mathematics some "higher operations" are arising. These havebecome so important that several research projects refer to such expressions. Higher operationsform new types of algebras. The key to understanding and comparing them, to creating invariants of their action is operad theory. This is a point of view that is 40 years old in algebraic topology, but the new trend is its appearance in several other areas, such as algebraic geometry, mathematical physics, differential geometry, and combinatorics. The present volume is the first comprehensive and systematic approach to algebraic operads. An operad is an algebraic device that serves to study all kinds of algebras (associative, commutative, Lie, Poisson, A-infinity, etc.) from a conceptual point of view. The book presents this topic with an emphasis on Koszul duality theory. After a modern treatment of Koszul duality for associative algebras, the theory is extended to operads. Applications to homotopy algebra are given, for instance the Homotopy Transfer Theorem. Although the necessary notions of algebra are recalled, readers are expected to be familiar with elementary homological algebra. Each chapter ends with a helpful summary and exercises. A full chapter is devoted to examples, and numerous figures are included. After a low-level chapter on Algebra, accessible to (advanced) undergraduate students, the level increases gradually through the book. However, the authors have done their best to make it suitable for graduate students: three appendices review the basic results needed in order to understand the various chapters. Since higher algebra is becoming essential in several research areas like deformation theory, algebraic geometry, representation theory, differential geometry, algebraic combinatorics, and mathematical physics, the book can also be used as a reference work by researchers.