The work of which this is an English translation appeared originally in French as Precis de logique mathematique. In 1954 Dr. Albert Menne brought out a revised and somewhat enlarged edition in German (Grund riss der Logistik, F. Schoningh, Paderborn). In making my translation I have used both editions. For the most part I have followed the original French edition, since I thought there was some advantage in keeping the work as short as possible. However, I have included the more extensive historical notes of Dr. Menne, his bibliography, and the two sections on modal logic and the syntactical categories ( 25 and 27), which were not in the original. I have endeavored to correct the typo graphical errors that appeared in the original editions and have made a few additions to the bibliography. In making the translation I have profited more than words can tell from the ever-generous help of Fr. Bochenski while he was teaching at the University of Notre Dame during 1955-56. OTTO BIRD Notre Dame, 1959 I GENERAL PRINCIPLES O. INTRODUCTION 0. 1. Notion and history. Mathematical logic, also called 'logistic', .symbolic logic', the 'algebra of logic', and, more recently, simply 'formal logic', is the set of logical theories elaborated in the course of the last century with the aid of an artificial notation and a rigorously deductive method."

The encounter, in the late seventies, between the theory of triangular norms, issuing frorn stochastic geornetry, especially the works of Menger, Schweizer and Sklar, on the one band, and the theory of fuzzy sets due to Zadeh, 10n the other band has been very fruitful. Triangular norms have proved to be ready-rnade mathematical rnodels of fuzzy set intersections and have shed light on the algebraic foundations of fuzzy sets. One basic idea behind the study of triangular norms is to solve functional equations that stern frorn prescribed axioms describing algebraic properties such as associativity. Alternative operations such as rneans have been characterized in a similar way by Kolmogorov, for instance, and the rnethods for solving functional equations are now weil established thanks to the efforts of Aczel, among others. One can say without overstaternent that the introduction of triangular norms in fuzzy sets has strongly influenced further developrnents in fuzzy set theory, and has significantly contributed to its better acceptance in pure and applied rnathematics circles. The book by Fodor and Roubens systematically exploits the benefits of this encounter in the- analysis of fuzzy relations. The authors apply functional equation rnethods to notions such as equivalence relations, and various kinds of orderings, for the purpose of preference rnodelling. Centtal to this book is the rnultivalued extension of the well-known result claiming that any relation expressing weak preference can be separated into three cornponents respectively describing strict preference, indifference and incomparability.

This book contains the proceedings of the International Symposium on Mathematical Morphology and its Applications to Image and Signal Processing IV, held June 3-5, 1998, in Amsterdam, The Netherlands. The purpose of the work is to provide the image analysis community with a sampling of recent developments in theoretical and practical aspects of mathematical morphology and its applications to image and signal processing. Among the areas covered are: digitization and connectivity, skeletonization, multivariate morphology, morphological segmentation, color image processing, filter design, gray-scale morphology, fuzzy morphology, decomposition of morphological operators, random sets and statistical inference, differential morphology and scale-space, morphological algorithms and applications. Audience: This volume will be of interest to research mathematicians and computer scientists whose work involves mathematical morphology, image and signal processing.

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.

The nationwide research project Deduktion', funded by the Deutsche Forschungsgemeinschaft (DFG)' for a period of six years, brought together almost all research groups within Germany engaged in the field of automated reasoning. Intensive cooperation and exchange of ideas led to considerable progress both in the theoretical foundations and in the application of deductive knowledge. This three-volume book covers these original contributions moulded into the state of the art of automated deduction. The three volumes are intended to document and advance a development in the field of automated deduction that can now be observed all over the world. Rather than restricting the interest to purely academic research, the focus now is on the investigation of problems derived from realistic applications. In fact industrial applications are already pursued on a trial basis. In consequence the emphasis of the volumes is not on the presentation of the theoretical foundations of logical deduction as such, as in a handbook; rather the books present the concepts and methods now available in automated deduction in a form which can be easily accessed by scientists working in applications outside of the field of deduction. This reflects the strong conviction that automated deduction is on the verge of being fully included in the evolution of technology. Volume I focuses on basic research in deduction and on the knowledge on which modern deductive systems are based. Volume II presents techniques of implementation and details about system building. Volume III deals with applications of deductive techniques mainly, but not exclusively, to mathematics and the verification of software. Each chapter was read by two referees, one an international expert from abroad and the other a knowledgeable participant in the national project. It has been accepted for inclusion on the basis of these review reports. Audience: Researchers and developers in software engineering, formal methods, certification, verification, validation, specification of complex systems and software, expert systems, natural language processing.

1. BASIC CONCEPTS OF INTERACTIVE THEOREM PROVING Interactive Theorem Proving ultimately aims at the construction of powerful reasoning tools that let us (computer scientists) prove things we cannot prove without the tools, and the tools cannot prove without us. Interaction typi cally is needed, for example, to direct and control the reasoning, to speculate or generalize strategic lemmas, and sometimes simply because the conjec ture to be proved does not hold. In software verification, for example, correct versions of specifications and programs typically are obtained only after a number of failed proof attempts and subsequent error corrections. Different interactive theorem provers may actually look quite different: They may support different logics (first-or higher-order, logics of programs, type theory etc.), may be generic or special-purpose tools, or may be tar geted to different applications. Nevertheless, they share common concepts and paradigms (e.g. architectural design, tactics, tactical reasoning etc.). The aim of this chapter is to describe the common concepts, design principles, and basic requirements of interactive theorem provers, and to explore the band width of variations. Having a 'person in the loop', strongly influences the design of the proof tool: proofs must remain comprehensible, - proof rules must be high-level and human-oriented, - persistent proof presentation and visualization becomes very important."

It is known that many control processes are characterized by both quantitative and qualitative complexity. Tbe quantitative complexity is usually expressed in a large number of state variables, respectively high dimensional mathematical model. Tbe qualitative complexity is usually associated with uncertain behaviour, respectively approximately known mathematical model. If the above two aspects of complexity are considered separately, the corresponding control problem can be easily solved. On one hand, large scale systems theory has existed for more than 20 years and has proved its capabilities in solving high dimensional control problems on the basis of decomposition, hierarchy, decentralization and multilayers. On the other hand, the fuzzy linguistic approach is almost at the same age and has shown its advantages in solving approximately formulated control problems on the basis of linguistic reasoning and logical inference. However, if both aspects of complexity are considered together, the corresponding control problem becomes non-trivial and does not have an easy solution. Modem control theory and practice have reacted accordingly to the above mentioned new cballenges of tbe day by utilizing the latest achievements in computer technology and artificial intelligence distributed computation and intelligent operation. In this respect, a new field has emerged in the last decade, called " Distributed intelligent control systems" . However, the majority of the familiar works in this field are still either on an empirical or on a conceptual level and this is a significant drawback.

'A Geometry of Approximation' addresses Rough Set Theory, a field of interdisciplinary research first proposed by Zdzislaw Pawlak in 1982, and focuses mainly on its logic-algebraic interpretation. The theory is embedded in a broader perspective that includes logical and mathematical methodologies pertaining to the theory, as well as related epistemological issues. Any mathematical technique that is introduced in the book is preceded by logical and epistemological explanations. Intuitive justifications are also provided, insofar as possible, so that the general perspective is not lost.

Such an approach endows the present treatise with a unique character. Due to this uniqueness in the treatment of the subject, the book will be useful to researchers, graduate and pre-graduate students from various disciplines, such as computer science, mathematics and philosophy. It features an impressive number of examples supported by about 40 tables and 230 figures. The comprehensive index of concepts turns the book into a sort of encyclopaedia for researchers from a number of fields.

'A Geometry of Approximation' links many areas of academic pursuit without losing track of its focal point, Rough Sets.

These notes are devoted to the study of some classical problems in the Geometry of Banach spaces. The novelty lies in the fact that their solution relies heavily on techniques coming from Descriptive Set Theory. Thecentralthemeisuniversalityproblems.Inparticular, thetextprovides an exposition of the methods developed recently in order to treat questions of the following type: (Q) LetC be a class of separable Banach spaces such that every space X in the classC has a certain property, say property (P). When can we ?nd a separable Banach space Y which has property (P) and contains an isomorphic copy of every member ofC? We will consider quite classical properties of Banach spaces, such as "- ing re?exive," "having separable dual," "not containing an isomorphic copy of c," "being non-universal," etc. 0 It turns out that a positive answer to problem (Q), for any of the above mentioned properties, is possible if (and essentially only if) the classC is "simple." The "simplicity" ofC is measured in set theoretic terms. Precisely, if the classC is analytic in a natural "coding" of separable Banach spaces, then we can indeed ?nd a separable space Y which is universal for the class C and satis?es the requirements imposed above.

In his Master Plan Cai Chen (1167-1230) created an original divination manual based on the Yijing and keyed it to an intricate series of 81 matrixes with the properties of "magic squares." Previously unrecognized, Cai's work is a milestone in the history of mathematics, and, in introducing it, this book dramatically expands our understanding of the Chinese number theory practiced by the "Image and Number" school within Confucian philosophy. Thinkers of that leaning devised graphic arrays of the binary figures called "trigrams" and "hexagrams" in the Yijing as a way of exploring the relationship between the random draws of divination and the classic's readings. Cai adapted this perspective to his 81 matrix series, which he saw as tracing the recurring temporal cycles of the natural world. The architecture of the matrix series is echoed in the language of his divination texts, which he called "number names"-hence, the book's title. This book will appeal to those interested in philosophy, the history of science and mathematics, and Chinese intellectual history. The divination text has significant literary as well as philosophical dimensions, and its audience lies both among specialists in these fields and with a general readership interested in recreational mathematics and topics like divination, Taiji, and Fengshui.

There is no branch of mathematics, however abstract, which may not some day be applied to phenomena of the real world. - Nikolai Ivanovich Lobatchevsky This book is an extensively-revised and expanded version of "The Theory of Semirings, with Applicationsin Mathematics and Theoretical Computer Science" [Golan, 1992], first published by Longman. When that book went out of print, it became clear - in light of the significant advances in semiring theory over the past years and its new important applications in such areas as idempotent analysis and the theory of discrete-event dynamical systems - that a second edition incorporating minor changes would not be sufficient and that a major revision of the book was in order. Therefore, though the structure of the first "dition was preserved, the text was extensively rewritten and substantially expanded. In particular, references to many interesting and applications of semiring theory, developed in the past few years, had to be added. Unfortunately, I find that it is best not to go into these applications in detail, for that would entail long digressions into various domains of pure and applied mathematics which would only detract from the unity of the volume and increase its length considerably. However, I have tried to provide an extensive collection of examples to arouse the reader's interest in applications, as well as sufficient citations to allow the interested reader to locate them. For the reader's convenience, an index to these citations is given at the end of the book .

The purpose of the book is to take stock of the situation concerning Algebra via Category Theory in the last fifteen years, where the new and synthetic notions of Mal'cev, protomodular, homological and semi-abelian categories emerged. These notions force attention on the fibration of points and allow a unified treatment of the main algebraic: homological lemmas, Noether isomorphisms, commutator theory.
The book gives full importance to examples and makes strong connections with Universal Algebra. One of its aims is to allow appreciating how productive the essential categorical constraint is: knowing an object, not from inside via its elements, but from outside via its relations with its environment.
The book is intended to be a powerful tool in the hands of researchers in category theory, homology theory and universal algebra, as well as a textbook for graduate courses on these topics.

Poland has played an enormous role in the development of mathematical logic. Leading Polish logicians, like Lesniewski, Lukasiewicz and Tarski, produced several works related to philosophical logic, a field covering different topics relevant to philosophical foundations of logic itself, as well as various individual sciences. This collection presents contemporary Polish work in philosophical logic which in many respects continue the Polish way of doing philosophical logic. This book will be of interest to logicians, mathematicians, philosophers, and linguists.

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

We are invited to deal with mathematical activity in a sys tematic way [ ... ] one does expect and look for pleasant surprises in this requirement of a novel combination of psy chology, logic, mathematics and technology. Hao Wang, 1970, quoted from(Wang, 1970). The field of mathematics has been a key application area for automated theorem proving from the start, in fact the very first automatically found the orem was that the sum of two even numbers is even (Davis, 1983). The field of automated deduction has witnessed considerable progress and in the last decade, automated deduction methods have made their way into many areas of research and product development in computer science. For instance, deduction systems are increasingly used in software and hardware verification to ensure the correctness of computer hardware and computer programs with respect to a given specification. Logic programming, while still falling somewhat short of its expectations, is now widely used, deduc tive databases are well-developed and logic-based description and analysis of hard-and software is commonplace today.

This book develops a philosophical and logical interpretation of the concept of information within the formal structure of Constructive Type Theory (CTT), in a manner concurrent with a diverse range of contemporary perspectives on the philosophy of information. It presents a newly formulated and conceptually developed presentation of the Problem of Analyticity, and a new interesting perspective on the constructive interpretation of knowledge processes.

Held December 16-919, 1999, this proceedings is derived from the Global Foundation Inc.'s Orbis Scientiae 1999. Topics include: cosmological parameters, unifying elementary particle physics, cosmology, superstrings, and black holes.

The algorithmic solution of problems has always been one of the major concerns of mathematics. For a long time such solutions were based on an intuitive notion of algorithm. It is only in this century that metamathematical problems have led to the intensive search for a precise and sufficiently general formalization of the notions of computability and algorithm. In the 1930s, a number of quite different concepts for this purpose were pro posed, such as Turing machines, WHILE-programs, recursive functions, Markov algorithms, and Thue systems. All these concepts turned out to be equivalent, a fact summarized in Church's thesis, which says that the resulting definitions form an adequate formalization of the intuitive notion of computability. This had and continues to have an enormous effect. First of all, with these notions it has been possible to prove that various problems are algorithmically unsolvable. Among of group these undecidable problems are the halting problem, the word problem theory, the Post correspondence problem, and Hilbert's tenth problem. Secondly, concepts like Turing machines and WHILE-programs had a strong influence on the development of the first computers and programming languages. In the era of digital computers, the question of finding efficient solutions to algorithmically solvable problems has become increasingly important. In addition, the fact that some problems can be solved very efficiently, while others seem to defy all attempts to find an efficient solution, has called for a deeper under standing of the intrinsic computational difficulty of problems."

The present book is a monograph including some recent results of mea sure and integration theory. It concerns three main ideas. The first idea deals with some ordering structures such as Riesz spaces and lattice or dered groups, and their relation to measure and integration theory. The second is the idea of fuzzy sets, quite new in general, and in measure theory particularly. The third area concerns some models of quantum mechanical systems. We study mainly models based on fuzzy set theory. Some recent results are systematically presented along with our suggestions for further development. The first chapter has an introductory character, where we present basic definitions and notations. Simultaneously, this chapter can be regarded as an elementary introduction to fuzzy set theory. Chapter 2 contains an original approach to the convergence of sequences of measurable functions. While the notion of a null set can be determined uniquely, the notion of a set of "small" measure has a fuzzy character. It is interesting that the notion of fuzzy set and the notion of a set of small measure (described mathematically by so-called small systems) were introduced independently at almost the same time. Although the axiomatic systems in both theories mentioned are quite different, we show that the notion of a small system can be considered from the point of view of fuzzy sets."

Recursive Functions and Metamathematics deals with problems of the completeness and decidability of theories, using as its main tool the theory of recursive functions. This theory is first introduced and discussed. Then G del's incompleteness theorems are presented, together with generalizations, strengthenings, and the decidability theory. The book also considers the historical and philosophical context of these issues and their philosophical and methodological consequences. Recent results and trends have been included, such as undecidable sentences of mathematical content, reverse mathematics. All the main results are presented in detail. The book is self-contained and presupposes only some knowledge of elementary mathematical logic. There is an extensive bibliography. Readership: Scholars and advanced students of logic, mathematics, philosophy of science.

This is a monograph about logic. Specifically, it presents the mathe matical theory of the logic of bunched implications, BI: I consider Bl's proof theory, model theory and computation theory. However, the mono graph is also about informatics in a sense which I explain. Specifically, it is about mathematical models of resources and logics for reasoning about resources. I begin with an introduction which presents my (background) view of logic from the point of view of informatics, paying particular attention to three logical topics which have arisen from the development of logic within informatics: * Resources as a basis for semantics; * Proof-search as a basis for reasoning; and * The theory of representation of object-logics in a meta-logic. The ensuing development represents a logical theory which draws upon the mathematical, philosophical and computational aspects of logic. Part I presents the logical theory of propositional BI, together with a computational interpretation. Part II presents a corresponding devel opment for predicate BI. In both parts, I develop proof-, model- and type-theoretic analyses. I also provide semantically-motivated compu tational perspectives, so beginning a mathematical theory of resources. I have not included any analysis, beyond conjecture, of properties such as decidability, finite models, games or complexity. I prefer to leave these matters to other occasions, perhaps in broader contexts.

This book contains the papers developing out the presentations given at the International Conference organized by the Torino Academy of Sciences and the Department of Mathematics Giuseppe Peano of the Torino University to celebrate the 150th anniversary of G. Peano's birth - one of the greatest figures in modern mathematics and logic and the most important mathematical logician in Italy - a century after the publication of Formulario Mathematico, a great attempt to systematise Mathematics in symbolic form.

Steven Finch provides 136 essays, each devoted to a mathematical constant or a class of constants, from the well known to the highly exotic. This book is helpful both to readers seeking information about a specific constant, and to readers who desire a panoramic view of all constants coming from a particular field, for example, combinatorial enumeration or geometric optimization. Unsolved problems appear virtually everywhere as well. This work represents a scholarly attempt to bring together all significant mathematical constants in one place.

From the very beginning of their investigation of human reasoning, philosophers have identified two other forms of reasoning, besides deduction, which we now call abduction and induction. Deduction is now fairly well understood, but abduction and induction have eluded a similar level of understanding. The papers collected here address the relationship between abduction and induction and their possible integration. The approach is sometimes philosophical, sometimes that of pure logic, and some papers adopt the more task-oriented approach of AI. The book will command the attention of philosophers, logicians, AI researchers and computer scientists in general.

Arising from the 1996 Cape Town conference in honour of the mathematician Bernhard Banaschewski, this collection of 30 refereed papers represents current developments in category theory, topology, topos theory, universal algebra, model theory, and diverse ordered and algebraic structures. Banaschewski's influence is reflected here, particularly in the contributions to pointfree topology at the levels of nearness, uniformity, and asymmetry. The unifying theme of the volume is the application of categorical methods. The contributing authors are: D. Baboolar, P. Bankston, R. Betti, D. Bourn, P. Cherenack, D. Dikranjan/H.-P. Kunzi, X. Dong/W. Tholen, M. Erne, T.H. Fay, T.H. Fay/S.V. Joubert, D.N. Georgiou/B.K. Papadopoulos, K.A. Hardie/K.H. Kamps/R.W. Kieboom, H. Herrlich/A. Pultr, K.M. Hofmann, S.S. Hong/Y.K. Kim, J. Isbell, R. Jayewardene/O. Wyler, P. Johnstone, R. Lowen/P. Wuyts, E. Lowen-Colebunders/C. Verbeeck, R. Nailana, J. Picado, T. Plewe, J. Reinhold, G. Richter, H. Rorl, S.-H. Sun, Tozzi/V. Trnkova, V. Valov/D. Vuma, and S. Veldsman. Audience: This volume will be of interest to mathematicians whose research involves category theory and its applications to topology, order, and algebra.