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

This book explains the first published consistency proof of PA. It contains the original Gentzen's proof, but it uses modern terminology and examples to illustrate the essential notions. The author comments on Gentzen's steps which are supplemented with exact calculations and parts of formal derivations. A notable aspect of the proof is the representation of ordinal numbers that was developed by Gentzen. This representation is analysed and connection to set-theoretical representation is found, namely an algorithm for translating Gentzen's notation into Cantor normal form. The topic should interest researchers and students who work on proof theory, history of proof theory or Hilbert's program and who do not mind reading mathematical texts. "

This book has grown out of eight years of close collaboration among its authors. From the very beginning we decided that its content should come out as the result of a truly common effort. That is, we did not "distribute" parts of the text planned to each one of us. On the contrary, we made a point that each single paragraph be the product of a common reflection. Genuine team-work is not as usual in philosophy as it is in other academic disciplines. We think, however, that this is more due to the idiosyncrasy of philosophers than to the nature of their subject. Close collaboration with positive results is as rewarding as anything can be, but it may also prove to be quite difficult to implement. In our case, part of the difficulties came from purely geographic separation. This caused unsuspected delays in coordinating the work. But more than this, as time passed, the accumulation of particular results and ideas outran our ability to fit them into an organic unity. Different styles of exposition, different ways of formalization, different levels of complexity were simultaneously present in a voluminous manuscript that had become completely unmanageable. In particular, a portion of the text had been conceived in the language of category theory and employed ideas of a rather abstract nature, while another part was expounded in the more conventional set-theoretic style, stressing intui tivity and concreteness.

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

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.

Many mechanics and physics problems have variational formulations making them appropriate for numerical treatment by finite element techniques and efficient iterative methods. This book describes the mathematical background and reviews the techniques for solving problems, including those that require large computations such as transonic flows for compressible fluids and the Navier-Stokes equations for incompressible viscous fluids. Finite element approximations and non-linear relaxation, augmented Lagrangians, and nonlinear least square methods are all covered in detail, as are many applications.

"Numerical Methods for Nonlinear Variational Problems," originally published in the Springer Series in Computational Physics, is a classic in applied mathematics and computational physics and engineering. This long-awaited softcover re-edition is still a valuable resource for practitioners in industry and physics and for advanced students.

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.

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

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.

Compactness in topology and finite generation in algebra are nice properties to start with. However, the study of compact spaces leads naturally to non-compact spaces and infinitely generated chain complexes; a classical example is the theory of covering spaces. In handling non-compact spaces we must take into account the infinity behaviour of such spaces. This necessitates modifying the usual topological and algebraic cate gories to obtain "proper" categories in which objects are equipped with a "topologized infinity" and in which morphisms are compatible with the topology at infinity. The origins of proper (topological) category theory go back to 1923, when Kere kjart6 [VT] established the classification of non-compact surfaces by adding to orien tability and genus a new invariant, consisting of a set of "ideal points" at infinity. Later, Freudenthal [ETR] gave a rigorous treatment of the topology of "ideal points" by introducing the space of "ends" of a non-compact space. In spite of its early ap pearance, proper category theory was not recognized as a distinct area of topology until the late 1960's with the work of Siebenmann [OFB], [IS], [DES] on non-compact manifolds.

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.

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.

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

This book is concerned with the optimization problem of maximizing the number of spanning trees of a multigraph. Since a spanning tree is a minimally connected subgraph, graphs and multigraphs having more of these are, in some sense, immune to disconnection by edge failure. We employ a matrix-theoretic approach to the calculation of the number of spanning trees.The authors envision this as a research aid that is of particular interest to graduate students or advanced undergraduate students and researchers in the area of network reliability theory. This would encompass graph theorists of all stripes, including mathematicians, computer scientists, electrical and computer engineers, and operations researchers.

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.

This book constitutes the refereed proceedings of the 9th Conference on Computability in Europe, CiE 2013, held in Milan, Italy, in July 2013.
The 48 revised papers presented together with 1 invited lecture and 2
tutorials were carefully reviewed and selected with an acceptance rate of under 31,7%. Both the conference series and the association promote the development of computability-related science, ranging over mathematics, computer science and applications in various natural and engineering sciences such as physics and biology, and also including the promotion of related non-scientific fields such as philosophy and history of computing."

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

0. A Theorem of Polynomial Algebra.- 1. The General Theory.- 2. Applications to Algebraic Number Theory.- 3. Applications to the Theory of Algebraic Curves.- References.