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.

This volume takes its name from a popular series of intensive mathematics workshops hosted at institutions in Appalachia and surrounding areas. At these meetings, internationally prominent set theorists give one-day lectures that focus on important new directions, methods, tools and results so that non-experts can begin to master these and incorporate them into their own research. Each chapter in this volume was written by the workshop leaders in collaboration with select student participants, and together they represent most of the meetings from the period 2006-2012. Topics covered include forcing and large cardinals, descriptive set theory, and applications of set theoretic ideas in group theory and analysis, making this volume essential reading for a wide range of researchers and graduate students.

The rapidly expanding area of structural graph theory uses ideas of connectivity to explore various aspects of graph theory and vice versa. It has links with other areas of mathematics, such as design theory and is increasingly used in such areas as computer networks where connectivity algorithms are an important feature. Although other books cover parts of this material, none has a similarly wide scope. Ortrud R. Oellermann (Winnipeg), internationally recognised for her substantial contributions to structural graph theory, acted as academic consultant for this volume, helping shape its coverage of key topics. The result is a collection of thirteen expository chapters, each written by acknowledged experts. These contributions have been carefully edited to enhance readability and to standardise the chapter structure, terminology and notation throughout. An introductory chapter details the background material in graph theory and network flows and each chapter concludes with an extensive list of references.

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

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.

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.

This second volume of a collection of papers offers new perspectives and challenges in the study of logic. It is presented in honor of the fiftieth birthday of Jean-Yves Beziau. The papers touch upon a wide range of topics including paraconsistent logic, quantum logic, geometry of oppositions, categorical logic, computational logic, fundamental logic notions (identity, rule, quantification) and history of logic (Leibniz, Peirce, Hilbert). The volume gathers personal recollections about Jean-Yves Beziau and an autobiography, followed by 25 papers written by internationally distinguished logicians, mathematicians, computer scientists, linguists and philosophers, including Irving Anellis, Dov Gabbay, Ivor Grattan-Guinness, Istvan Nemeti, Henri Prade. These essays will be of interest to all students and researchers interested in the nature and future of logic.

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.

The two main themes of this book, logic and complexity, are both essential for understanding the main problems about the foundations of mathematics. Logical Foundations of Mathematics and Computational Complexity covers a broad spectrum of results in logic and set theory that are relevant to the foundations, as well as the results in computational complexity and the interdisciplinary area of proof complexity. The author presents his ideas on how these areas are connected, what are the most fundamental problems and how they should be approached. In particular, he argues that complexity is as important for foundations as are the more traditional concepts of computability and provability. Emphasis is on explaining the essence of concepts and the ideas of proofs, rather than presenting precise formal statements and full proofs. Each section starts with concepts and results easily explained, and gradually proceeds to more difficult ones. The notes after each section present some formal definitions, theorems and proofs. Logical Foundations of Mathematics and Computational Complexity is aimed at graduate students of all fields of mathematics who are interested in logic, complexity and foundations. It will also be of interest for both physicists and philosophers who are curious to learn the basics of logic and complexity theory.

Using data from one season of NBA games, Basketball Data Science: With Applications in R is the perfect book for anyone interested in learning and applying data analytics in basketball. Whether assessing the spatial performance of an NBA player's shots or doing an analysis of the impact of high pressure game situations on the probability of scoring, this book discusses a variety of case studies and hands-on examples using a custom R package. The codes are supplied so readers can reproduce the analyses themselves or create their own. Assuming a basic statistical knowledge, Basketball Data Science with R is suitable for students, technicians, coaches, data analysts and applied researchers. Features: * One of the first books to provide statistical and data mining methods for the growing field of analytics in basketball. * Presents tools for modelling graphs and figures to visualize the data. * Includes real world case studies and examples, such as estimations of scoring probability using the Golden State Warriors as a test case. * Provides the source code and data so readers can do their own analyses on NBA teams and players.

As society comes to rely increasingly on software for its welfare and prosperity there is an urgent need to create systems in which it can trust. Experience has shown that confidence can only come from a more profound understanding of the issues, which in turn can come only if it is based on logically sound foundations.
This volume contains contributions from leading researchers in the critical disciplines of computing and information science, mathematics, logic, and complexity. All contributions are self-contained, aiming at comprehensibility as well as comprehensiveness. The volume also contains introductory hints to technical issues, concise surveys, introductions, and various fresh results and new perspectives.

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.

An understanding of emergent computation requires a profound revision of the most fundamental ideas. A noticeable attempt of such a rethinking is a world view in which natural systems are seen not as separate entities but as integrated parts of a unified whole. The book for the first time presents such a mathematical structure, which remarkably is based on integers as the single concept. As integers are considered to be the most fundamental entities irreducible to something simpler, this makes the mathematical structure a final theory, and thus we do not have to look for its explanation in terms of deeper concepts. The book is not only applicable to models of computation and optimization but also has scientific consequences, as it contributes to a rethinking of the most fundamental ideas about nature. Audience: The book is written at a level suitable for advanced undergraduate students and graduate students as well as research workers and practitioners in computer science information technology, mathematics and physics. The book is suitable as a reference or as supplementary reading material for an advanced graduate course. Only a basic knowledge of calculus is required.

Fuzzy geometric programming was originated by the author in the Proceed ing of the second IFSA conferences, 1987(Tokyo) 14 years ago. Later, the paper was invited for formal publication in the International Journal of Fuzzy Sets and Systems. From then on, more and more papers have been written by scholars all over the world who have been interested in its research. So this programming method has been acknowledged by experts and has gradually formed a new branch of fuzzy mathematics. lnspired by Zadeh's fuzzy sets theory, fuzzy geometric programming emerges from the combination of fuzzy sets theory with geometric programming, where models are built in the fuzzy posynomial and the reverse geometric program ming. The present book is intended to discuss fuzziness of objective function and constraint conditions, a variety of fuzzy numbers in coefficients and vari ables and problems about multi-objective fuzzy geometric programming. It establishes and rounds out an entire theory system, showing that there exist conditions of fuzzy optimal or most satisfactory solutions in fuzzy geometric ptogramming, and it develops some effective algorithms. In order to introduce this new branch, the book aims at the exposition of three points: encompassing ideas and conception, theory and methods, and diffusion and application. lt lays more emphasis on the second point than the first one, and less on the third. Besides, it introduces some knowledge of classical geometric programming and of fuzzy sets theory and application examples of fuzzy geometric programming in electric power systems as weil."

The book presents a thoroughly elaborated logical theory of generalized truth-values understood as subsets of some established set of (basic) truth values. After elucidating the importance of the very notion of a truth value in logic and philosophy, we examine some possible ways of generalizing this notion. The useful four-valued logic of first-degree entailment by Nuel Belnap and the notion of a bilattice (a lattice of truth values with two ordering relations) constitute the basis for further generalizations. By doing so we elaborate the idea of a multilattice, and most notably, a trilattice of truth values - a specific algebraic structure with information ordering and two distinct logical orderings, one for truth and another for falsity. Each logical order not only induces its own logical vocabulary, but determines also its own entailment relation. We consider both semantic and syntactic ways of formalizing these relations and construct various logical calculi.

The theory presented in this book is developed constructively, is based on a few axioms encapsulating the notion of objects (points and sets) being apart, and encompasses both point-set topology and the theory of uniform spaces. While the classical-logic-based theory of proximity spaces provides some guidance for the theory of apartness, the notion of nearness/proximity does not embody enough algorithmic information for a deep constructive development. The use of constructive (intuitionistic) logic in this book requires much more technical ingenuity than one finds in classical proximity theory -- algorithmic information does not come cheaply -- but it often reveals distinctions that are rendered invisible by classical logic. In the first chapter the authors outline informal constructive logic and set theory, and, briefly, the basic notions and notations for metric and topological spaces. In the second they introduce axioms for a point-set apartness and then explore some of the consequences of those axioms. In particular, they examine a natural topology associated with an apartness space, and relations between various types of continuity of mappings. In the third chapter the authors extend the notion of point-set (pre-)apartness axiomatically to one of (pre-)apartness between subsets of an inhabited set. They then provide axioms for a quasiuniform space, perhaps the most important type of set-set apartness space. Quasiuniform spaces play a major role in the remainder of the chapter, which covers such topics as the connection between uniform and strong continuity (arguably the most technically difficult part of the book), apartness and convergence in function spaces, types of completeness, and neat compactness. Each chapter has a Notes section, in which are found comments on the definitions, results, and proofs, as well as occasional pointers to future work. The book ends with a Postlude that refers to other constructive approaches to topology, with emphasis on the relation between apartness spaces and formal topology. Largely an exposition of the authors' own research, this is the first book dealing with the apartness approach to constructive topology, and is a valuable addition to the literature on constructive mathematics and on topology in computer science. It is aimed at graduate students and advanced researchers in theoretical computer science, mathematics, and logic who are interested in constructive/algorithmic aspects of topology.

This concise introduction to model theory begins with standard notions and takes the reader through to more advanced topics such as stability, simplicity and Hrushovski constructions. The authors introduce the classic results, as well as more recent developments in this vibrant area of mathematical logic. Concrete mathematical examples are included throughout to make the concepts easier to follow. The book also contains over 200 exercises, many with solutions, making the book a useful resource for graduate students as well as researchers.

The primary purpose of this book is to present information about selected topics on the interactions and applications of fuzzy + neural. Most of the discussion centers around our own research in these areas. Fuzzy + neural can mean many things: (1) approximations between fuzzy systems and neu ral nets (Chapter 4); (2) building hybrid neural nets to equal fuzzy systems (Chapter 5); (3) using neura.l nets to solve fuzzy problems (Chapter 6); (4) approximations between fuzzy neural nets and other fuzzy systems (Chap ter 8); (5) constructing hybrid fuzzy neural nets for certain fuzzy systems (Chapters 9, 10); or (6) computing with words (Chapter 11). This book is not intend to be used primarily as a text book for a course in fuzzy + neural because we have not included problems at the end of each chapter, we have omitted most proofs (given in the references), and we have given very few references. We wanted to keep the mathematical prerequisites to a minimum so all longer, involved, proofs were omitted. Elementary dif ferential calculus is the only prerequisite needed since we do mention partial derivatives once or twice."

The impact and influence of Jean-Pierre Serre's work have been notable ever since his doctoral thesis on homotopy groups. The abundance of significant results and deep insight contained in his research and survey papers ranging through topology, several complex variables, and algebraic geometry to number theory, group theory, commutative algebra and modular forms, continues to provide inspiring reading for mathematicians working in these areas, in their research and their teaching. Characteristic of Serre's publications are the many open questions he formulated suggesting further research directions. Four volumes specify how he has provided comments on and corrections to most articles, and described the present status of the open questions with reference to later results. Jean-Pierre Serre is one of a few mathematicians to have won the Fields medal, the Abel prize, and the Wolf prize.

Ordered sets are ubiquitous in mathematics and have significant applications in computer science, statistics, biology and the social sciences. As the first book to deal exclusively with finite ordered sets, this book will be welcomed by graduate students and researchers in all of these areas. Beginning with definitions of key concepts and fundamental results (Dilworth's and Sperner's theorem, interval and semiorders, Galois connection, duality with distributive lattices, coding and dimension theory), the authors then present applications of these structures in fields such as preference modelling and aggregation, operational research and management, cluster and concept analysis, and data mining. Exercises are included at the end of each chapter with helpful hints provided for some of the most difficult examples. The authors also point to further topics of ongoing 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.

This monograph provides the first up-to-date and self-contained presentation of a recently discovered mathematical structure the Schrodinger-Virasoro algebra. Just as Poincare invariance or conformal (Virasoro) invariance play a key role in understanding, respectively, elementary particles and two-dimensional equilibrium statistical physics, this algebra of non-relativistic conformal symmetries may be expected to apply itself naturally to the study of some models of non-equilibrium statistical physics, or more specifically in the context of recent developments related to the non-relativistic AdS/CFT correspondence.

The study of the structure of this infinite-dimensional Lie algebra touches upon topics as various as statistical physics, vertex algebras, Poisson geometry, integrable systems and supergeometry as well as representation theory, the cohomology of infinite-dimensional Lie algebras, and the spectral theory of Schrodinger operators."

First published in 1931, this book is the second edition of a 1917 original. The text provides an account of the method of least squares, aiming to obtain the best interpretation of the results of experiment without consideration of the way in which these results are obtained. Elaborate descriptions of instruments and experimental methods are avoided, allowing for a concise and economical account that concentrates on key elements of the subject. This is a detailed and well-organized book that will be of value to anyone with an interest in least squares and the development of mathematics.

Some recent fuzzy database modeling advances for the non-traditional applications are introduced in this book. The focus is on database models for modeling complex information and uncertainty at the conceptual, logical, physical design levels and from integrity constraints defined on the fuzzy relations.
The database models addressed here are; the conceptual data models, including the ExIFO and ExIFO2 data models, the logical database models, including the extended NF2 database model, fuzzy object-oriented database model, and the fuzzy deductive object-oriented database model. Integrity constraints are defined on the fuzzy relations are also addressed. A continuing reason for the limited adoption of fuzzy database systems has been performance. There have been few efforts at defining physical structures that accomodate fuzzy information. A new access structure and data organization for fuzzy information is introduced in this book.