This 2001 book presents a unified approach to the foundations of mathematics in the theory of sets, covering both conventional and finitary (constructive) mathematics. It is based on a philosophical, historical and mathematical analysis of the relation between the concepts of 'natural number' and 'set'. This leads to an investigation of the logic of quantification over the universe of sets and a discussion of its role in second order logic, as well as in the analysis of proof by induction and definition by recursion. The subject matter of the book falls on the borderline between philosophy and mathematics, and should appeal to both philosophers and mathematicians with an interest in the foundations of mathematics.

This comprehensive two-volume work is devoted to the most general beginnings of mathematics. It goes back to Hausdorff's classic Set Theory (2nd ed., 1927), where set theory and the theory of functions were expounded as the fundamental parts of mathematics in such a way that there was no need for references to other sources. Along the lines of Hausdorff's initial work (1st ed., 1914), measure and integration theory is also included here as the third fundamental part of contemporary mathematics. The material about sets and numbers is placed in Volume 1 and the material about functions and measures is placed in Volume 2. Contents Historical foreword on the centenary after Felix Hausdorff's classic Set Theory Fundamentals of the theory of functions Fundamentals of the measure theory Historical notes on the Riesz - Radon - Frechet problem of characterization of Radon integrals as linear functionals

The development of Maxim Kontsevich's initial ideas on motivic integration has unexpectedly influenced many other areas of mathematics, ranging from the Langlands program over harmonic analysis, to non-Archimedean analysis, singularity theory and birational geometry. This book assembles the different theories of motivic integration and their applications for the first time, allowing readers to compare different approaches and assess their individual strengths. All of the necessary background is provided to make the book accessible to graduate students and researchers from algebraic geometry, model theory and number theory. Applications in several areas are included so that readers can see motivic integration at work in other domains. In a rapidly-evolving area of research this book will prove invaluable. This second volume discusses various applications of non-Archimedean geometry, model theory and motivic integration and the interactions between these domains.

The development of Maxim Kontsevich's initial ideas on motivic integration has unexpectedly influenced many other areas of mathematics, ranging from the Langlands program over harmonic analysis, to non-Archimedean analysis, singularity theory and birational geometry. This book assembles the different theories of motivic integration and their applications for the first time, allowing readers to compare different approaches and assess their individual strengths. All of the necessary background is provided to make the book accessible to graduate students and researchers from algebraic geometry, model theory and number theory. Applications in several areas are included so that readers can see motivic integration at work in other domains. In a rapidly-evolving area of research this book will prove invaluable. This first volume contains introductory texts on the model theory of valued fields, different approaches to non-Archimedean geometry, and motivic integration on algebraic varieties and non-Archimedean spaces.

This book continues from where the authors' previous book, Structural Proof Theory, ended. It presents an extension of the methods of analysis of proofs in pure logic to elementary axiomatic systems and to what is known as philosophical logic. A self-contained brief introduction to the proof theory of pure logic is included that serves both the mathematically and philosophically oriented reader. The method is built up gradually, with examples drawn from theories of order, lattice theory and elementary geometry. The aim is, in each of the examples, to help the reader grasp the combinatorial behaviour of an axiom system, which typically leads to decidability results. The last part presents, as an application and extension of all that precedes it, a proof-theoretical approach to the Kripke semantics of modal and related logics, with a great number of new results, providing essential reading for mathematical and philosophical logicians.

Set theory is the mathematics of infinity and part of the core curriculum for mathematics majors. This book blends theory and connections with other parts of mathematics so that readers can understand the place of set theory within the wider context. Beginning with the theoretical fundamentals, the author proceeds to illustrate applications to topology, analysis and combinatorics, as well as to pure set theory. Concepts such as Boolean algebras, trees, games, dense linear orderings, ideals, filters and club and stationary sets are also developed. Pitched specifically at undergraduate students, the approach is neither esoteric nor encyclopedic. The author, an experienced instructor, includes motivating examples and over 100 exercises designed for homework assignments, reviews and exams. It is appropriate for undergraduates as a course textbook or for self-study. Graduate students and researchers will also find it useful as a refresher or to solidify their understanding of basic set theory.

This book constitutes the refereed proceedings of the 12th International Conference on Unconventional Computation and Natural Computation, UCNC 2013, held in Milan, Italy, in July 2013. The 30 papers (28 full papers, 8 poster papers, and 2 invited papers) were carefully reviewed and selected from 46 submissions. The topics of the volume include: quantum, cellular, molecular, neural, DNA, membrane, and evolutionary computing; cellular automata; computation based on chaos and dynamical systems; massive parallel computation; collective intelligence; computation based on physical principles such as relativistic, optical, spatial, collision-based computing; amorphous computing; physarum computing; hypercomputation; fuzzy and rough computing; swarm intelligence; artificial immune systems; physics of computation; chemical computation; evolving hardware; the computational nature of self-assembly, developmental processes, bacterial communication, and brain processes.

Proof, Computation and Agency: Logic at the Crossroads provides an overview of modern logic and its relationship with other disciplines. As a highlight, several articles pursue an inspiring paradigm called 'social software', which studies patterns of social interaction using techniques from logic and computer science. The book also demonstrates how logic can join forces with game theory and social choice theory. A second main line is the logic-language-cognition connection, where the articles collected here bring several fresh perspectives. Finally, the book takes up Indian logic and its connections with epistemology and the philosophy of science, showing how these topics run naturally into each other.

This book addresses a gap in the model-theoretic understanding of valued fields that had limited the interactions of model theory with geometry. It contains significant developments in both pure and applied model theory. Part I of the book is a study of stably dominated types. These form a subset of the type space of a theory that behaves in many ways like the space of types in a stable theory. This part begins with an introduction to the key ideas of stability theory for stably dominated types. Part II continues with an outline of some classical results in the model theory of valued fields and explores the application of stable domination to algebraically closed valued fields. The research presented here is made accessible to the general model theorist by the inclusion of the introductory sections of each part.

In the 1990s Kim and Pillay generalized stability, a major model theoretic idea developed by Shelah twenty-five years earlier, to the study of simple theories. This book is an up-to-date introduction to simple theories and hyperimaginaries, with special attention to Lascar strong types and elimination of hyperimaginary problems. Assuming only knowledge of general model theory, the foundations of forking, stability, and simplicity are presented in full detail. The treatment of the topics is as general as possible, working with stable formulas and types and assuming stability or simplicity of the theory only when necessary. The author offers an introduction to independence relations as well as a full account of canonical bases of types in stable and simple theories. In the last chapters the notions of internality and analyzability are discussed and used to provide a self-contained proof of elimination of hyperimaginaries in supersimple theories.

The study of information-based actions and processes has been a vibrant - terface between logic and computer science for several decades now. Indeed, several natural perspectives come together here. On the one hand, logical s- tems may be used to describe the dynamics of arbitrary computational p- cesses as in the many sophisticated process logics available today. But also, key logical notions such as model checking or proof search are themselves informational processes involving agents with goals. The interplay between these descriptive and dynamic aspects shows even in our ordinary language. A word like proof hdenotes both a static certificate of truth, and an activity which humans or machines engage in. Increasing our understanding of l- ics of this sort tells us something about computer science, and about cognitive actions in general. The individual chapters of this book show the state of the art in current - vestigations of process calculi such as linear logic, and with mainly two major paradigms at work, namely, linear logic and modal logic. These techniques are applied to the title themes of concurrency and synchronisation, but there are also many repercussions for topics such as the geometry of proofs, categorial semantics, and logics of graphs. Viewed - gether, the chapters also offer exciting glimpses of future integration, as the reader moves back and forth through the book."

Change, Choice and Inference unifies lively and significant strands of research in logic, philosophy, economics and artificial intelligence.

This book introduces a new approach to building models of bounded arithmetic, with techniques drawn from recent results in computational complexity. Propositional proof systems and bounded arithmetics are closely related. In particular, proving lower bounds on the lengths of proofs in propositional proof systems is equivalent to constructing certain extensions of models of bounded arithmetic. This offers a clean and coherent framework for thinking about lower bounds for proof lengths, and it has proved quite successful in the past. This book outlines a brand new method for constructing models of bounded arithmetic, thus for proving independence results and establishing lower bounds for proof lengths. The models are built from random variables defined on a sample space which is a non-standard finite set and sampled by functions of some restricted computational complexity. It will appeal to anyone interested in logical approaches to fundamental problems in complexity theory.

Paolo Mancosu presents a series of innovative studies in the history and the philosophy of logic and mathematics in the first half of the twentieth century. The Adventure of Reason is divided into five main sections: history of logic (from Russell to Tarski); foundational issues (Hilbert's program, constructivity, Wittgenstein, Goedel); mathematics and phenomenology (Weyl, Becker, Mahnke); nominalism (Quine, Tarski); semantics (Tarski, Carnap, Neurath). Mancosu exploits extensive untapped archival sources to make available a wealth of new material that deepens in significant ways our understanding of these fascinating areas of modern intellectual history. At the same time, the book is a contribution to recent philosophical debates, in particular on the prospects for a successful nominalist reconstruction of mathematics, the nature of finitist intuition, the viability of alternative definitions of logical consequence, and the extent to which phenomenology can hope to account for the exact sciences.

In this 1987 text Professor Jech gives a unified treatment of the various forcing methods used in set theory, and presents their important applications. Product forcing, iterated forcing and proper forcing have proved powerful tools when studying the foundations of mathematics, for instance in consistency proofs. The book is based on graduate courses though some results are also included, making the book attractive to set theorists and logicians.

Relational mathematics is to operations research and informatics what numerical mathematics is to engineering: it is intended to help modelling, reasoning, and computing. Its applications are therefore diverse, ranging from psychology, linguistics, decision aid, and ranking to machine learning and spatial reasoning. Although many developments have been made in recent years, they have rarely been shared amongst this broad community of researchers. This comprehensive 2010 overview begins with an easy introduction to the topic, assuming a minimum of prerequisites; but it is nevertheless theoretically sound and up to date. It is suitable for applied scientists, explaining all the necessary mathematics from scratch using a multitude of visualised examples, via matrices and graphs. It ends with tangible results on the research level. The author illustrates the theory and demonstrates practical tasks in operations research, social sciences and the humanities.

Introduction to Mathematical Proofs helps students develop the necessary skills to write clear, correct, and concise proofs. Unlike similar textbooks, this one begins with logic since it is the underlying language of mathematics and the basis of reasoned arguments. The text then discusses deductive mathematical systems and the systems of natural numbers, integers, rational numbers, and real numbers. It also covers elementary topics in set theory, explores various properties of relations and functions, and proves several theorems using induction. The final chapters introduce the concept of cardinalities of sets and the concepts and proofs of real analysis and group theory. In the appendix, the author includes some basic guidelines to follow when writing proofs. This new edition includes more than 125 new exercises in sections titled More Challenging Exercises. Also, numerous examples illustrate in detail how to write proofs and show how to solve problems. These examples can serve as models for students to emulate when solving exercises. Several biographical sketches and historical comments have been included to enrich and enliven the text. Written in a conversational style, yet maintaining the proper level of mathematical rigor, this accessible book teaches students to reason logically, read proofs critically, and write valid mathematical proofs. It prepares them to succeed in more advanced mathematics courses, such as abstract algebra and analysis.

Fuzzy Algorithms for Control gives an overview of the research results of a number of European research groups that are active and play a leading role in the field of fuzzy modeling and control. It contains 12 chapters divided into three parts. Chapters in the first part address the position of fuzzy systems in control engineering and in the AI community. State-of-the-art surveys on fuzzy modeling and control are presented along with a critical assessment of the role of these methodologists in control engineering. The second part is concerned with several analysis and design issues in fuzzy control systems. The analytical issues addressed include the algebraic representation of fuzzy models of different types, their approximation properties, and stability analysis of fuzzy control systems. Several design aspects are addressed, including performance specification for control systems in a fuzzy decision-making framework and complexity reduction in multivariable fuzzy systems. In the third part of the book, a number of applications of fuzzy control are presented. It is shown that fuzzy control in combination with other techniques such as fuzzy data analysis is an effective approach to the control of modern processes which present many challenges for the design of control systems. One has to cope with problems such as process nonlinearity, time-varying characteristics for incomplete process knowledge. Examples of real-world industrial applications presented in this book are a blast furnace, a lime kiln and a solar plant. Other examples of challenging problems in which fuzzy logic plays an important role and which are included in this book are mobile robotics and aircraft control. The aim of this book is to address both theoretical and practical subjects in a balanced way. It will therefore be useful for readers from the academic world and also from industry who want to apply fuzzy control in practice.

In recent years, Artificial Intelligence researchers have largely focused their efforts on solving specific problems, with less emphasis on 'the big picture' - automating large scale tasks which require human-level intelligence to undertake. The subject of this book, automated theory formation in mathematics, is such a large scale task. Automated theory formation requires the invention of new concepts, the calculating of examples, the making of conjectures and the proving of theorems. This book, representing four years of PhD work by Dr. Simon Colton demonstrates how theory formation can be automated. Building on over 20 years of research into constructing an automated mathematician carried out in Professor Alan Bundy's mathematical reasoning group in Edinburgh, Dr. Colton has implemented the HR system as a solution to the problem of forming theories by computer. HR uses various pieces of mathematical software, including automated theorem provers, model generators and databases, to build a theory from the bare minimum of information - the axioms of a domain. The main application of this work has been mathematical discovery, and HR has had many successes. In particular, it has invented 20 new types of number of sufficient interest to be accepted into the Encyclopaedia of Integer Sequences, a repository of over 60,000 sequences contributed by many (human) mathematicians.

The monograph is a 'de-construction' of Kurt Godel's Incompleteness Theorem's paradox sentence's used to prove that no formal systems of logic or mathematics can exist. The semantic valuation of the 'meaning' behind the sentences used for the paradox is challenged and revised using other words that change the very nature of the sentences used in the paradox. These 'semantic' changes result in new meanings for the sentences used for the paradoxes and forms new interpretations of examining Godel's Incompleteness Theorem as it related to David Hilbert's unifying plan for a Formalized mathematics. The monograph includes an unpublished paper on the reason 'why' behind the writing of this monograph in the Appendix section as well as a copy of my original mathematics dissertation from which this monograph is derived that is also located in the Appendix section of this monograph. The monograph includes a chapter on 'machine intelligence' and is a culmination of my thoughts on language, machines and artificial intelligence as a whole. Technical papers on the subject are included in the Appendix section of this monograph. Content: Abstract, Preface, Introduction, The Incompleteness Theorem, Hilbert's Axiomatic System for Mathematics, Of Two Words, Language and Godel's Theorem, Can Machines Think?, Conclusions, Summary, References, Notes, Appendix and Index.

This book gives an introduction to theories of computability from a mathematically sophisticated point of view. It treats not only 'the' theory of computability (created by Alan Turing and others in the 1930s), but also a variety of other theories (of Boolean functions, automata and formal languages). These are addressed from the classical perspective of their generation by grammars and from the modern perspective as rational cones. The treatment of the classical theory of computable functions and relations takes the form of a tour through basic recursive function theory, starting with an axiomatic foundation and developing the essential methods in order to survey the most memorable results of the field. This authoritative account by one of the leading lights of the subject will prove exceptionally useful reading for graduate students, and researchers in theoretical computer science and mathematics.

This comprehensive two-volume work is devoted to the most general beginnings of mathematics. It goes back to Hausdorff's classic Set Theory (2nd ed., 1927), where set theory and the theory of functions were expounded as the fundamental parts of mathematics in such a way that there was no need for references to other sources. Along the lines of Hausdorff's initial work (1st ed., 1914), measure and integration theory is also included here as the third fundamental part of contemporary mathematics.The material about sets and numbers is placed in Volume 1 and the material about functions and measures is placed in Volume 2. Contents Fundamentals of the theory of classes, sets, and numbers Characterization of all natural models of Neumann - Bernays - Godel and Zermelo - Fraenkel set theories Local theory of sets as a foundation for category theory and its connection with the Zermelo - Fraenkel set theory Compactness theorem for generalized second-order language

Gert H. Muller The growth of the number of publications in almost all scientific areas, as in the area of (mathematical) logic, is taken as a sign of our scientifically minded culture, but it also has a terrifying aspect. In addition, given the rapidly growing sophistica- tion, specialization and hence subdivision of logic, researchers, students and teachers may have a hard time getting an overview of the existing literature, partic- ularly if they do not have an extensive library available in their neighbourhood: they simply do not even know what to ask for! More specifically, if someone vaguely knows that something vaguely connected with his interests exists some- where in the literature, he may not be able to find it even by searching through the publications scattered in the review journals. Answering this challenge was and is the central motivation for compiling this Bibliography. The Bibliography comprises (presently) the following six volumes (listed with the corresponding Editors): I. Classical Logic W. Rautenberg 11. Non-classical Logics W. Rautenberg 111. Model Theory H. -D. Ebbinghaus IV. Recursion Theory P. G. Hinman V. Set Theory A. R. Blass VI. ProofTheory; Constructive Mathematics J. E. Kister; D. van Dalen & A. S. Troelstra.

Kurt Goedel (1906-1978) did groundbreaking work that transformed logic and other important aspects of our understanding of mathematics, especially his proof of the incompleteness of formalized arithmetic. This book on different aspects of his work and on subjects in which his ideas have contemporary resonance includes papers from a May 2006 symposium celebrating Goedel's centennial as well as papers from a 2004 symposium. Proof theory, set theory, philosophy of mathematics, and the editing of Goedel's writings are among the topics covered. Several chapters discuss his intellectual development and his relation to predecessors and contemporaries such as Hilbert, Carnap, and Herbrand. Others consider his views on justification in set theory in light of more recent work and contemporary echoes of his incompleteness theorems and the concept of constructible sets.

This book constitutes the refereed proceedings of the 33rd International Conference on Applications and Theory of Petri Nets and Concurrency, PETRI NETS 2012, held in Hamburg, Germany, in June 2012. The 18 regular papers and 3 tool papers presented were carefully reviewed and selected from 55 submissions. The book also contains 2 invited talks. All current issues on research and development in the area of Petri nets and related models of concurrent systems are addressed.