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.

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

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.

This book is based on lectures delivered at Harvard in the Spring of 1991 and at the University of Utah during the academic year 1992-93. Formally, the book assumes only general algebraic knowledge (rings, modules, groups, Lie algebras, functors etc.). It is helpful, however, to know some basics of algebraic geometry and representation theory. Each chapter begins with its own introduction, and most sections even have a short overview. The purpose of what follows is to explain the spirit of the book and how different parts are linked together without entering into details. The point of departure is the notion of the left spectrum of an associative ring, and the first natural steps of general theory of noncommutative affine, quasi-affine, and projective schemes. This material is presented in Chapter I. Further developments originated from the requirements of several important examples I tried to understand, to begin with the first Weyl algebra and the quantum plane. The book reflects these developments as I worked them out in reallife and in my lectures. In Chapter 11, we study the left spectrum and irreducible representations of a whole lot of rings which are of interest for modern mathematical physics. The dasses of rings we consider indude as special cases: quantum plane, algebra of q-differential operators, (quantum) Heisenberg and Weyl algebras, (quantum) enveloping algebra ofthe Lie algebra sl(2) , coordinate algebra of the quantum group SL(2), the twisted SL(2) of Woronowicz, so called dispin algebra and many others.

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

Emphasizes the computer science aspects of the subject.

Details applications in databases, complexity theory, and formal languages, as well as other branches of computer science.

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

Many-valued logics were developed as an attempt to handle philosophical doubts about the "law of excluded middle" in classical logic. The first many-valued formal systems were developed by J. Lukasiewicz in Poland and E.Post in the U.S.A. in the 1920s, and since then the field has expanded dramatically as the applicability of the systems to other philosophical and semantic problems was recognized. Intuitionisticlogic, for example, arose from deep problems in the foundations of mathematics. Fuzzy logics, approximation logics, and probability logics all address questions that classical logic alone cannot answer. All these interpretations of many-valued calculi motivate specific formal systems thatallow detailed mathematical treatment. In this volume, the authors are concerned with finite-valued logics, and especially with three-valued logical calculi. Matrix constructions, axiomatizations of propositional and predicate calculi, syntax, semantic structures, and methodology are discussed. Separate chapters deal with intuitionistic logic, fuzzy logics, approximation logics, and probability logics. These systems all find application in practice, in automatic inference processes, which have been decisive for the intensive development of these logics. This volume acquaints the reader with theoretical fundamentals of many-valued logics. It is intended to be the first of a two-volume work. The second volume will deal with practical applications and methods of automated reasoning using many-valued logics.

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

This second volume of this text covers the classical aspects of the theory of groups and their representations. It also offers a general introduction to the modern theory of representations including the representations of quivers and finite partially ordered sets and their applications to finite dimensional algebras. It reviews key recent developments in the theory of special ring classes including Frobenius, quasi-Frobenius, and others.

"In the mathematics I can report no deficience, except that it be that men do not sufficiently understand the excellent use of the pure mathematics, in that they do remedy and cure many defects in the wit and faculties intellectual. For if the wit be too dull, they sharpen it; if too wandering, they fix it; if too inherent in the sense, they abstract it. " Roger Bacon (1214?-1294?) "Mathematics-the art and science of effective reasoning. " E. W. Dijkstra, 1976 "A person who had studied at a good mathematical school can do anything. " Ye. Bunimovich, 2000 This is the third book published by Kluwer based on the very successful OOPSLA workshops on behavioral semantics (the first two books were published in 1996 [KH 1996] and 1999 [KRS 1999]). These workshops fostered precise and explicit specifications of business and system semantics, independently of any (possible) realization. Some progress has been made in these areas, both in academia and in industry. At the same time, in too many cases only lip service to elegant specifica tions of semantics has been provided, and as a result the systems we build or buy are all too often not what they are supposed to be. We used to live with that, and quite often users relied on human intermediaries to "sort the things out. " This approach worked perfectly well for a long time.

These notes were first used in an introductory course team taught by the authors at Appalachian State University to advanced undergraduates and beginning graduates. The text was written with four pedagogical goals in mind: offer a variety of topics in one course, get to the main themes and tools as efficiently as possible, show the relationships between the different topics, and include recent results to convince students that mathematics is a living discipline.

In the last years, it was observed an increasing interest of computer scientists in the structure of biological molecules and the way how they can be manipulated in vitro in order to define theoretical models of computation based on genetic engineering tools. Along the same lines, a parallel interest is growing regarding the process of evolution of living organisms. Much of the current data for genomes are expressed in the form of maps which are now becoming available and permit the study of the evolution of organisms at the scale of genome for the first time. On the other hand, there is an active trend nowadays throughout the field of computational biology toward abstracted, hierarchical views of biological sequences, which is very much in the spirit of computational linguistics. In the last decades, results and methods in the field of formal language theory that might be applied to the description of biological sequences were pointed out.

This reference work deals with important topics in general topology and their role in functional analysis and axiomatic set theory, for graduate students and researchers working in topology, functional analysis, set theory and probability theory. It provides a guide to recent research findings, with three contributions by Arhangel'skii and Choban.

During the past 25 years, set theory has developed in several interesting directions. The most outstanding results cover the application of sophisticated techniques to problems in analysis, topology, infinitary combinatorics and other areas of mathematics. This book contains a selection of contributions, some of which are expository in nature, embracing various aspects of the latest developments. Amongst topics treated are forcing axioms and their applications, combinatorial principles used to construct models, and a variety of other set theoretical tools including inner models, partitions and trees. Audience: This book will be of interest to graduate students and researchers in foundational problems of mathematics.

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.

Graham Solomon, to whom this collection is dedicated, went into hospital for antibiotic treatment of pneumonia in Oc- ber, 2001. Three days later, on Nov. 1, he died of a massive stroke, at the age of 44. Solomon was well liked by those who got the chance to know him-it was a revelation to ?nd out, when helping to sort out his a?airs after his death, how many "friends" he had whom he had actually never met, as his email included correspondence with philosophers around the world running sometimes to hundreds of messages. He was well respected in the philosophical community more broadly. He was for several years a member of the editorial board for the Western Ontario Series in Philosophy of Science. While he was employed at Wilfrid Laurier University in Waterloo, Ontario, several of us at the University of Wat- loo always regarded our own department as a sort of second academic home for him. We therefore decided that it would be appropriate to hold a memorial conference in his honour. Thanks to the generous ?nancial support of the Humphrey Conference Fund, we were able to do so in May 2003. Many of the papers in this volume were presented at that conf- ence.

The theory of formal languages is widely accepted as the backbone of t- oretical computer science. It mainly originated from mathematics (com- natorics, algebra, mathematical logic) and generative linguistics. Later, new specializations emerged from areas ofeither computer science(concurrent and distributed systems, computer graphics, arti?cial life), biology (plant devel- ment, molecular genetics), linguistics (parsing, text searching), or mathem- ics (cryptography). All human problem solving capabilities can be considered, in a certain sense, as a manipulation of symbols and structures composed by symbols, which is actually the stem of formal language theory. Language - in its two basic forms, natural and arti?cial - is a particular case of a symbol system. This wide range of motivations and inspirations explains the diverse - plicability of formal language theory ? and all these together explain the very large number of monographs and collective volumes dealing with formal language theory. In 2004 Springer-Verlag published the volume Formal Languages and - plications, edited by C. Martin-Vide, V. Mitrana and G. P?un in the series Studies in Fuzziness and Soft Computing 148, which was aimed at serving as an overall course-aid and self-study material especially for PhD students in formal language theory and applications. Actually, the volume emerged in such a context: it contains the core information from many of the lectures - livered to the students of the International PhD School in Formal Languages and Applications organized since 2002 by the Research Group on Mathem- ical Linguistics from Rovira i Virgili University, Tarragona, Spain."

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.

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 monograph details several important advances in the direction of a practical proofs-as-programs paradigm, which constitutes a set of approaches to developing programs from proofs in constructive logic with applications to industrial-scale, complex software engineering problems. One of the books central themes is a general, abstract framework for developing new systems of programs synthesis by adapting proofs-as-programs to new contexts.

Based on several recent courses given to mathematical physics students, this volume is an introduction to bundle theory. It aims to provide newcomers to the field with solid foundations in topological K-theory. A fundamental theme, emphasized in the book, centers around the gluing of local bundle data related to bundles into a global object. One renewed motivation for studying this subject, comes from quantum field theory, where topological invariants play an important role.

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

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.

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.