This volume considers the computational complexity of determining whether a system of equations over a fixed algebra A has a solution. It examines in detail the two problems this leads to: SysTermSat(A) and SysPolSat(A), in which equations are built out of terms or polynomials, respectively. The book characterizes those algebras for which SysPolSat can be solved in a polynomial time. So far, studies and their outcomes have not covered algebras that generate a variety admitting type 1 in the sense of Tame Congruence Theory. Since unary algebras admit only type 1, this book focuses on these algebras to tackle the main problem. It discusses several aspects of unary algebras and proves that the Constraint Satisfaction Problem for relational structures is polynomially equivalent to SysTermSat over unary algebras. The book's final chapters discuss partial characterizations, present conclusions, and describe the problems that are still open.

Originally published in 1958, this informative textbook is the first part of a two-volume set, which explores the subject of statistics in full, from elementary to advanced level. Primarily aimed at school students as a course of self-study, this first part focuses on the elementary and contains multiple examples and exercises, predominantly taken from past examination papers so as to meet the requirements of examinations at the time of publication. Chapters cover all of the key topics expected of an elementary-level statistics course; chapter titles include, 'Frequency distributions', 'Averages' and 'The analysis of a time-series'. Notably, the more difficult sections are marked with asterisks and tables of logarithms, antilogarithms, squares and square roots are included for reference. This 'numerical, experimental and practical' book will be of great value to scholars of mathematics as well as to anyone with an interest in physics, economics and the history of education.

This innovative textbook introduces a new pattern-based approach to learning proof methods in the mathematical sciences. Readers will discover techniques that will enable them to learn new proofs across different areas of pure mathematics with ease. The patterns in proofs from diverse fields such as algebra, analysis, topology and number theory are explored. Specific topics examined include game theory, combinatorics and Euclidean geometry, enabling a broad familiarity. The author, an experienced lecturer and researcher renowned for his innovative view and intuitive style, illuminates a wide range of techniques and examples from duplicating the cube to triangulating polygons to the infinitude of primes to the fundamental theorem of algebra. Intended as a companion for undergraduate students, this text is an essential addition to every aspiring mathematician's toolkit.

This book offers an excursion through the developmental area of research mathematics. It presents some 40 papers, published between the 1870s and the 1970s, on proofs of the Cantor-Bernstein theorem and the related Bernstein division theorem. While the emphasis is placed on providing accurate proofs, similar to the originals, the discussion is broadened to include aspects that pertain to the methodology of the development of mathematics and to the philosophy of mathematics. Works of prominent mathematicians and logicians are reviewed, including Cantor, Dedekind, Schroeder, Bernstein, Borel, Zermelo, Poincare, Russell, Peano, the Koenigs, Hausdorff, Sierpinski, Tarski, Banach, Brouwer and several others mainly of the Polish and the Dutch schools. In its attempt to present a diachronic narrative of one mathematical topic, the book resembles Lakatos' celebrated book Proofs and Refutations. Indeed, some of the observations made by Lakatos are corroborated herein. The analogy between the two books is clearly anything but superficial, as the present book also offers new theoretical insights into the methodology of the development of mathematics (proof-processing), with implications for the historiography of mathematics.

This book gives a general introduction to the theory of representations of algebras. It starts with examples of classification problems of matrices under linear transformations, explaining the three common setups: representation of quivers, modules over algebras and additive functors over certain categories. The main part is devoted to (i) module categories, presenting the unicity of the decomposition into indecomposable modules, the Auslander-Reiten theory and the technique of knitting; (ii) the use of combinatorial tools such as dimension vectors and integral quadratic forms; and (iii) deeper theorems such as Gabriel's Theorem, the trichotomy and the Theorem of Kac - all accompanied by further examples. Each section includes exercises to facilitate understanding. By keeping the proofs as basic and comprehensible as possible and introducing the three languages at the beginning, this book is suitable for readers from the advanced undergraduate level onwards and enables them to consult related, specific research articles.

Algebraic logic is a subject in the interface between logic, algebra and geometry, it has strong connections with category theory and combinatorics. Tarski's quest for finding structure in logic leads to cylindric-like algebras as studied in this book, they are among the main players in Tarskian algebraic logic. Cylindric algebra theory can be viewed in many ways: as an algebraic form of definability theory, as a study of higher-dimensional relations, as an enrichment of Boolean Algebra theory, or, as logic in geometric form ("cylindric" in the name refers to geometric aspects). Cylindric-like algebras have a wide range of applications, in, e.g., natural language theory, data-base theory, stochastics, and even in relativity theory. The present volume, consisting of 18 survey papers, intends to give an overview of the main achievements and new research directions in the past 30 years, since the publication of the Henkin-Monk-Tarski monographs. It is dedicated to the memory of Leon Henkin.

This is the most comprehensive survey of the mathematical life of the legendary Paul Erdos (1913-1996), one of the most versatile and prolific mathematicians of our time. For the first time, all the main areas of Erdos' research are covered in a single project. Because of overwhelming response from the mathematical community, the project now occupies over 1000 pages, arranged into two volumes. These volumes contain both high level research articles as well as key articles that survey some of the cornerstones of Erdos' work, each written by a leading world specialist in the field. A special chapter "Early Days", rare photographs, and art related to Erdos complement this striking collection. A unique contribution is the bibliography on Erdos' publications: the most comprehensive ever published. This new edition, dedicated to the 100th anniversary of Paul Erdos' birth, contains updates on many of the articles from the two volumes of the first edition, several new articles from prominent mathematicians, a new introduction, and more biographical information about Paul Erdos with an updated list of publications. The second volume contains chapters on graph theory and combinatorics, extremal and Ramsey theory, and a section on infinity that covers Erdos' research on set theory. All of these chapters are essentially updated, particularly the extremal theory chapter that contains a survey of flag algebras, a new technique for solving extremal problems.

This is a comprehensive book on the life and works of Leon Henkin (1921-2006), an extraordinary scientist and excellent teacher whose writings became influential right from the beginning of his career with his doctoral thesis on "The completeness of formal systems" under the direction of Alonzo Church. Upon the invitation of Alfred Tarski, Henkin joined the Group in Logic and the Methodology of Science in the Department of Mathematics at the University of California Berkeley in 1953. He stayed with the group until his retirement in 1991. This edited volume includes both foundational material and a logic perspective. Algebraic logic, model theory, type theory, completeness theorems, philosophical and foundational studies are among the topics covered, as well as mathematical education. The work discusses Henkin's intellectual development, his relation to his predecessors and contemporaries and his impact on the recent development of mathematical logic. It offers a valuable reference work for researchers and students in the fields of philosophy, mathematics and computer science.

Contents and treatment are fresh and very different from the standard treatments Presents a fully constructive version of what it means to do algebra The exposition is not only clear, it is friendly, philosophical, and considerate even to the most naive or inexperienced reader

? DoesP=NP. In just ?ve symbols Dick Karp -in 1972-captured one of the deepest and most important questions of all time. When he ?rst wrote his famous paper, I think it's fair to say he did not know the depth and importance of his question. Now over three decades later, we know P=NP is central to our understanding of compu- tion, it is a very hard problem, and its resolution will have potentially tremendous consequences. This book is a collection of some of the most popular posts from my blog- Godel Lost Letter andP=NP-which I started in early 2009. The main thrust of the blog, especially when I started, was to explore various aspects of computational complexity around the famousP=NP question. As I published posts I branched out and covered additional material, sometimes a timely event, sometimes a fun idea, sometimes a new result, and sometimes an old result. I have always tried to make the posts readable by a wide audience, and I believe I have succeeded in doing this.

This volume was produced in conjunction with the Thematic Program in o-Minimal Structures and Real Analytic Geometry, held from January to June of 2009 at the Fields Institute. Five of the six contributions consist of notes from graduate courses associated with the program: Felipe Cano on a new proof of resolution of singularities for planar analytic vector fields; Chris Miller on o-minimality and Hardy fields; Jean-Philippe Rolin on the construction of o-minimal structures from quasianalytic classes; Fernando Sanz on non-oscillatory trajectories of vector fields; and Patrick Speissegger on pfaffian sets. The sixth contribution, by Antongiulio Fornasiero and Tamara Servi, is an adaptation to the nonstandard setting of A.J. Wilkie's construction of o-minimal structures from infinitely differentiable functions. Most of this material is either unavailable elsewhere or spread across many different sources such as research papers, conference proceedings and PhD theses. This book will be a useful tool for graduate students or researchers from related fields who want to learn about expansions of o-minimal structures by solutions, or images thereof, of definable systems of differential equations.

This impressive volume is dedicated to Mel Nathanson, a leading authoritative expert for several decades in the area of combinatorial and additive number theory. For several decades, Mel Nathanson's seminal ideas and results in combinatorial and additive number theory have influenced graduate students and researchers alike. The invited survey articles in this volume reflect the work of distinguished mathematicians in number theory, and represent a wide range of important topics in current research.

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 II. Non-classical Logics W. Rautenberg III. Model Theory H. -D. Ebbinghaus IV. Recursion Theory P. G. Hinman V. Set Theory A. R. Blass VI. Proof Theory; Constructive Mathematics J. E. Kister; D. van Dalen & A. S. Troelstra.

Since its inception 20 years ago the theory of fuzzy sets has advanced in a variety of ways and in many disciplines. Applications of this theory can be found in artificial intelligence, computer science, control engineering, decision theory, expert systems, logic, management science, operations research, pattern recognition, robotics and others. Theoretical advances, too, have been made in many directions, and a gap has arisen between advanced theoretical topics and applications, which often use the theory at a rather elementary level. The primary goal of this book is to close this gap - to provide a textbook for courses in fuzzy set theory and a book that can be used as an introduction. This revised book updates the research agenda, with the chapters of possibility theory, fuzzy logic and approximate reasoning, expert systems and control, decision making and fuzzy set models in operations research being restructured and rewritten. Exercises have been added to almost all chapters and a teacher's manual is available upon request.

The maths needed to succeed in AS and A Level Psychology is harder now than ever before. Suitable for all awarding bodies, this practical handbook covers all of the maths skills needed for the AS and A Level Psychology specifications. Worked examples, practice questions, 'remember points' and 'stretch yourself' questions give students the key knowledge and then the opportunity to practise and build confidence.

In many areas of mathematics some "higher operations" are arising. These havebecome so important that several research projects refer to such expressions. Higher operationsform new types of algebras. The key to understanding and comparing them, to creating invariants of their action is operad theory. This is a point of view that is 40 years old in algebraic topology, but the new trend is its appearance in several other areas, such as algebraic geometry, mathematical physics, differential geometry, and combinatorics. The present volume is the first comprehensive and systematic approach to algebraic operads. An operad is an algebraic device that serves to study all kinds of algebras (associative, commutative, Lie, Poisson, A-infinity, etc.) from a conceptual point of view. The book presents this topic with an emphasis on Koszul duality theory. After a modern treatment of Koszul duality for associative algebras, the theory is extended to operads. Applications to homotopy algebra are given, for instance the Homotopy Transfer Theorem. Although the necessary notions of algebra are recalled, readers are expected to be familiar with elementary homological algebra. Each chapter ends with a helpful summary and exercises. A full chapter is devoted to examples, and numerous figures are included. After a low-level chapter on Algebra, accessible to (advanced) undergraduate students, the level increases gradually through the book. However, the authors have done their best to make it suitable for graduate students: three appendices review the basic results needed in order to understand the various chapters. Since higher algebra is becoming essential in several research areas like deformation theory, algebraic geometry, representation theory, differential geometry, algebraic combinatorics, and mathematical physics, the book can also be used as a reference work by researchers.

The European Summer School in Logic, Language and Information (ESSLLI) is organized every year by the Association for Logic, Language and Information (FoLLI) in different sites around Europe. The main focus of ESSLLI is on the interface between linguistics, logic and computation. ESSLLI offers foundational, introductory and advanced courses, as well as workshops, covering a wide variety of topics within the three areas of interest: Language and Computation, Language and Logic, and Logic and Computation. The 16 papers presented in this volume have been selected among 44 papers presented by talks or posters at the Student Sessions of the 24th and 25th editions of ESSLLI, held in 2012 in Opole, Poland, and 2013 in Dusseldorf, Germany. The papers are extended versions of the versions presented, and have all been subjected to a second round of blind peer review.

In his rich and varied career as a mathematician, computer scientist, and educator, Jacob T. Schwartz wrote seminal works in analysis, mathematical economics, programming languages, algorithmics, and computational geometry. In this volume of essays, his friends, students, and collaborators at the Courant Institute of Mathematical Sciences present recent results in some of the fields that Schwartz explored: quantum theory, the theory and practice of programming, program correctness and decision procedures, dextrous manipulation in Robotics, motion planning, and genomics. In addition to presenting recent results in these fields, these essays illuminate the astonishingly productive trajectory of a brilliant and original scientist and thinker.

This textbook gives an introduction to axiomatic set theory and examines the prominent questions that are relevant in current research in a manner that is accessible to students. Its main theme is the interplay of large cardinals, inner models, forcing and descriptive set theory.

The following topics are covered:
Forcing and constructability
The Solovay-Shelah Theorem i.e. the equiconsistency of 'every set of reals is Lebesgue measurable' with one inaccessible cardinal
Fine structure theory and a modern approach to sharps
Jensen's Covering Lemma
The equivalence of analytic determinacy with sharps
The theory of extenders and iteration trees
A proof of projective determinacy from Woodin cardinals.
"Set Theory" requires only a basic knowledge of mathematical logic and will be suitable for advanced students and researchers."

Fuzzy Set Theory - And Its Applications, Third Edition is a textbook for courses in fuzzy set theory. It can also be used as an introduction to the subject. The character of a textbook is balanced with the dynamic nature of the research in the field by including many useful references to develop a deeper understanding among interested readers.
The book updates the research agenda (which has witnessed profound and startling advances since its inception some 30 years ago) with chapters on possibility theory, fuzzy logic and approximate reasoning, expert systems, fuzzy control, fuzzy data analysis, decision making and fuzzy set models in operations research. All chapters have been updated. Exercises are included.

Ernst Zermelo (1871-1953) is regarded as the founder of axiomatic set theory and is best-known for the first formulation of the axiom of choice. However, his papers also include pioneering work in applied mathematics and mathematical physics. This edition of his collected papers consists of two volumes. The present Volume II covers Ernst Zermelo's work on the calculus of variations, applied mathematics, and physics. The papers are each presented in their original language together with an English translation, the versions facing each other on opposite pages. Each paper or coherent group of papers is preceded by an introductory note provided by an acknowledged expert in the field who comments on the historical background, motivation, accomplishments, and influence.

This book presents a mathematically-based introduction into the fascinating topic of Fuzzy Sets and Fuzzy Logic and might be used as textbook at both undergraduate and graduate levels and also as reference guide for mathematician, scientists or engineers who would like to get an insight into Fuzzy Logic. Fuzzy Sets have been introduced by Lotfi Zadeh in 1965 and since then, they have been used in many applications. As a consequence, there is a vast literature on the practical applications of fuzzy sets, while theory has a more modest coverage. The main purpose of the present book is to reduce this gap by providing a theoretical introduction into Fuzzy Sets based on Mathematical Analysis and Approximation Theory. Well-known applications, as for example fuzzy control, are also discussed in this book and placed on new ground, a theoretical foundation. Moreover, a few advanced chapters and several new results are included. These comprise, among others, a new systematic and constructive approach for fuzzy inference systems of Mamdani and Takagi-Sugeno types, that investigates their approximation capability by providing new error estimates.

The notion of Fuzziness stands as one of the really new concepts that have recently enriched the world of Science. Science grows not only through technical and formal advances on one side and useful applications on the other side, but also as consequence of the introduction and assimilation of new concepts in its corpus. These, in turn, produce new developments and applications. And this is what Fuzziness, one of the few new concepts arisen in the XX Century, has been doing so far. This book aims at paying homage to Professor Lotfi A. Zadeh, the "father of fuzzy logic" and also at giving credit to his exceptional work and personality. In a way, this is reflected in the variety of contributions collected in the book. In some of them the authors chose to speak of personal meetings with Lotfi; in others, they discussed how certain papers of Zadeh were able to open for them a new research horizon. Some contributions documented results obtained from the author/s after taking inspiration from a particular idea of Zadeh, thus implicitly acknowledging him. Finally, there are contributions of several "third generation fuzzysists or softies" who were firstly led into the world of Fuzziness by a disciple of Lotfi Zadeh, who, following his example, took care of opening for them a new road in science. Rudolf Seising is Adjoint Researcher at the European Centre for Soft Computing in Mieres, Asturias (Spain). Enric Trillas and Claudio Moraga are Emeritus Researchers at the European Centre for Soft Computing, Mieres, Asturias (Spain). Settimo Termini is Professor of Theoretical Computer Science at the University of Palermo, Italy and Affiliated Researcher at the European Centre for Soft Computing, Mieres, Asturias (Spain)

This is the first book devoted to the systematic study of sparse graphs and sparse finite structures. Although the notion of sparsity appears in various contexts and is a typical example of a hard to define notion, the authors devised an unifying classification of general classes of structures. This approach is very robust and it has many remarkable properties. For example the classification is expressible in many different ways involving most extremal combinatorial invariants. This study of sparse structures found applications in such diverse areas as algorithmic graph theory, complexity of algorithms, property testing, descriptive complexity and mathematical logic (homomorphism preservation,fixed parameter tractability and constraint satisfaction problems). It should be stressed that despite of its generality this approach leads to linear (and nearly linear) algorithms. Jaroslav Nesetril is a professor at Charles University, Prague; Patrice Ossona de Mendez is a CNRS researcher et EHESS, Paris. This book is related to the material presented by the first author at ICM 2010.

Elements of Mathematics takes readers on a fascinating tour that begins in elementary mathematics--but, as John Stillwell shows, this subject is not as elementary or straightforward as one might think. Not all topics that are part of today's elementary mathematics were always considered as such, and great mathematical advances and discoveries had to occur in order for certain subjects to become "elementary." Stillwell examines elementary mathematics from a distinctive twenty-first-century viewpoint and describes not only the beauty and scope of the discipline, but also its limits. From Gaussian integers to propositional logic, Stillwell delves into arithmetic, computation, algebra, geometry, calculus, combinatorics, probability, and logic. He discusses how each area ties into more advanced topics to build mathematics as a whole. Through a rich collection of basic principles, vivid examples, and interesting problems, Stillwell demonstrates that elementary mathematics becomes advanced with the intervention of infinity. Infinity has been observed throughout mathematical history, but the recent development of "reverse mathematics" confirms that infinity is essential for proving well-known theorems, and helps to determine the nature, contours, and borders of elementary mathematics. Elements of Mathematics gives readers, from high school students to professional mathematicians, the highlights of elementary mathematics and glimpses of the parts of math beyond its boundaries.