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

A partially ordered group is an algebraic object having the structure of a group and the structure of a partially ordered set which are connected in some natural way. These connections were established in the period between the end of 19th and beginning of 20th century. It was realized that ordered algebraic systems occur in various branches of mathemat ics bound up with its fundamentals. For example, the classification of infinitesimals resulted in discovery of non-archimedean ordered al gebraic systems, the formalization of the notion of real number led to the definition of ordered groups and ordered fields, the construc tion of non-archimedean geometries brought about the investigation of non-archimedean ordered groups and fields. The theory of partially ordered groups was developed by: R. Dedekind, a. Holder, D. Gilbert, B. Neumann, A. I. Mal'cev, P. Hall, G. Birkhoff. These connections between partial order and group operations allow us to investigate the properties of partially ordered groups. For exam ple, partially ordered groups with interpolation property were intro duced in F. Riesz's fundamental paper 1] as a key to his investigations of partially ordered real vector spaces, and the study of ordered vector spaces with interpolation properties were continued by many functional analysts since. The deepest and most developed part of the theory of partially ordered groups is the theory of lattice-ordered groups. In the 40s, following the publications of the works by G. Birkhoff, H. Nakano and P."

Much progress has been made during the last decade on the subjects of non commutative valuation rings, and of semi-hereditary and Priifer orders in a simple Artinian ring which are considered, in a sense, as global theories of non-commu tative valuation rings. So it is worth to present a survey of the subjects in a self-contained way, which is the purpose of this book. Historically non-commutative valuation rings of division rings were first treat ed systematically in Schilling's Book [Sc], which are nowadays called invariant valuation rings, though invariant valuation rings can be traced back to Hasse's work in [Has]. Since then, various attempts have been made to study the ideal theory of orders in finite dimensional algebras over fields and to describe the Brauer groups of fields by usage of "valuations", "places", "preplaces", "value functions" and "pseudoplaces". In 1984, N. 1. Dubrovin defined non-commutative valuation rings of simple Artinian rings with notion of places in the category of simple Artinian rings and obtained significant results on non-commutative valuation rings (named Dubrovin valuation rings after him) which signify that these rings may be the correct def inition of valuation rings of simple Artinian rings. Dubrovin valuation rings of central simple algebras over fields are, however, not necessarily to be integral over their centers.

Paul Williams, a leading authority on modeling in integer programming, has written a concise, readable introduction to the science and art of using modeling in logic for integer programming. Written for graduate and postgraduate students, as well as academics and practitioners, the book is divided into four chapters that all avoid the typical format of definitions, theorems and proofs and instead introduce concepts and results within the text through examples. References are given at the end of each chapter to the more mathematical papers and texts on the subject, and exercises are included to reinforce and expand on the material in the chapter. Methods of solving with both logic and IP are given and their connections are described. Applications in diverse fields are discussed, and Williams shows how IP models can be expressed as satisfiability problems and solved as such.

This book proposes a uniform logic and probabilistic (LP) approach to risk estimation and analysis in engineering and economics. It covers the methodological and theoretical basis of risk management at the design, test, and operation stages of economic, banking, and engineering systems with groups of incompatible events (GIE). This edition includes new chapters providing a detailed treatment of scenario logic and probabilistic models for revealing bribes. It also contains clear definitions and notations, revised sections and chapters, an extended list of references, and a new subject index, as well as more than a hundred illustrations and tables which motivate the presentation.

Group cohomology has a rich history that goes back a century or more. Its origins are rooted in investigations of group theory and num ber theory, and it grew into an integral component of algebraic topology. In the last thirty years, group cohomology has developed a powerful con nection with finite group representations. Unlike the early applications which were primarily concerned with cohomology in low degrees, the in teractions with representation theory involve cohomology rings and the geometry of spectra over these rings. It is this connection to represen tation theory that we take as our primary motivation for this book. The book consists of two separate pieces. Chronologically, the first part was the computer calculations of the mod-2 cohomology rings of the groups whose orders divide 64. The ideas and the programs for the calculations were developed over the last 10 years. Several new features were added over the course of that time. We had originally planned to include only a brief introduction to the calculations. However, we were persuaded to produce a more substantial text that would include in greater detail the concepts that are the subject of the calculations and are the source of some of the motivating conjectures for the com putations. We have gathered together many of the results and ideas that are the focus of the calculations from throughout the mathematical literature."

While in classical (abelian) homological algebra additive functors from abelian (or additive) categories to abelian categories are investigated , non- abelian homological algebra deals with non-additive functors and their homological properties , in particular with functors having values in non-abelian categories. Such functors haveimportant applications in algebra, algebraic topology, functional analysis, algebraic geometry and other principal areas of mathematics. To study homological properties of non-additive functors it is necessary to define and investigate their derived functors and satellites. It will be the aim of this book based on the results of researchers of A. Razmadze Mathematical Institute of the Georgian Academy of Sciences devoted to non-abelian homological algebra. The most important considered cases will be functors from arbitrary categories to the category of modules, group valued functors and commutative semigroup valued functors. In Chapter I universal sequences of functors are defined and in- vestigated with respect to (co)presheaves of categories, extending in a natural way the satellites of additive functors to the non-additive case and generalizing the classical relative homological algebra in additive categories to arbitrary categories. Applications are given in the furth- coming chapters. Chapter II is devoted to the non-abelian derived functors of group valued functors with respect to projective classes using projective pseu- dosimplicial resolutions. Their functorial properties (exactness, Milnor exact sequence, relationship with cotriple derived functors, satellites and Grothendieck cohomology, spectral sequence of an epimorphism, degree of an arbitrary functor) are established and applications to ho- mology and cohomology of groups are given.

The already broad range of applications of ring theory has been enhanced in the eighties by the increasing interest in algebraic structures of considerable complexity, the so-called class of quantum groups. One of the fundamental properties of quantum groups is that they are modelled by associative coordinate rings possessing a canonical basis, which allows for the use of algorithmic structures based on Groebner bases to study them. This book develops these methods in a self-contained way, concentrating on an in-depth study of the notion of a vast class of non-commutative rings (encompassing most quantum groups), the so-called Poincar -Birkhoff-Witt rings. We include algorithms which treat essential aspects like ideals and (bi)modules, the calculation of homological dimension and of the Gelfand-Kirillov dimension, the Hilbert-Samuel polynomial, primality tests for prime ideals, etc.

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.

Today the notion of the algorithm is familiar not only to mathematicians. It forms a conceptual base for information processing; the existence of a corresponding algorithm makes automatic information processing possible. The theory of algorithms (together with mathematical logic ) forms the the oretical basis for modern computer science (see [Sem Us 86]; this article is called "Mathematical Logic in Computer Science and Computing Practice" and in its title mathematical logic is understood in a broad sense including the theory of algorithms). However, not everyone realizes that the word "algorithm" includes a transformed toponym Khorezm. Algorithms were named after a great sci entist of medieval East, is al-Khwarizmi (where al-Khwarizmi means "from Khorezm"). He lived between c. 783 and 850 B.C. and the year 1983 was chosen to celebrate his 1200th birthday. A short biography of al-Khwarizmi compiled in the tenth century starts as follows: "al-Khwarizmi. His name is Muhammad ibn Musa, he is from Khoresm" (cited according to [Bul Rozen Ah 83, p.8]).

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.

The contents of this volume range from expository papers on several aspects of number theory, intended for general readers (Steinhaus property of planar regions; experiments with computers; Diophantine approximation; number field sieve), to a collection of research papers for specialists, which are at prestigious journal level. Thus, Number Theory and Its Applications leads the reader in many ways not only to the state of the art of number theory but also to its rich garden.

Time is a fascinating subject and has long since captured mankind's imagination, from the ancients to modern man, both adult and child alike. It has been studied across a wide range of disciplines, from the natural sciences to philosophy and logic. Today, thirty plus years since Prior's work in laying out foundations for temporal logic, and two decades on from Pnueli's seminal work applying of temporal logic in specification and verification of computer programs, temporal logic has a strong and thriving international research community within the broad disciplines of computer science and artificial intelligence. Areas of activity include, but are certainly not restricted to: Pure Temporal Logic, e. g. temporal systems, proof theory, model theory, expressiveness and complexity issues, algebraic properties, application of game theory; Specification and Verification, e. g. of reactive systems, ofreal-time components, of user interaction, of hardware systems, techniques and tools for verification, execution and prototyping methods; Temporal Databases, e. g. temporal representation, temporal query ing, granularity of time, update mechanisms, active temporal data bases, hypothetical reasoning; Temporal Aspects in AI, e. g. modelling temporal phenomena, in terval temporal calculi, temporal nonmonotonicity, interaction of temporal reasoning with action/knowledge/belief logics, temporal planning; Tense and Aspect in Natural Language, e. g. models, ontologies, temporal quantifiers, connectives, prepositions, processing tempo ral statements; Temporal Theorem Proving, e. g. translation methods, clausal and non-clausal resolution, tableaux, automata-theoretic approaches, tools and practical systems."

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

The notion of a dominated or rnajorized operator rests on a simple idea that goes as far back as the Cauchy method of majorants. Loosely speaking, the idea can be expressed as follows. If an operator (equation) under study is dominated by another operator (equation), called a dominant or majorant, then the properties of the latter have a substantial influence on the properties of the former . Thus, operators or equations that have "nice" dominants must possess "nice" properties. In other words, an operator with a somehow qualified dominant must be qualified itself. Mathematical tools, putting the idea of domination into a natural and complete form, were suggested by L. V. Kantorovich in 1935-36. He introduced the funda mental notion of a vector space normed by elements of a vector lattice and that of a linear operator between such spaces which is dominated by a positive linear or monotone sublinear operator. He also applied these notions to solving functional equations. In the succeedingyears many authors studied various particular cases of lattice normed spaces and different classes of dominated operators. However, research was performed within and in the spirit of the theory of vector and normed lattices. So, it is not an exaggeration to say that dominated operators, as independent objects of investigation, were beyond the reach of specialists for half a century. As a consequence, the most important structural properties and some interesting applications of dominated operators have become available since recently."

The Centre pour la Synthese d'une Epistemologie Formalisee, henceforth briefly named CeSEF, was founded in June 1994 by a small group of s- entists working in various disciplines, with the definite aim to synthesize a "formalized epistemology" founded on the methods identifiable within the foremost modern scientificdisciplines. Most of the founders were already authors of well-known works displaying a particular sensitivity to episte- logical questions. But the aim that united us was new. This aim along with the peculiar choice of its verbal expression are thoroughly discussed in the Introduction. In the present volume, we publish the first harvest of explorations and constructive proposals advanced in pursuit of our goal. The contributions are expressive also of the views of those who shared only our beginnings and 1 then left us; they equally reflect input from those who participated in our workshops but did not contribute to this volume. We are indebted to the Association Naturalia et Biologica for having supported with a donation the publication of this volume. The camera-ready form of this book we owe to the patient and met- ulous labor of Ms. Jackie Gratrix. The superb job she has done is herewith gratefully acknowledged. Mioara Mugur-Schachter and Alwyn van der Merwe 1 Paul Bourgine and, quite specially, Bernard Walliser."

Generalized Measure Theory examines the relatively new mathematical area of generalized measure theory. The exposition unfolds systematically, beginning with preliminaries and new concepts, followed by a detailed treatment of important new results regarding various types of nonadditive measures and the associated integration theory. The latter involves several types of integrals: Sugeno integrals, Choquet integrals, pan-integrals, and lower and upper integrals. All of the topics are motivated by numerous examples, culminating in a final chapter on applications of generalized measure theory.

Some key features of the book include: many exercises at the end of each chapter along with relevant historical and bibliographical notes, an extensive bibliography, and name and subject indices. The work is suitable for a classroom setting at the graduate level in courses or seminars in applied mathematics, computer science, engineering, and some areas of science. A sound background in mathematical analysis is required. Since the book contains many original results by the authors, it will also appeal to researchers working in the emerging area of generalized measure theory.

This book examines an abstract mathematical theory, placing special emphasis on results applicable to formal logic. If a theory is especially abstract, it may find a natural home within several of the more familiar branches of mathematics. This is the case with the theory of closure spaces. It might be considered part of topology, lattice theory, universal algebra or, no doubt, one of several other branches of mathematics as well. In our development we have treated it, conceptually and methodologically, as part of topology, partly because we first thought ofthe basic structure involved (closure space), as a generalization of Frechet's concept V-space. V-spaces have been used in some developments of general topology as a generalization of topological space. Indeed, when in the early '50s, one of us started thinking about closure spaces, we thought ofit as the generalization of Frechet V space which comes from not requiring the null set to be CLOSURE SPACES ANDLOGIC XlI closed(as it is in V-spaces). This generalization has an extreme advantage in connection with application to logic, since the most important closure notion in logic, deductive closure, in most cases does not generate a V-space, since the closure of the null set typically consists of the "logical truths" of the logic being examined."

Fuzzy logic in narrow sense is a promising new chapter of formal logic whose basic ideas were formulated by Lotfi Zadeh (see Zadeh 1975]a). The aim of this theory is to formalize the "approximate reasoning" we use in everyday life, the object of investigation being the human aptitude to manage vague properties (as, for example, "beautiful," "small," "plausible," "believable," etc. ) that by their own nature can be satisfied to a degree different from 0 (false) and I (true). It is worth noting that the traditional deductive framework in many-valued logic is different from the one adopted in this book for fuzzy logic: in the former logics one always uses a "crisp" deduction apparatus, producing crisp sets of formulas, the formulas that are considered logically valid. By contrast, fuzzy logical deductive machinery is devised to produce a fuzzy set of formulas (the theorems) from a fuzzy set of formulas (the hypotheses). Approximate reasoning has generated a very interesting literature in recent years. However, in spite of several basic results, in our opinion, we are still far from a satisfactory setting of this very hard and mysterious subject. The aim of this book is to furnish some theoretical devices and to sketch a general framework for fuzzy logic. This is also in accordance with the non Fregean attitude of the book."

Recent years have been blessed with an abundance of logical systems, arising from a multitude of applications. A logic can be characterised in many different ways. Traditionally, a logic is presented via the following three components: 1. an intuitive non-formal motivation, perhaps tie it in to some application area 2. a semantical interpretation 3. a proof theoretical formulation. There are several types of proof theoretical methodologies, Hilbert style, Gentzen style, goal directed style, labelled deductive system style, and so on. The tableau methodology, invented in the 1950s by Beth and Hintikka and later per fected by Smullyan and Fitting, is today one of the most popular, since it appears to bring together the proof-theoretical and the semantical approaches to the pre of a logical system and is also very intuitive. In many universities it is sentation the style first taught to students. Recently interest in tableaux has become more widespread and a community crystallised around the subject. An annual tableaux conference is being held and proceedings are published. The present volume is a Handbook a/Tableaux pre senting to the community a wide coverage of tableaux systems for a variety of logics. It is written by active members of the community and brings the reader up to frontline research. It will be of interest to any formal logician from any area."

Since their appearance in the late 19th century, the Cantor--Dedekind theory of real numbers and philosophy of the continuum have emerged as pillars of standard mathematical philosophy. On the other hand, this period also witnessed the emergence of a variety of alternative theories of real numbers and corresponding theories of continua, as well as non-Archimedean geometry, non-standard analysis, and a number of important generalizations of the system of real numbers, some of which have been described as arithmetic continua of one type or another. With the exception of E.W. Hobson's essay, which is concerned with the ideas of Cantor and Dedekind and their reception at the turn of the century, the papers in the present collection are either concerned with or are contributions to, the latter groups of studies. All the contributors are outstanding authorities in their respective fields, and the essays, which are directed to historians and philosophers of mathematics as well as to mathematicians who are concerned with the foundations of their subject, are preceded by a lengthy historical introduction.

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 the summer of 1991 the Department of Mathematics and Statistics of the Universite de Montreal was fortunate to host the NATO Advanced Study Institute "Algebras and Orders" as its 30th Seminaire de mathematiques superieures (SMS), a summer school with a long tradition and well-established reputation. This book contains the contributions of the invited speakers. Universal algebra- which established itself only in the 1930's- grew from traditional algebra (e.g., groups, modules, rings and lattices) and logic (e.g., propositional calculus, model theory and the theory of relations). It started by extending results from these fields but by now it is a well-established and dynamic discipline in its own right. One of the objectives of the ASI was to cover a broad spectrum of topics in this field, and to put in evidence the natural links to, and interactions with, boolean algebra, lattice theory, topology, graphs, relations, automata, theoretical computer science and (partial) orders. The theory of orders is a relatively young and vigorous discipline sharing certain topics as well as many researchers and meetings with universal algebra and lattice theory. W. Taylor surveyed the abstract clone theory which formalizes the process of compos ing operations (i.e., the formation of term operations) of an algebra as a special category with countably many objects, and leading naturally to the interpretation and equivalence of varieties."

Soft computing encompasses various computational methodologies, which, unlike conventional algorithms, are tolerant of imprecision, uncertainty, and partial truth. Soft computing technologies offer adaptability as a characteristic feature and thus permit the tracking of a problem through a changing environment. Besides some recent developments in areas like rough sets and probabilistic networks, fuzzy logic, evolutionary algorithms, and artificial neural networks are core ingredients of soft computing, which are all bio-inspired and can easily be combined synergetically.
This book presents a well-balanced integration of fuzzy logic, evolutionary computing, and neural information processing. The three constituents are introduced to the reader systematically and brought together in differentiated combinations step by step. The text was developed from courses given by the authors and offers numerous illustrations as

To our wives, Masha and Marian Interest in the so-called completely integrable systems with infinite num ber of degrees of freedom was aroused immediately after publication of the famous series of papers by Gardner, Greene, Kruskal, Miura, and Zabusky [75, 77, 96, 18, 66, 19J (see also [76]) on striking properties of the Korteweg-de Vries (KdV) equation. It soon became clear that systems of such a kind possess a number of characteristic properties, such as infinite series of symmetries and/or conservation laws, inverse scattering problem formulation, L - A pair representation, existence of prolongation structures, etc. And though no satisfactory definition of complete integrability was yet invented, a need of testing a particular system for these properties appeared. Probably one of the most efficient tests of this kind was first proposed by Lenard [19]' who constructed a recursion operator for symmetries of the KdV equation. It was a strange operator, in a sense: being formally integro-differential, its action on the first classical symmetry (x-translation) was well-defined and produced the entire series of higher KdV equations; but applied to the scaling symmetry, it gave expressions containing terms of the type J u dx which had no adequate interpretation in the framework of the existing theories. It is not surprising that P. Olver wrote "The de duction of the form of the recursion operator (if it exists) requires a certain amount of inspired guesswork. . . " [80, p.