Some mathematical disciplines can be presented and developed in the context of other disciplines, for instance Boolean algebras, that Stone has converted in a branch of ring theory, projective geome- tries, characterized by Birkhoff as lattices of a special type, projec- tive, descriptive and spherical geometries, represented by Prenowitz, as multigroups, linear geometries and convex sets presented by Jan- tosciak and Prenowitz as join spaces. As Prenowitz and Jantosciak did for geometries, in this book we present and study several ma- thematical disciplines that use the Hyperstructure Theory. Since the beginning, the Hyperstructure Theory and particu- larly the Hypergroup Theory, had applications to several domains. Marty, who introduced hypergroups in 1934, applied them to groups, algebraic functions and rational fractions. New applications to groups were also found among others by Eaton, Ore, Krasner, Utumi, Drbohlav, Harrison, Roth, Mockor, Sureau and Haddad. Connections with other subjects of classical pure Mathematics have been determined and studied: * Fields by Krasner, Stratigopoulos and Massouros Ch. * Lattices by Mittas, Comer, Konstantinidou, Serafimidis, Leoreanu and Calugareanu * Rings by Nakano, Kemprasit, Yuwaree * Quasigroups and Groupoids by Koskas, Corsini, Kepka, Drbohlav, Nemec * Semigroups by Kepka, Drbohlav, Nemec, Yuwaree, Kempra- sit, Punkla, Leoreanu * Ordered Structures by Prenowitz, Corsini, Chvalina IX x * Combinatorics by Comer, Tallini, Migliorato, De Salvo, Scafati, Gionfriddo, Scorzoni * Vector Spaces by Mittas * Topology by Mittas , Konstantinidou * Ternary Algebras by Bandelt and Hedlikova.

This is the first book to collect essays from philosophers, mathematicians and computer scientists working at the exciting interface of algorithmic learning theory and the epistemology of science and inductive inference. Readable, introductory essays provide engaging surveys of different, complementary, and mutually inspiring approaches to the topic, both from a philosophical and a mathematical viewpoint.

This volume collects together a number of important papers concerning both the method of abstraction generally and the use of particular abstraction principles to reconstruct central areas of mathematics along logicist lines. Gottlob Frege's original logicist project was, in effect, refuted by Russell's paradox. Crispin Wright has recently revived Frege s enterprise, however, providing a philosophical and technical framework within which a reconstruction of arithmetic is possible. While the Neo-Fregean project has received extensive attention and discussion, the present volume is unique in presenting a thoroughgoing examination of the mathematical aspects of the neo-logicist project (and the particular philosophical issues arising from these technical concerns). Attention is focused on extending the Neo-Fregean treatment to all of mathematics, with the reconstruction of real analysis from various cut- or cauchy-sequence-related abstraction principles and the reconstruction of set theory from various restricted versions of Basic Law V as case studies. As a result, the volume provides a test of the scope and limits of the neo-logicist project, detailing what has been accomplished and outlining the desiderata still outstanding. All papers in the anthology have their origins in presentations at Arche events, thus providing a volume that is both a survey of the cutting edge in research on the technical aspects of abstraction and a catalogue of the work in this area that has been supported in various ways by Arche."

This book presents contributions from world-renowned logicians, discussing important topics of logic from the point of view of their further development in light of requirements arising from successful application in Computer Science and AI language. Coverage includes: the logic of provability, computability theory applied to biology, psychology, physics, chemistry, economics, and other basic sciences; computability theory and computable models; logic and space-time geometry; hybrid systems; logic and region-based theory of space.

Function Algebras on Finite Sets gives a broad introduction to the subject, leading up to the cutting edge of research. The general concepts of the Universal Algebra are given in the first part of the book, to familiarize the reader from the very beginning on with the algebraic side of function algebras. The second part covers the following topics: Galois-connection between function algebras and relation algebras, completeness criterions, and clone theory.

Reflexive Structures: An Introduction to Computability Theory is concerned with the foundations of the theory of recursive functions. The approach taken presents the fundamental structures in a fairly general setting, but avoiding the introduction of abstract axiomatic domains. Natural numbers and numerical functions are considered exclusively, which results in a concrete theory conceptually organized around Church's thesis. The book develops the important structures in recursive function theory: closure properties, reflexivity, enumeration, and hyperenumeration. Of particular interest is the treatment of recursion, which is considered from two different points of view: via the minimal fixed point theory of continuous transformations, and via the well known stack algorithm. Reflexive Structures is intended as an introduction to the general theory of computability. It can be used as a text or reference in senior undergraduate and first year graduate level classes in computer science or mathematics.

In contributing a foreword to this book I am complying with a wish my husband expressed a few days before his death. He had completed the manuscript of this work, which may be considered a companion volume to his book Formal Methods. The task of seeing it through the press was undertaken by Mr. J. J. A. Mooij, acting director of the Institute for Research in Foundations and the Philosophy of Science (Instituut voor Grondslagenonderzoek en Filoso: fie der Exacte Wetenschappen) of the University of Amsterdam, with the help of Mrs. E. M. Barth, lecturer at the Institute. I wish to thank Mr. Mooij and Mrs. Barth most cordially for the care with which they have acquitted themselves of this delicate task and for the speed with which they have brought it to completion. I also wish to express my gratitude to Miss L. E. Minning, M. A., for the helpful advice she has so kindly given to Mr. Mooij and Mrs. Barth during the proof reading. C. P. C. BETH-PASTOOR VII PREFACE A few years ago Mr. Horace S.

Thetitleofthisbookmentionstheconceptsofparaconsistencyandconstr- tive logic. However, the presented material belongs to the ?eld of parac- sistency, not to constructive logic. At the level of metatheory, the classical methods are used. We will consider two concepts of negation: the ne- tion as reduction to absurdity and the strong negation. Both concepts were developed in the setting of constrictive logic, which explains our choice of the title of the book. The paraconsistent logics are those, which admit - consistent but non-trivial theories, i. e. , the logics which allow one to make inferences in a non-trivial fashion from an inconsistent set of hypotheses. Logics in which all inconsistent theories are trivial are called explosive. The indicated property of paraconsistent logics yields the possibility to apply them in di?erent situations, where we encounter phenomena relevant (to some extent) to the logical notion of inconsistency. Examples of these si- ations are (see [86]): information in a computer data base; various scienti?c theories; constitutions and other legal documents; descriptions of ?ctional (and other non-existent) objects; descriptions of counterfactual situations; etc. The mentioned survey by G. Priest [86] may also be recommended for a ?rst acquaintance with paraconsistent logic. The study of the paracons- tency phenomenon may be based on di?erent philosophical presuppositions (see, e. g. , [87]). At this point, we emphasize only one fundamental aspect of investigations in the ?eld of paraconsistency. It was noted by D. Nelson in [65, p.

Discussions of the foundations of mathematics and their history are frequently restricted to logical issues in a narrow sense, or else to traditional problems of analytic philosophy. From Dedekind to Goedel: Essays on the Development of the Foundations of Mathematics illustrates the much greater variety of the actual developments in the foundations during the period covered. The viewpoints that serve this purpose included the foundational ideas of working mathematicians, such as Kronecker, Dedekind, Borel and the early Hilbert, and the development of notions like model and modelling, arbitrary function, completeness, and non-Archimedean structures. The philosophers discussed include not only the household names in logic, but also Husserl, Wittgenstein and Ramsey. Needless to say, such logically-oriented thinkers as Frege, Russell and Goedel are not entirely neglected, either. Audience: Everybody interested in the philosophy and/or history of mathematics will find this book interesting, giving frequently novel insights.

At the beginning of the new millennium, fuzzy logic opens a new challenging perspective in information processing. This perspective emerges out of the ideas of the founder of fuzzy logic - Lotfi Zadeh, to develop 'soft' tools for direct computing with human perceptions. The enigmatic nature of human perceptions manifests in their unique capacity to generalize, extract patterns and capture both the essence and the integrity of the events and phenomena in human life. This capacity goes together with an intrinsic imprecision of the perception-based information. According to Zadeh, it is because of the imprecision of the human imprecision that they do not lend themselves to meaning representation through the use of precise methods based on predicate logic. This is the principal reason why existing scientific theories do not have the capability to operate on perception-based information. We are at the eve of the emergence of a theory with such a capability. Its applicative effectiveness has been already demonstrated through the industrial implementation of the soft computing - a powerful intelligent technology centred in fuzzy logic. At the focus of the papers included in this book is the knowledge and experience of the researchers in relation both to the engineering applications of soft computing and to its social and philosophical implications at the dawn of the third millennium. The papers clearly demonstrate that Fuzzy Logic revolutionizes general approaches for solving applied problems and reveals deep connections between them and their solutions.

This monograph develops projective geometries and provides a systematic treatment of morphisms. It introduces a new fundamental theorem and its applications describing morphisms of projective geometries in homogeneous coordinates by semilinear maps. Other topics treated include three equivalent definitions of projective geometries and their correspondence with certain lattices; quotients of projective geometries and isomorphism theorems; and recent results in dimension theory.

This volume, the 6th volume in the DRUMS Handbook series, is part of the after math of the successful ESPRIT project DRUMS (Defeasible Reasoning and Un certainty Management Systems) which took place in two stages from 1989-1996. In the second stage (1993-1996) a work package was introduced devoted to the topics Reasoning and Dynamics, covering both the topics of 'Dynamics of Rea soning', where reasoning is viewed as a process, and 'Reasoning about Dynamics', which must be understood as pertaining to how both designers of and agents within dynamic systems may reason about these systems. The present volume presents work done in this context. This work has an emphasis on modelling and formal techniques in the investigation of the topic "Reasoning and Dynamics," but it is not mere theory that occupied us. Rather research was aimed at bridging the gap between theory and practice. Therefore also real-life applications of the modelling techniques were considered, and we hope this also shows in this volume, which is focused on the dynamics of reasoning processes. In order to give the book a broader perspective, we have invited a number of well-known researchers outside the project but working on similar topics to contribute as well. We have very pleasant recollections of the project, with its lively workshops and other meetings, with the many sites and researchers involved, both within and outside our own work package."

One can distinguish, roughly speaking, two different approaches to the philosophy of mathematics. On the one hand, some philosophers (and some mathematicians) take the nature and the results of mathematicians' activities as given, and go on to ask what philosophical morals one might perhaps find in their story. On the other hand, some philosophers, logicians and mathematicians have tried or are trying to subject the very concepts which mathematicians are using in their work to critical scrutiny. In practice this usually means scrutinizing the logical and linguistic tools mathematicians wield. Such scrutiny can scarcely help relying on philosophical ideas and principles. In other words it can scarcely help being literally a study of language, truth and logic in mathematics, albeit not necessarily in the spirit of AJ. Ayer. As its title indicates, the essays included in the present volume represent the latter approach. In most of them one of the fundamental concepts in the foundations of mathematics and logic is subjected to a scrutiny from a largely novel point of view. Typically, it turns out that the concept in question is in need of a revision or reconsideration or at least can be given a new twist. The results of such a re-examination are not primarily critical, however, but typically open up new constructive possibilities. The consequences of such deconstructions and reconstructions are often quite sweeping, and are explored in the same paper or in others.

Proof theory and category theory were first drawn together by Lambek some 30 years ago but, until now, the most fundamental notions of category theory (as opposed to their embodiments in logic) have not been explained systematically in terms of proof theory. Here it is shown that these notions, in particular the notion of adjunction, can be formulated in such as way as to be characterised by composition elimination. Among the benefits of these composition-free formulations are syntactical and simple model-theoretical, geometrical decision procedures for the commuting of diagrams of arrows. Composition elimination, in the form of Gentzen's cut elimination, takes in categories, and techniques inspired by Gentzen are shown to work even better in a purely categorical context than in logic. An acquaintance with the basic ideas of general proof theory is relied on only for the sake of motivation, however, and the treatment of matters related to categories is also in general self contained. Besides familiar topics, presented in a novel, simple way, the monograph also contains new results. It can be used as an introductory text in categorical proof theory.

Fuzzy Sets, Logics and Reasoning about Knowledge reports recent results concerning the genuinely logical aspects of fuzzy sets in relation to algebraic considerations, knowledge representation and commonsense reasoning. It takes a state-of-the-art look at multiple-valued and fuzzy set-based logics, in an artificial intelligence perspective. The papers, all of which are written by leading contributors in their respective fields, are grouped into four sections. The first section presents a panorama of many-valued logics in connection with fuzzy sets. The second explores algebraic foundations, with an emphasis on MV algebras. The third is devoted to approximate reasoning methods and similarity-based reasoning. The fourth explores connections between fuzzy knowledge representation, especially possibilistic logic and prioritized knowledge bases. Readership: Scholars and graduate students in logic, algebra, knowledge representation, and formal aspects of artificial intelligence.

This volume contains a selection of papers presented at a Seminar on Intensional Logic held at the University of Amsterdam during the period September 1990-May 1991. Modal logic, either as a topic or as a tool, is common to most of the papers in this volume. A number of the papers are con cerned with what may be called well-known or traditional modal systems, but, as a quick glance through this volume will reveal, this by no means implies that they walk the beaten tracks. In deed, such contributions display new directions, new results, and new techniques to obtain familiar results. Other papers in this volume are representative examples of a current trend in modal logic: the study of extensions or adaptations of the standard sys tems that have been introduced to overcome various shortcomings of the latter, especially their limited expressive power. Finally, there is another major theme that can be discerned in the vol ume, a theme that may be described by the slogan 'representing changing information. ' Papers falling under this heading address long-standing issues in the area, or present a systematic approach, while a critical survey and a report contributing new techniques are also included. The bulk of the papers on pure modal logic deal with theoreti calor even foundational aspects of modal systems."

We welcome Volume 20, Formal Aspects of Context. Context has always been recognised as strongly relevant to models in language, philosophy, logic and artifi cial intelligence. In recent years theoretical advances in these areas and especially in logic have accelerated the study of context in the international community. An annual conference is held and many researchers have come to realise that many of the old puzzles should be reconsidered with proper attention to context. The volume editors and contributors are from among the most active front-line researchers in the area and the contents shows how wide and vigorous this area is. There are strong scientific connections with earlier volumes in the series. I am confident that the appearance of this book in our series will help secure the study of context as an important area of applied logic. D.M.Gabbay INTRODUCTION This book is a result of the First International and Interdisciplinary Con ference on Modelling and Using Context, which was organised in Rio de Janeiro in January 1997, and contains a selection of the papers presented there, refereed and revised through a process of anonymous peer review. The treatment of contexts as bona-fide objects of logical formalisation has gained wide acceptance in recent years, following the seminal impetus by McCarthy in his 'lUring award address."

The present monograph intends to establish a solid link among three fields: fuzzy set theory, information retrieval, and cluster analysis. Fuzzy set theory supplies new concepts and methods for the other two fields, and provides a common frame work within which they can be reorganized. Four principal groups of readers are assumed: researchers or students who are interested in (a) application of fuzzy sets, (b) theory of information retrieval or bibliographic databases, (c) hierarchical clustering, and (d) application of methods in systems science. Readers in group (a) may notice that the fuzzy set theory used here is very simple, since only finite sets are dealt with. This simplification enables the max min algebra to deal with fuzzy relations and matrices as equivalent entities. Fuzzy graphs are also used for describing theoretical properties of fuzzy relations. This assumption of finite sets is sufficient for applying fuzzy sets to information retrieval and cluster analysis. This means that little theory, beyond the basic theory of fuzzy sets, is required. Although readers in group (b) with little background in the theory of fuzzy sets may have difficulty with a few sections, they will also find enough in this monograph to support an intuitive grasp of this new concept of fuzzy information retrieval. Chapter 4 provides fuzzy retrieval without the use of mathematical symbols. Also, fuzzy graphs will serve as an aid to the intuitive understanding of fuzzy relations."

This book presents a specific and unified approach to Knowledge Discovery and Data Mining, termed IFN for Information Fuzzy Network methodology. Data Mining (DM) is the science of modelling and generalizing common patterns from large sets of multi-type data. DM is a part of KDD, which is the overall process for Knowledge Discovery in Databases. The accessibility and abundance of information today makes this a topic of particular importance and need. The book has three main parts complemented by appendices as well as software and project data that are accessible from the book's web site (http: //www.eng.tau.ac.iV-maimonlifn-kdg ). Part I (Chapters 1-4) starts with the topic of KDD and DM in general and makes reference to other works in the field, especially those related to the information theoretic approach. The remainder of the book presents our work, starting with the IFN theory and algorithms. Part II (Chapters 5-6) discusses the methodology of application and includes case studies. Then in Part III (Chapters 7-9) a comparative study is presented, concluding with some advanced methods and open problems. The IFN, being a generic methodology, applies to a variety of fields, such as manufacturing, finance, health care, medicine, insurance, and human resources. The appendices expand on the relevant theoretical background and present descriptions of sample projects (including detailed results)."

"In case you are considering to adopt this book for courses with over 50 students, please contact ""[email protected]"" for more information. "

This introduction to mathematical logic starts with propositional calculus and first-order logic. Topics covered include syntax, semantics, soundness, completeness, independence, normal forms, vertical paths through negation normal formulas, compactness, Smullyan's Unifying Principle, natural deduction, cut-elimination, semantic tableaux, Skolemization, Herbrand's Theorem, unification, duality, interpolation, and definability.

The last three chapters of the book provide an introduction to type theory (higher-order logic). It is shown how various mathematical concepts can be formalized in this very expressive formal language. This expressive notation facilitates proofs of the classical incompleteness and undecidability theorems which are very elegant and easy to understand. The discussion of semantics makes clear the important distinction between standard and nonstandard models which is so important in understanding puzzling phenomena such as the incompleteness theorems and Skolem's Paradox about countable models of set theory.

Some of the numerous exercises require giving formal proofs. A computer program called ETPS which is available from the web facilitates doing and checking such exercises.

"Audience: " This volume will be of interest to mathematicians, computer scientists, and philosophers in universities, as well as to computer scientists in industry who wish to use higher-order logic for hardware and software specification and verification. "

Internal logic is the logic of content. The content is here arithmetic and the emphasis is on a constructive logic of arithmetic (arithmetical logic). Kronecker's general arithmetic of forms (polynomials) together with Fermat's infinite descent is put to use in an internal consistency proof. The view is developed in the context of a radical arithmetization of mathematics and logic and covers the many-faceted heritage of Kronecker's work, which includes not only Hilbert, but also Frege, Cantor, Dedekind, Husserl and Brouwer.

The book will be of primary interest to logicians, philosophers and mathematicians interested in the foundations of mathematics and the philosophical implications of constructivist mathematics. It may also be of interest to historians, since it covers a fifty-year period, from 1880 to 1930, which has been crucial in the foundational debates and their repercussions on the contemporary scene.

Proof Theory of Modal Logic is devoted to a thorough study of proof systems for modal logics, that is, logics of necessity, possibility, knowledge, belief, time, computations etc. It contains many new technical results and presentations of novel proof procedures. The volume is of immense importance for the interdisciplinary fields of logic, knowledge representation, and automated deduction.

Fuzzy logics are many-valued logics that are well suited to reasoning in the context of vagueness. They provide the basis for the wider field of Fuzzy Logic, encompassing diverse areas such as fuzzy control, fuzzy databases, and fuzzy mathematics. This book provides an accessible and up-to-date introduction to this fast-growing and increasingly popular area. It focuses in particular on the development and applications of "proof-theoretic" presentations of fuzzy logics; the result of more than ten years of intensive work by researchers in the area, including the authors. In addition to providing alternative elegant presentations of fuzzy logics, proof-theoretic methods are useful for addressing theoretical problems (including key standard completeness results) and developing efficient deduction and decision algorithms. Proof-theoretic presentations also place fuzzy logics in the broader landscape of non-classical logics, revealing deep relations with other logics studied in Computer Science, Mathematics, and Philosophy. The book builds methodically from the semantic origins of fuzzy logics to proof-theoretic presentations such as Hilbert and Gentzen systems, introducing both theoretical and practical applications of these presentations.

Homological Mirror Symmetry, the study of dualities of certain quantum field theories in a mathematically rigorous form, has developed into a flourishing subject on its own over the past years. The present volume bridges a gap in the literature by providing a set of lectures and reviews that both introduce and representatively review the state-of-the art in the field from different perspectives. With contributions by K. Fukaya, M. Herbst, K. Hori, M. Huang, A. Kapustin, L. Katzarkov, A. Klemm, M. Kontsevich, D. Page, S. Quackenbush, E. Sharpe, P. Seidel, I. Smith and Y. Soibelman, this volume will be a reference on the topic for everyone starting to work or actively working on mathematical aspects of quantum field theory.

In the aftermath of the discoveries in foundations of mathematiC's there was surprisingly little effect on mathematics as a whole. If one looks at stan dard textbooks in different mathematical disciplines, especially those closer to what is referred to as applied mathematics, there is little trace of those developments outside of mathematical logic and model theory. But it seems fair to say that there is a widespread conviction that the principles embodied in the Zermelo - Fraenkel theory with Choice (ZFC) are a correct description of the set theoretic underpinnings of mathematics. In most textbooks of the kind referred to above, there is, of course, no discussion of these matters, and set theory is assumed informally, although more advanced principles like Choice or sometimes Replacement are often mentioned explicitly. This implicitly fixes a point of view of the mathemat ical universe which is at odds with the results in foundations. For example most mathematicians still take it for granted that the real number system is uniquely determined up to isomorphism, which is a correct point of view as long as one does not accept to look at "unnatural" interpretations of the membership relation."