This book constitutes the proceedings of the 12th Biennial Meeting on Mathematics in Language, MOL 12, held in Nara, Japan, in September 2011.

Presented in this volume are 12 carefully selected papers, as well as the paper of the invited speaker Andreas Maletti. The papers cover such diverse topics as formal languages (string and tree transducers, grammar-independent syntactic structures, probabilistic and weighted context-free grammars, formalization of minimalist syntax), parsing and unification, lexical and compositional semantics, statistical language models, and theories of truth.

This work introduces tools, from the field of category theory, that make it possible to tackle until now unsolvable representation problems (determination of the range of a given functor). The basic idea is: if a functor lifts many objects, then it also lifts many (poset-indexed) diagrams.

The main idea of statistical convergence is to demand convergence only for a majority of elements of a sequence. This method of convergence has been investigated in many fundamental areas of mathematics such as: measure theory, approximation theory, fuzzy logic theory, summability theory, and so on. In this monograph we consider this concept in approximating a function by linear operators, especially when the classical limit fails. The results of this book not only cover the classical and statistical approximation theory, but also are applied in the fuzzy logic via the fuzzy-valued operators. The authors in particular treat the important Korovkin approximation theory of positive linear operators in statistical and fuzzy sense. They also present various statistical approximation theorems for some specific real and complex-valued linear operators that are not positive. This is the first monograph in Statistical Approximation Theory and Fuzziness. The chapters are self-contained and several advanced courses can be taught. The research findings will be useful in various applications including applied and computational mathematics, stochastics, engineering, artificial intelligence, vision and machine learning. This monograph is directed to graduate students, researchers, practitioners and professors of all disciplines.

This book, suitable for interested post-16 school pupils or undergraduates looking for a supplement to their course text, develops our modern view of space-time and its implications in the theories of gravity and cosmology. While aspects of this topic are inevitably abstract, the book seeks to ground thinking in observational and experimental evidence where possible. In addition, some of Einstein's philosophical thoughts are explored and contrasted with our modern views. Written in an accessible yet rigorous style, Jonathan Allday, a highly accomplished writer, brings his trademark clarity and engagement to these fascinating subjects, which underpin so much of modern physics. Features: Restricted use of advanced mathematics, making the book suitable for post-16 students and undergraduates Contains discussions of key modern developments in quantum gravity, and the latest developments in the field, including results from the Laser Interferometer Gravitational-Wave Observatory (LIGO) Accompanied by appendices on the CRC Press website featuring detailed mathematical arguments for key derivations

This is a continuation of Vol. 7 of Trends in Logic. It wil cover the wealth of recent developments of Lukasiewicz Logic and their algebras (Chang MV-algebras), with particular reference to (de Finetti) coherent evaluation of continuously valued events, (Renyi) conditionals for such events, related algorithms.

This book constitutes the refereed proceedings of the 7th Conference on Computability in Europe, CiE 2011, held in Sofia, Bulgaria, in June/July 2011. The 22 revised papers presented together with 11 invited lectures were carefully reviewed and selected with an acceptance rate of under 40%. The papers cover the topics computability in analysis, algebra, and geometry; classical computability theory; natural computing; relations between the physical world and formal models of computability; theory of transfinite computations; and computational linguistics.

This monograph treats the theory of Dirichlet forms from a comprehensive point of view, using "nonstandard analysis." Thus, it is close in spirit to the discrete classical formulation of Dirichlet space theory by Beurling and Deny (1958). The discrete infinitesimal setup makes it possible to study the diffusion and the jump part using essentially the same methods. This setting has the advantage of being independent of special topological properties of the state space and in this sense is a natural one, valid for both finite- and infinite-dimensional spaces.
The present monograph provides a thorough treatment of the symmetric as well as the non-symmetric case, surveys the theory of hyperfinite Levy processes, and summarizes in an epilogue the model-theoretic genericity of hyperfinite stochastic processes theory.

Intuitionistic type theory can be described, somewhat boldly, as a partial fulfillment of the dream of a universal language for science. This book expounds several aspects of intuitionistic type theory, such as the notion of set, reference vs. computation, assumption, and substitution. Moreover, the book includes philosophically relevant sections on the principle of compositionality, lingua characteristica, epistemology, propositional logic, intuitionism, and the law of excluded middle. Ample historical references are given throughout the book.

This book constitutes the refereed proceedings of the 10th International Conference on Typed Lambda Calculi and Applications, TLCA 2011, held in Novi Sad, Serbia, in June 2011 as part of RDP 2011, the 6th Federated Conference on Rewriting, Deduction, and Programming. The 15 revised full papers presented were carefully reviewed and selected from 44 submissions. The papers provide prevailing research results on all current aspects of typed lambda calculi, ranging from theoretical and methodological issues to applications in various contexts addressing a wide variety of topics such as proof-theory, semantics, implementation, types, and programming.

Written by two well-known scholars in the field, Combinatorial Reasoning: An Introduction to the Art of Counting presents a clear and comprehensive introduction to the concepts and methodology of beginning combinatorics. Focusing on modern techniques and applications, the book develops a variety of effective approaches to solving counting problems. Balancing abstract ideas with specific topical coverage, the book utilizes real world examples with problems ranging from basic calculations that are designed to develop fundamental concepts to more challenging exercises that allow for a deeper exploration of complex combinatorial situations. Simple cases are treated first before moving on to general and more advanced cases. Additional features of the book include: Approximately 700 carefully structured problems designed for readers at multiple levels, many with hints and/or short answers Numerous examples that illustrate problem solving using both combinatorial reasoning and sophisticated algorithmic methods A novel approach to the study of recurrence sequences, which simplifies many proofs and calculations Concrete examples and diagrams interspersed throughout to further aid comprehension of abstract concepts A chapter-by-chapter review to clarify the most crucial concepts covered Combinatorial Reasoning: An Introduction to the Art of Counting is an excellent textbook for upper-undergraduate and beginning graduate-level courses on introductory combinatorics and discrete mathematics.

Algebra has moved well beyond the topics discussed in standard undergraduate texts on 'modern algebra'. Those books typically dealt with algebraic structures such as groups, rings and fields: still very important concepts! However Quantum Groups: A Path to Current Algebra is written for the reader at ease with at least one such structure and keen to learn the latest algebraic concepts and techniques. A key to understanding these new developments is categorical duality. A quantum group is a vector space with structure. Part of the structure is standard: a multiplication making it an 'algebra'. Another part is not in those standard books at all: a comultiplication, which is dual to multiplication in the precise sense of category theory, making it a 'coalgebra'. While coalgebras, bialgebras and Hopf algebras have been around for half a century, the term 'quantum group', along with revolutionary new examples, was launched by Drinfel'd in 1986.

Semiring theory stands with a foot in each of two mathematical domains. The first being abstract algebra and the other the fields of applied mathematics such as optimization theory, the theory of discrete-event dynamical systems, automata theory, and formal language theory, as well as from the allied areas of theoretical computer science and theoretical physics. Most important applications of semiring theory in these areas turn out to revolve around the problem of finding the equalizer of a pair of affine maps between two semimodules. In this volume, we chart the state of the art on solving this problem, and present many specific cases of applications.

This book is essentially the third part of a trilogy, along with Semirings and their Applications, and Power Algebras over Semirings, both written by the same author and published by Kluwer Academic Publishers in 1999. While each book can be read independently of the others, to get the full force of the theory and applications one should have access to all three.

This work will be of interest to academic and industrial researchers and graduate students. The intent of the book is to bring the applications to the attention of the abstract mathematicians and to make the abstract mathematics available to those who are using these tools in an ad-hoc manner without realizing the full force of the theory.

Games, Norms, and Reasons: Logic at the Crossroads provides an overview of modern logic focusing on its relationships with other disciplines, including new interfaces with rational choice theory, epistemology, game theory and informatics. This book continues a series called "Logic at the Crossroads" whose title reflects a view that the deep insights from the classical phase of mathematical logic can form a harmonious mixture with a new, more ambitious research agenda of understanding and enhancing human reasoning and intelligent interaction. The editors have gathered together articles from active authors in this new area that explore dynamic logical aspects of norms, reasons, preferences and beliefs in human agency, human interaction and groups. The book pays a special tribute to Professor Rohit Parikh, a pioneer in this movement.

The book "Foundational Theories of Classical and Constructive Mathematics" is a book on the classical topic of foundations of mathematics. Its originality resides mainly in its treating at the same time foundations of classical and foundations of constructive mathematics. This confrontation of two kinds of foundations contributes to answering questions such as: Are foundations/foundational theories of classical mathematics of a different nature compared to those of constructive mathematics? Do they play the same role for the resp. mathematics? Are there connections between the two kinds of foundational theories? etc. The confrontation and comparison is often implicit and sometimes explicit. Its great advantage is to extend the traditional discussion of the foundations of mathematics and to render it at the same time more subtle and more differentiated. Another important aspect of the book is that some of its contributions are of a more philosophical, others of a more technical nature. This double face is emphasized, since foundations of mathematics is an eminent topic in the philosophy of mathematics: hence both sides of this discipline ought to be and are being paid due to.

Logic networks and automata are facets of digital systems. The change of the design of logic networks from skills and art into a scientific discipline was possible by the development of the underlying mathematical theory called the Switching Theory. The fundamentals of this theory come from the attempts towards an algebraic description of laws of thoughts presented in the works by George J. Boole and the works on logic by Augustus De Morgan. As often the case in engineering, when the importance of a problem and the need for solving it reach certain limits, the solutions are searched by many scholars in different parts of the word, simultaneously or at about the same time, however, quite independently and often unaware of the work by other scholars. The formulation and rise of Switching Theory is such an example. This book presents a brief account of the developments of Switching Theory and highlights some less known facts in the history of it. The readers will find the book a fresh look into the development of the field revealing how difficult it has been to arrive at many of the concepts that we now consider obvious . Researchers in the history or philosophy of computing will find this book a valuable source of information that complements the standard presentations of the topic.

This is the first book on cut-elimination in first-order predicate logic from an algorithmic point of view. Instead of just proving the existence of cut-free proofs, it focuses on the algorithmic methods transforming proofs with arbitrary cuts to proofs with only atomic cuts (atomic cut normal forms, so-called ACNFs). The first part investigates traditional reductive methods from the point of view of proof rewriting. Within this general framework, generalizations of Gentzen's and Sch\"utte-Tait's cut-elimination methods are defined and shown terminating with ACNFs of the original proof. Moreover, a complexity theoretic comparison of Gentzen's and Tait's methods is given.

The core of the book centers around the cut-elimination method CERES (cut elimination by resolution) developed by the authors. CERES is based on the resolution calculus and radically differs from the reductive cut-elimination methods. The book shows that CERES asymptotically outperforms all reductive methods based on Gentzen's cut-reduction rules. It obtains this result by heavy use of subsumption theorems in clause logic. Moreover, several applications of CERES are given (to interpolation, complexity analysis of cut-elimination, generalization of proofs, and to the analysis of real mathematical proofs). Lastly, the book demonstrates that CERES can be extended to nonclassical logics, in particular to finitely-valued logics and to G\"odel logic.

Approach your problems from the right end It isn't that they can't see the solution. It is and begin with the answers. Then one day, that they can't see the problem. perhaps you will find the final question. G. K. Chesterton. The Scandal of Father 'The Hermit Gad in Crane Feathers' in R. Brown'The point of a Pin'. van Gulik's TheChinese Maze Murders. Growing specialization and diversification have brought a host of monographs and textbooks on increasingly specialized topics. However, the "tree" of knowledge of mathematics and related fields does not grow only by putting forth new branches. It also happens, quite often in fact, that branches which were thought to be completely disparate are suddenly seen to be related. Further, the kind and level of sophistication of mathematics applied in various sciences has changed drastically in recent years: measure theory is used (non-trivially) in regional and theoretical economics; algebraic geometry interacts with physics; the Minkowsky lemma, coding theory and the structure of water meet one another in packing and covering theory; quantum fields, crystal defects and mathematical programming profit from homotopy theory; Lie algebras are relevant to filtering; and prediction and electrical engineering can use Stein spaces. And in addition to this there are such new emerging SUbdisciplines as "experimental mathematics," "CFD," "completely integrable systems," "chaos, synergetics and large-scale order," which are almost impossible to fit into the existing classification schemes. They draw upon widely different sections of mathematics.

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

Hilbert's Program was founded on a concern for the phenomenon of paradox in mathematics. To Hilbert, the paradoxes, which are at once both absurd and irresistible, revealed a deep philosophical truth: namely, that there is a discrepancy between the laws accord ing to which the mind of homo mathematicus works, and the laws governing objective mathematical fact. Mathematical epistemology is, therefore, to be seen as a struggle between a mind that naturally works in one way and a reality that works in another. Knowledge occurs when the two cooperate. Conceived in this way, there are two basic alternatives for mathematical epistemology: a skeptical position which maintains either that mind and reality seldom or never come to agreement, or that we have no very reliable way of telling when they do; and a non-skeptical position which holds that there is significant agree ment between mind and reality, and that their potential discrepan cies can be detected, avoided, and thus kept in check. Of these two, Hilbert clearly embraced the latter, and proposed a program designed to vindicate the epistemological riches represented by our natural, if non-literal, ways of thinking. Brouwer, on the other hand, opted for a position closer (in Hilbert's opinion) to that of the skeptic. Having decided that epistemological purity could come only through sacrifice, he turned his back on his classical heritage to accept a higher calling."

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.

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

Approach your problems from the right end It isn't that they can't see the solution. It is and begin with the answers. Then one day, that they can't see the problem. perhaps you will tind the tinal question. G. K. Chesterton. The Scandal of Father Brown 'The point of a Pin'. 'The Hermit CIad in Crane Feathers' in R. van Gulik's The Chinese Maze Murders. Growing specialization and diversification have brought a host of monographs and textbooks on increasingly specialized topics. However, the "tree" of knowledge of mathematics and related fields does not grow only by putting forth new branches. It also happens, quite of ten in fact, that branches which were thought to be completely disparate are suddenly seen to be related. Further, the kind and level of sophistication of mathematics applied in various sciences has changed drastically in recent years: measure theory is used (non-trivially) in regional and theoretical economics; algebraic geometry interacts with physics; the Minkowsky lemma, coding theory and the structure of water meet one another in packing and covering theory; quantum fields, crystal defects and mathematical programming profit from homotopy theory; Lie algebras are relevant to fiItering; and prediction and electrical engineering can use Stein spaces. And in addition to this there are such new emerging subdisciplines as "experimental mathematics," "CFD," "completely integrable systems," "chaos, synergetics and large-scale order," which are almost impossible to fit into the existing classification schemes. They draw upon widely different sections of mathematics.

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

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

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.