The Institute Vienna Circle held a conference in Vienna in 2003, Cambridge and Vienna Frank P. Ramsey and the Vienna Circle, to commemorate the philosophical and scientific work of Frank Plumpton Ramsey (1903 1930). This Ramsey conference provided not only historical and biographical perspectives on one of the most gifted thinkers of the Twentieth Century, but also new impulses for further research on at least some of the topics pioneered by Ramsey, whose interest and potential are greater than ever.

Ramsey did pioneering work in several fields, practitioners of which rarely know of his important work in other fields: philosophy of logic and theory of language, foundations of mathematics, mathematics, probability theory, methodology of science, philosophy of psychology, and economics. There was a focus on the one topic which was of strongest mutual concern to Ramsey and the Vienna Circle, namely the question of foundations of mathematics, in particular the status of logicism.

Although the major scientific connection linking Ramsey with Austria is his work on logic, to which the Vienna Circle dedicated several meetings, certainly the connection which is of greater general interest concerns Ramsey's visits and discussions with Wittgenstein. Ramsey was the only important thinker to actually visit Wittgenstein during his school-teaching career in Puchberg and Ottertal in the 1920s, in Lower Austria; and later, Ramsey was instrumental in getting Wittgenstein positions at Cambridge. "

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.

This textbook prepares graduate students for research in numerical analysis/computational mathematics by giving to them a mathematical framework embedded in functional analysis and focused on numerical analysis. This helps the student to move rapidly into a research program. The text covers basic results of functional analysis, approximation theory, Fourier analysis and wavelets, iteration methods for nonlinear equations, finite difference methods, Sobolev spaces and weak formulations of boundary value problems, finite element methods, elliptic variational inequalities and their numerical solution, numerical methods for solving integral equations of the second kind, and boundary integral equations for planar regions. The presentation of each topic is meant to be an introduction with certain degree of depth. Comprehensive references on a particular topic are listed at the end of each chapter for further reading and study.

Because of the relevance in solving real world problems, multivariable polynomials are playing an ever more important role in research and applications. In this third editon, a new chapter on this topic has been included and some major changes are made on two chapters from the previous edition. In addition, there are numerous minor changes throughout the entire text and new exercises are added.

Review of earlier edition:

..".the book is clearly written, quite pleasant to read, and contains a lot of important material; and the authors have done an excellent job at balancing theoretical developments, interesting examples and exercises, numerical experiments, and bibliographical references."

R. Glowinski, SIAM Review, 2003

The thirty-one papers collected in this volume represent most of the arti cles that I have published in the philosophy of science and related founda tional areas of science since 1970. The present volume is a natural succes sor to Studies in the Methodology and Foundations of Science, a collection of my articles published in 1969 by Reidel (now a part of Kluwer). The articles are arranged under five main headings. Part I contains six articles on general methodology. The topics range from formal methods to the plurality of science. Part II contains six articles on causality and explanation. The emphasis is almost entirely on probabilistic approaches. Part III contains six articles on probability and measurement. The impor tance of representation theorems for both probability and measurement is stressed. Part IV contains five articles on the foundations of physics. The first three articles are concerned with action at a distance and space and time, the last two with quantum mechanics. Part V contains eight articles on the foundations of psychology. This is the longest part and the articles reflect my continuing strong interest in the nature of learning and perception. Within each part the articles are arranged chronologically. I turn now to a more detailed overview of the content. The first article of Part I concerns the role of formal methods in the philosophy of science. Here I discuss what is the new role for formal methods now that the imperialism of logical positivism has disappeared."

The larger part of Yearbook 6 of the Institute Vienna Circle constitutes the proceedings of a symposium on Alfred Tarski and his influence on and interchanges with the Vienna Circle, especially those on and with Rudolf Carnap and Kurt Goedel. It is the first time that this topic has been treated on such a scale and in such depth. Attention is mainly paid to the origins, development and subsequent role of Tarski's definition of truth. Some contributions are primarily historical, others analyze logical aspects of the concept of truth. Contributors include Anita and Saul Feferman, Jan Wolenski, Jan Tarski and Hans Sluga. Several Polish logicians contributed: Gzegorczyk, Wojcicki, Murawski and Rojszczak. The volume presents entirely new biographical material on Tarski, both from his Polish period and on his influential career in the United States: at Harvard, in Princeton, at Hunter, and at the University of California at Berkeley. The high point of the analysis involves Tarski's influence on Carnap's evolution from a narrow syntactical view of language, to the ontologically more sophisticated but more controversial semantical view. Another highlight involves the interchange between Tarski and Goedel on the connection between truth and proof and on the nature of metalanguages. The concluding part of Yearbook 6 includes documentation, book reviews and a summary of current activities of the Institute Vienna Circle. Jan Tarski introduces letters written by his father to Goedel; Paolo Parrini reports on the Vienna Circle's influence in Italy; several reviews cover recent books on logical empiricism, on Goedel, on cosmology, on holistic approaches in Germany, and on Mauthner.

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.

Intensional logic has emerged, since the 1960' s, as a powerful theoretical and practical tool in such diverse disciplines as computer science, artificial intelligence, linguistics, philosophy and even the foundations of mathematics. The present volume is a collection of carefully chosen papers, giving the reader a taste of the frontline state of research in intensional logics today. Most papers are representative of new ideas and/or new research themes. The collection would benefit the researcher as well as the student. This book is a most welcome addition to our series. The Editors CONTENTS PREFACE IX JOHAN VAN BENTHEM AND NATASHA ALECHINA Modal Quantification over Structured Domains PATRICK BLACKBURN AND WILFRIED MEYER-VIOL Modal Logic and Model-Theoretic Syntax 29 RUY J. G. B. DE QUEIROZ AND DOV M. GABBAY The Functional Interpretation of Modal Necessity 61 VLADIMIR V. RYBAKOV Logics of Schemes for First-Order Theories and Poly-Modal Propositional Logic 93 JERRY SELIGMAN The Logic of Correct Description 107 DIMITER VAKARELOV Modal Logics of Arrows 137 HEINRICH WANSING A Full-Circle Theorem for Simple Tense Logic 173 MICHAEL ZAKHARYASCHEV Canonical Formulas for Modal and Superintuitionistic Logics: A Short Outline 195 EDWARD N. ZALTA 249 The Modal Object Calculus and its Interpretation NAME INDEX 281 SUBJECT INDEX 285 PREFACE Intensional logic has many faces. In this preface we identify some prominent ones without aiming at completeness.

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

Dynamic Fuzzy Pattern Recognition with Applications to Finance and Engineering focuses on fuzzy clustering methods which have proven to be very powerful in pattern recognition and considers the entire process of dynamic pattern recognition. This book sets a general framework for Dynamic Pattern Recognition, describing in detail the monitoring process using fuzzy tools and the adaptation process in which the classifiers have to be adapted, using the observations of the dynamic process. It then focuses on the problem of a changing cluster structure (new clusters, merging of clusters, splitting of clusters and the detection of gradual changes in the cluster structure). Finally, the book integrates these parts into a complete algorithm for dynamic fuzzy classifier design and classification.

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.

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

The aim of this book is to give self-contained proofs of all basic results concerning the infinite-valued proposition al calculus of Lukasiewicz and its algebras, Chang's MV -algebras. This book is for self-study: with the possible exception of Chapter 9 on advanced topics, the only prere- quisite for the reader is some acquaintance with classical propositional logic, and elementary algebra and topology. In this book it is not our aim to give an account of Lukasiewicz's motivations for adding new truth values: readers interested in this topic will find appropriate references in Chapter 10. Also, we shall not explain why Lukasiewicz infinite-valued propositionallogic is a ba- sic ingredient of any logical treatment of imprecise notions: Hajek's book in this series on Trends in Logic contains the most authorita- tive explanations. However, in order to show that MV-algebras stand to infinite-valued logic as boolean algebras stand to two-valued logic, we shall devote Chapter 5 to Ulam's game of Twenty Questions with lies/errors, as a natural context where infinite-valued propositions, con- nectives and inferences are used. While several other semantics for infinite-valued logic are known in the literature-notably Giles' game- theoretic semantics based on subjective probabilities-still the transi- tion from two-valued to many-valued propositonallogic can hardly be modelled by anything simpler than the transformation of the familiar game of Twenty Questions into Ulam game with lies/errors.

During the last few decades the ideas, methods, and results of the theory of Boolean algebras have played an increasing role in various branches of mathematics and cybernetics. This monograph is devoted to the fundamentals of the theory of Boolean constructions in universal algebra. Also considered are the problems of presenting different varieties of universal algebra with these constructions, and applications for investigating the spectra and skeletons of varieties of universal algebras. For researchers whose work involves universal algebra and logic.

On the history of the book: In the early 1990s several new methods and perspectives in au- mated deduction emerged. We just mention the superposition calculus, meta-term inference and schematization, deductive decision procedures, and automated model building. It was this last ?eld which brought the authors of this book together. In 1994 they met at the Conference on Automated Deduction (CADE-12) in Nancy and agreed upon the general point of view, that semantics and, in particular, construction of models should play a central role in the ?eld of automated deduction. In the following years the deduction groups of the laboratory LEIBNIZ at IMAG Grenoble and the University of Technology in Vienna organized several bilateral projects promoting this topic. This book emerged as a main result of this cooperation. The authors are aware of the fact, that the book does not cover all relevant methods of automated model building (also called model construction or model generation); instead the book focuses on deduction-based symbolic methods for the construction of Herbrand models developed in the last 12 years. Other methods of automated model building, in particular also ?nite model building, are mainly treated in the ?nal chapter; this chapter is less formal and detailed but gives a broader view on the topic and a comparison of di?erent approaches. Howtoreadthisbook: In the introduction we give an overview of automated deduction in a historical context, taking into account its relationship with the human views on formal and informal proofs.

The notion of complexity is an important contribution of logic to theoretical computer science and mathematics. This volume attempts to approach complexity in a holistic way, investigating mathematical properties of complexity hierarchies at the same time as discussing algorithms and computational properties. A main focus of the volume is on some of the new paradigms of computation, among them Quantum Computing and Infinitary Computation. The papers in the volume are tied together by an introductory article describing abstract properties of complexity hierarchies.

This volume will be of great interest to both mathematical logicians and theoretical computer scientists, providing them with new insights into the various views of complexity and thus shedding new light on their own research.

This volume summarizes recent developments in the topological and algebraic structures in fuzzy sets and may be rightly viewed as a continuation of the stan dardization of the mathematics of fuzzy sets established in the "Handbook," namely the Mathematics of Fuzzy Sets: Logic, Topology, and Measure Theory, Volume 3 of The Handbooks of Fuzzy Sets Series (Kluwer Academic Publish ers, 1999). Many of the topological chapters of the present work are not only based upon the foundations and notation for topology laid down in the Hand book, but also upon Handbook developments in convergence, uniform spaces, compactness, separation axioms, and canonical examples; and thus this work is, with respect to topology, a continuation of the standardization of the Hand book. At the same time, this work significantly complements the Handbook in regard to algebraic structures. Thus the present volume is an extension of the content and role of the Handbook as a reference work. On the other hand, this volume, even as the Handbook, is a culmination of mathematical developments motivated by the renowned International Sem inar on Fuzzy Set Theory, also known as the Linz Seminar, held annually in Linz, Austria. Much of the material of this volume is related to the Twenti eth Seminar held in February 1999, material for which the Seminar played a crucial and stimulating role, especially in providing feedback, connections, and the necessary screening of ideas."

A basic problem for the interconnection of communications media is to design interconnection networks for specific needs. For example, to minimize delay and to maximize reliability, networks are required that have minimum diameter and maximum connectivity under certain conditions. The book provides a recent solution to this problem. The subject of all five chapters is the interconnection problem. The first two chapters deal with Cayley digraphs which are candidates for networks of maximum connectivity with given degree and number of nodes. Chapter 3 addresses Bruijn digraphs, Kautz digraphs, and their generalizations, which are candidates for networks of minimum diameter and maximum connectivity with given degree and number of nodes. Chapter 4 studies double loop networks, and Chapter 5 considers broadcasting and the Gossiping problem. All the chapters emphasize the combinatorial aspects of network theory. Audience: A vital reference for graduate students and researchers in applied mathematics and theoretical computer science.

In the last two decades modal logic has undergone an explosive growth, to thepointthatacompletebibliographyofthisbranchoflogic, supposingthat someone were capable to compile it, would ?ll itself a ponderous volume. What is impressive in the growth of modal logic has not been so much the quick accumulation of results but the richness of its thematic dev- opments. In the 1960s, when Kripke semantics gave new credibility to the logic of modalities? which was already known and appreciated in the Ancient and Medieval times? no one could have foreseen that in a short time modal logic would become a lively source of ideas and methods for analytical philosophers, historians of philosophy, linguists, epistemologists and computer scientists. The aim which oriented the composition of this book was not to write a new manual of modal logic (there are a lot of excellent textbooks on the market, and the expert reader will realize how much we bene?ted from manyofthem)buttoo?ertoeveryreader, evenwithnospeci?cbackground in logic, a conceptually linear path in the labyrinth of the current panorama of modal logic. The notion which in our opinion looked suitable to work as a compass in this enterprise was the notion of multimodality, or, more speci?cally, the basic idea of grounding systems on languages admitting more than one primitive modal opera

Assumes only a familiarity with algebra at the beginning graduate level; Stresses applications to algebra; Illustrates several of the ways Model Theory can be a useful tool in analyzing classical mathematical structures

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.

Homology is a powerful tool used by mathematicians to study the properties of spaces and maps that are insensitive to small perturbations. This book uses a computer to develop a combinatorial computational approach to the subject. The core of the book deals with homology theory and its computation. Following this is a section containing extensions to further developments in algebraic topology, applications to computational dynamics, and applications to image processing. Included are exercises and software that can be used to compute homology groups and maps. The book will appeal to researchers and graduate students in mathematics, computer science, engineering, and nonlinear dynamics.

At the turn of the century, Gottlob Frege and Edmund Husserl both participated in the discussion concerning the foundations of logic and mathematics. Since the 1960s, comparisons have been made between Frege's semantic views and Husserl's theory of intentional acts. In quite recent years, new approaches to the two philosophers' views have appeared. This collection of articles opens with the first English translation of Dagfinn Follesdal's early classic on Husserl and Frege of 1958. The book brings together a number of new contributions by well-known authors and gives a survey of recent developments in the field. It shows that Husserl's thought is coming to occupy a central role in the philosophy of logic and mathematics, as well as in the philosophy of mind and cognitive science. The work is primarily meant for philosophers, especially for those working on the problems of language, logic, mathematics, and mind. It can also be used as a textbook in advanced courses in philosophy. "

hiS volume in the Synthese Library Series is the result of a conference T held at the University of Roskilde, Denmark, October 31st-November 1st, 1997. The aim was to provide a forum within which philosophers, math ematicians, logicians and historians of mathematics could exchange ideas pertaining to the historical and philosophical development of proof theory. Hence the conference was called Proof Theory: History and Philosophical Significance. To quote from the conference abstract: Proof theory was developed as part of Hilberts Programme. According to Hilberts Programme one could provide mathematics with a firm and se cure foundation by formalizing all of mathematics and subsequently prove consistency of these formal systems by finitistic means. Hence proof theory was developed as a formal tool through which this goal should be fulfilled. It is well known that Hilbert's Programme in its original form was unfeasible mainly due to Gtldel's incompleteness theorems. Additionally it proved impossible to formalize all of mathematics and impossible to even prove the consistency of relatively simple formalized fragments of mathematics by finitistic methods. In spite of these problems, Gentzen showed that by extending Hilbert's proof theory it would be possible to prove the consistency of interesting formal systems, perhaps not by finitis tic methods but still by methods of minimal strength. This generalization of Hilbert's original programme has fueled modern proof theory which is a rich part of mathematical logic with many significant implications for the philosophy of mathematics."

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