This volume covers a wide range of topics that fall under the 'philosophy of quantifiers', a philosophy that spans across multiple areas such as logic, metaphysics, epistemology and even the history of philosophy. It discusses the import of quantifier variance in the model theory of mathematics. It advances an argument for the uniqueness of quantifier meaning in terms of Evert Beth’s notion of implicit definition and clarifies the oldest explicit formulation of quantifier variance: the one proposed by Rudolf Carnap. The volume further examines what it means that a quantifier can have multiple meanings and addresses how existential vagueness can induce vagueness in our modal notions. Finally, the book explores the role played by quantifiers with respect to various kinds of semantic paradoxes, the logicality issue, ontological commitment, and the behavior of quantifiers in intensional contexts.

This book explores the limits of our knowledge. The author shows how uncertainty and indefiniteness not only define the borders confining our understanding, but how they feed into the process of discovery and help to push back these borders. Starting with physics the author collects examples from economics, neurophysiology, history, ecology and philosophy. The first part shows how information helps to reduce indefiniteness. Understanding rests on our ability to find the right context, in which we localize a problem as a point in a network of connections. New elements must be combined with the old parts of the existing complex knowledge system, in order to profit maximally from the information. An attempt is made to quantify the value of information by its ability to reduce indefiniteness. The second part explains how to handle indefiniteness with methods from fuzzy logic, decision theory, hermeneutics and semiotics. It is not sufficient that the new element appears in an experiment, one also has to find a theoretical reason for its existence. Indefiniteness becomes an engine of science, which gives rise to new ideas.

This monograph on the homotopy theory of topologized diagrams of spaces and spectra gives an expert account of a subject at the foundation of motivic homotopy theory and the theory of topological modular forms in stable homotopy theory. Beginning with an introduction to the homotopy theory of simplicial sets and topos theory, the book covers core topics such as the unstable homotopy theory of simplicial presheaves and sheaves, localized theories, cocycles, descent theory, non-abelian cohomology, stacks, and local stable homotopy theory. A detailed treatment of the formalism of the subject is interwoven with explanations of the motivation, development, and nuances of ideas and results. The coherence of the abstract theory is elucidated through the use of widely applicable tools, such as Barr's theorem on Boolean localization, model structures on the category of simplicial presheaves on a site, and cocycle categories. A wealth of concrete examples convey the vitality and importance of the subject in topology, number theory, algebraic geometry, and algebraic K-theory. Assuming basic knowledge of algebraic geometry and homotopy theory, Local Homotopy Theory will appeal to researchers and advanced graduate students seeking to understand and advance the applications of homotopy theory in multiple areas of mathematics and the mathematical sciences.

This thesis is devoted to the study of the Bohman-Frieze-Wormald percolation model, which exhibits a discontinuous transition at the critical threshold, while the phase transitions in random networks are originally considered to be robust continuous phase transitions. The underlying mechanism that leads to the discontinuous transition in this model is carefully analyzed and many interesting critical behaviors, including multiple giant components, multiple phase transitions, and unstable giant components are revealed. These findings should also be valuable with regard to applications in other disciplines such as physics, chemistry and biology.

This is a monograph that details the use of Siegel’s method and the classical results of homotopy groups of spheres and Lie groups to determine some Gottlieb groups of projective spaces or to give the lower bounds of their orders. Making use of the properties of Whitehead products, the authors also determine some Whitehead center groups of projective spaces that are relevant and new within this monograph.

The volume analyses and develops David Makinson’s efforts to make classical logic useful outside its most obvious application areas. The book contains chapters that analyse, appraise, or reshape Makinson’s work and chapters that develop themes emerging from his contributions. These are grouped into major areas to which Makinsons has made highly influential contributions and the volume in its entirety is divided into four sections, each devoted to a particular area of logic: belief change, uncertain reasoning, normative systems and the resources of classical logic. Among the contributions included in the volume, one chapter focuses on the “inferential preferential method�, i.e. the combined use of classical logic and mechanisms of preference and choice and provides examples from Makinson’s work in non-monotonic and defeasible reasoning and belief revision. One chapter offers a short autobiography by Makinson which details his discovery of modern logic, his travels across continents and reveals his intellectual encounters and inspirations. The chapter also contains an unusually explicit statement on his views on the (limited but important) role of logic in philosophy.

This book illustrates the program of Logical-Informational Dynamics. Rational agents exploit the information available in the world in delicate ways, adopt a wide range of epistemic attitudes, and in that process, constantly change the world itself. Logical-Informational Dynamics is about logical systems putting such activities at center stage, focusing on the events by which we acquire information and change attitudes. Its contributions show many current logics of information and change at work, often in multi-agent settings where social behavior is essential, and often stressing Johan van Benthem's pioneering work in establishing this program. However, this is not a Festschrift, but a rich tapestry for a field with a wealth of strands of its own. The reader will see the state of the art in such topics as information update, belief change, preference, learning over time, and strategic interaction in games. Moreover, no tight boundary has been enforced, and some chapters add more general mathematical or philosophical foundations or links to current trends in computer science.   The theme of this book lies at the interface of many disciplines. Logic is the main methodology, but the various chapters cross easily between mathematics, computer science, philosophy, linguistics, cognitive and social sciences, while also ranging from pure theory to empirical work. Accordingly, the authors of this book represent a wide variety of original thinkers from different research communities. And their interconnected themes challenge at the same time how we think of logic, philosophy and computation.   Thus, very much in line with van Benthem's work over many decades, the volume shows how all these disciplines form a natural unity in the perspective of dynamic logicians (broadly conceived) exploring their new themes today. And at the same time, in doing so, it offers a broader conception of logic with a certain grandeur, moving its horizons beyond the traditional study of consequence relations.

This book exclusively deals with the study of almost convergence and statistical convergence of double sequences. The notion of “almost convergence� is perhaps the most useful notion in order to obtain a weak limit of a bounded non-convergent sequence. There is another notion of convergence known as the “statistical convergence�, introduced by H. Fast, which is an extension of the usual concept of sequential limits. This concept arises as an example of “convergence in density� which is also studied as a summability method. Even unbounded sequences can be dealt with by using this method. The book also discusses the applications of these non-matrix methods in approximation theory. Written in a self-contained style, the book discusses in detail the methods of almost convergence and statistical convergence for double sequences along with applications and suitable examples. The last chapter is devoted to the study convergence of double series and describes various convergence tests analogous to those of single sequences. In addition to applications in approximation theory, the results are expected to find application in many other areas of pure and applied mathematics such as mathematical analysis, probability, fixed point theory and statistics.

This volume showcases the best of recent research in the philosophy of science. A compilation of papers presented at the EPSA 13, it explores a broad distribution of topics such as causation, truthlikeness, scientific representation, gender-specific medicine, laws of nature, science funding and the wisdom of crowds. Papers are organised into headings which form the structure of the book. Readers will find that it covers several major fields within the philosophy of science, from general philosophy of science to the more specific philosophy of physics, philosophy of chemistry, philosophy of the life sciences, philosophy of psychology, and philosophy of the social sciences and humanities, amongst others. This volume provides an excellent overview of the state of the art in the philosophy of science, as practiced in different European countries and beyond. It will appeal to researchers with an interest in the philosophical underpinnings of their own discipline, and to philosophers who wish to explore the latest work on the themes explored.

This work is a continuation of the first volume published by Springer in 2011, entitled "A Cp-Theory Problem Book: Topological and Function Spaces." The first volume provided an introduction from scratch to Cp-theory and general topology, preparing the reader for a professional understanding of Cp-theory in the last section of its main text. This present volume covers a wide variety of topics in Cp-theory and general topology at the professional level bringing the reader to the frontiers of modern research. The volume contains 500 problems and exercises with complete solutions. It can also be used as an introduction to advanced set theory and descriptive set theory. The book presents diverse topics of the theory of function spaces with the topology of pointwise convergence, or Cp-theory which exists at the intersection of topological algebra, functional analysis and general topology. Cp-theory has an important role in the classification and unification of heterogeneous results from these areas of research. Moreover, this book gives a reasonably complete coverage of Cp-theory through 500 carefully selected problems and exercises. By systematically introducing each of the major topics of Cp-theory the book is intended to bring a dedicated reader from basic topological principles to the frontiers of modern research.

This volume celebrates the work of Petr Hájek on mathematical fuzzy logic and presents how his efforts have influenced prominent logicians who are continuing his work. The book opens with a discussion on Hájek's contribution to mathematical fuzzy logic and with a scientific biography of him, progresses to include two articles with a foundation flavour, that demonstrate some important aspects of Hájek's production, namely, a paper on the development of fuzzy sets and another paper on some fuzzy versions of set theory and arithmetic. Articles in the volume also focus on the treatment of vagueness, building connections between Hájek's favorite fuzzy logic and linguistic models of vagueness. Other articles introduce alternative notions of consequence relation, namely, the preservation of truth degrees, which is discussed in a general context, and the differential semantics. For the latter, a surprisingly strong standard completeness theorem is proved. Another contribution also looks at two principles valid in classical logic and characterize the three main t-norm logics in terms of these principles. Other articles, with an algebraic flavour, offer a summary of the applications of lattice ordered-groups to many-valued logic and to quantum logic, as well as an investigation of prelinearity in varieties of pointed lattice ordered algebras that satisfy a weak form of distributivity and have a very weak implication. The last part of the volume contains an article on possibilistic modal logics defined over MTL chains, a topic that Hájek discussed in his celebrated work, Metamathematics of Fuzzy Logic, and another one where the authors, besides offering unexpected premises such as proposing to call Hájek's basic fuzzy logic HL, instead of BL, propose a very weak system, called SL as a candidate for the role of the really basic fuzzy logic. The paper also provides a generalization of the prelinearity axiom, which was investigated by Hájek in the context of fuzzy logic.

This volume presents a multi-dimensional collection of articles highlighting recent developments in commutative algebra. It also includes an extensive bibliography and lists a substantial number of open problems that point to future directions of research in the represented subfields. The contributions cover areas in commutative algebra that have flourished in the last few decades and are not yet well represented in book form. Highlighted topics and research methods include Noetherian and non- Noetherian ring theory as well as integer-valued polynomials and functions. Specific topics include: * Homological dimensions of Prufer-like rings * Quasi complete rings * Total graphs of rings * Properties of prime ideals over various rings * Bases for integer-valued polynomials * Boolean subrings * The portable property of domains * Probabilistic topics in Intn(D) * Closure operations in Zariski-Riemann spaces of valuation domains * Stability of domains * Non-Noetherian grade * Homotopy in integer-valued polynomials * Localizations of global properties of rings * Topics in integral closure * Monoids and submonoids of domains The book includes twenty articles written by many of the most prominent researchers in the field. Most contributions are authored by attendees of the conference in commutative algebra held at the Graz University of Technology in December 2012. There is also a small collection of invited articles authored by those who did not attend the conference. Following the model of the Graz conference, the volume contains a number of comprehensive survey articles along with related research articles featuring recent results that have not yet been published elsewhere.

This collection of papers, celebrating the contributions of Swedish logician Dag Prawitz to Proof Theory, has been assembled from those presented at the Natural Deduction conference organized in Rio de Janeiro to honour his  seminal  research. Dag Prawitz’s work forms the basis of intuitionistic type theory and his inversion principle constitutes the foundation of most modern accounts of proof-theoretic semantics in Logic, Linguistics and  Theoretical Computer Science. The range of contributions includes material on the extension of natural deduction with higher-order rules, as opposed to higher-order connectives, and a paper discussing the application of natural deduction rules to dealing with equality in predicate calculus. The volume continues with a key chapter summarizing work on the extension of the Curry-Howard isomorphism (itself a by-product of the work on natural deduction), via methods of category theory that have been successfully applied to linear logic, as well as many other contributions from highly regarded authorities. With an illustrious group of contributors addressing a wealth of topics and applications, this volume is a valuable addition to the libraries of academics in the multiple disciplines whose development has been given added scope by the methodologies supplied by natural deduction. The volume is representative of the rich and varied directions that Prawitz work has inspired in the area of natural deduction.

This volume presents recent advances in philosophical logic with chapters focusing on non-classical logics, including paraconsistent logics, substructural logics, modal logics of agency and other modal logics. The authors cover themes such as the knowability paradox, tableaux and sequent calculi, natural deduction, definite descriptions, identity, truth, dialetheism and possible worlds semantics. The developments presented here focus on challenging problems in the specification of fundamental philosophical notions, as well as presenting new techniques and tools, thereby contributing to the development of the field. Each chapter contains a bibliography, to assist the reader in making connections in the specific areas covered. Thus this work provides both a starting point for further investigations into philosophical logic and an update on advances, techniques and applications in a dynamic field. The chapters originate from papers presented during the Trends in Logic XI conference at the Ruhr University Bochum, June 2012.

We humans are collectively driven by a powerful - yet not fully explained - instinct to understand. We would like to see everything established, proven, laid bare. The more important an issue, the more we desire to see it clarified, stripped of all secrets, all shades of gray. What could be more important than to understand the Universe and ourselves as a part of it? To find a window onto our origin and our destiny? This book examines how far our modern cosmological theories - with their sometimes audacious models, such as inflation, cyclic histories, quantum creation, parallel universes - can take us towards answering these questions. Can such theories lead us to ultimate truths, leaving nothing unexplained? Last, but not least, Heller addresses the thorny problem of why and whether we should expect to find theories with all-encompassing explicative power.

Two prisoners are told that they will be brought to a room and seated so that each can see the other. Hats will be placed on their heads; each hat is either red or green. The two prisoners must simultaneously submit a guess of their own hat color, and they both go free if at least one of them guesses correctly. While no communication is allowed once the hats have been placed, they will, however, be allowed to have a strategy session before being brought to the room. Is there a strategy ensuring their release? The answer turns out to be yes, and this is the simplest non-trivial example of a "hat problem." This book deals with the question of how successfully one can predict the value of an arbitrary function at one or more points of its domain based on some knowledge of its values at other points. Topics range from hat problems that are accessible to everyone willing to think hard, to some advanced topics in set theory and infinitary combinatorics. For example, there is a method of predicting the value f(a) of a function f mapping the reals to the reals, based only on knowledge of f's values on the open interval (a - 1, a), and for every such function the prediction is incorrect only on a countable set that is nowhere dense. The monograph progresses from topics requiring fewer prerequisites to those requiring more, with most of the text being accessible to any graduate student in mathematics. The broad range of readership includes researchers, postdocs, and graduate students in the fields of set theory, mathematical logic, and combinatorics. The hope is that this book will bring together mathematicians from different areas to think about set theory via a very broad array of coordinated inference problems.

The Art of Proof is designed for a one-semester or two-quarter course. A typical student will have studied calculus (perhaps also linear algebra) with reasonable success. With an artful mixture of chatty style and interesting examples, the student's previous intuitive knowledge is placed on solid intellectual ground. The topics covered include: integers, induction, algorithms, real numbers, rational numbers, modular arithmetic, limits, and uncountable sets. Methods, such as axiom, theorem and proof, are taught while discussing the mathematics rather than in abstract isolation. The book ends with short essays on further topics suitable for seminar-style presentation by small teams of students, either in class or in a mathematics club setting. These include: continuity, cryptography, groups, complex numbers, ordinal number, and generating functions.

This volume is the first ever collection devoted to the field of proof-theoretic semantics. Contributions address topics including the systematics of introduction and elimination rules and proofs of normalization, the categorial characterization of deductions, the relation between Heyting's and Gentzen's approaches to meaning, knowability paradoxes, proof-theoretic foundations of set theory, Dummett's justification of logical laws, Kreisel's theory of constructions, paradoxical reasoning, and the defence of model theory. The field of proof-theoretic semantics has existed for almost 50 years, but the term itself was proposed by Schroeder-Heister in the 1980s. Proof-theoretic semantics explains the meaning of linguistic expressions in general and of logical constants in particular in terms of the notion of proof. This volume emerges from presentations at the Second International Conference on Proof-Theoretic Semantics in Tubingen in 2013, where contributing authors were asked to provide a self-contained description and analysis of a significant research question in this area. The contributions are representative of the field and should be of interest to logicians, philosophers, and mathematicians alike.

This textbook addresses the mathematical description of sets, categories, topologies and measures, as part of the basis for advanced areas in theoretical computer science like semantics, programming languages, probabilistic process algebras, modal and dynamic logics and Markov transition systems. Using motivations, rigorous definitions, proofs and various examples, the author systematically introduces the Axiom of Choice, explains Banach-Mazur games and the Axiom of Determinacy, discusses the basic constructions of sets and the interplay of coalgebras and Kripke models for modal logics with an emphasis on Kleisli categories, monads and probabilistic systems. The text further shows various ways of defining topologies, building on selected topics like uniform spaces, Goedel's Completeness Theorem and topological systems. Finally, measurability, general integration, Borel sets and measures on Polish spaces, as well as the coalgebraic side of Markov transition kernels along with applications to probabilistic interpretations of modal logics are presented. Special emphasis is given to the integration of (co-)algebraic and measure-theoretic structures, a fairly new and exciting field, which is demonstrated through the interpretation of game logics. Readers familiar with basic mathematical structures like groups, Boolean algebras and elementary calculus including mathematical induction will discover a wealth of useful research tools. Throughout the book, exercises offer additional information, and case studies give examples of how the techniques can be applied in diverse areas of theoretical computer science and logics. References to the relevant mathematical literature enable the reader to find the original works and classical treatises, while the bibliographic notes at the end of each chapter provide further insights and discussions of alternative approaches.

The purpose of the book is to advance in the understanding of brain function by defining a general framework for representation based on category theory. The idea is to bring this mathematical formalism into the domain of neural representation of physical spaces, setting the basis for a theory of mental representation, able to relate empirical findings, uniting them into a sound theoretical corpus. The innovative approach presented in the book provides a horizon of interdisciplinary collaboration that aims to set up a common agenda that synthesizes mathematical formalization and empirical procedures in a systemic way. Category theory has been successfully applied to qualitative analysis, mainly in theoretical computer science to deal with programming language semantics. Nevertheless, the potential of category theoretic tools for quantitative analysis of networks has not been tackled so far. Statistical methods to investigate graph structure typically rely on network parameters. Category theory can be seen as an abstraction of graph theory. Thus, new categorical properties can be added into network analysis and graph theoretic constructs can be accordingly extended in more fundamental basis. By generalizing networks using category theory we can address questions and elaborate answers in a more fundamental way without waiving graph theoretic tools. The vital issue is to establish a new framework for quantitative analysis of networks using the theory of categories, in which computational neuroscientists and network theorists may tackle in more efficient ways the dynamics of brain cognitive networks. The intended audience of the book is researchers who wish to explore the validity of mathematical principles in the understanding of cognitive systems. All the actors in cognitive science: philosophers, engineers, neurobiologists, cognitive psychologists, computer scientists etc. are akin to discover along its pages new unforeseen connections through the development of concepts and formal theories described in the book. Practitioners of both pure and applied mathematics e.g., network theorists, will be delighted with the mapping of abstract mathematical concepts in the terra incognita of cognition.

This meticulous critical assessment of the ground-breaking work of philosopher Stanislaw Lesniewski focuses exclusively on primary texts and explores the full range of output by one of the master logicians of the Lvov-Warsaw school. The author's nuanced survey eschews secondary commentary, analyzing Lesniewski's core philosophical views and evaluating the formulations that were to have such a profound influence on the evolution of mathematical logic. One of the undisputed leaders of the cohort of brilliant logicians that congregated in Poland in the early twentieth century, Lesniewski was a guide and mentor to a generation of celebrated analytical philosophers (Alfred Tarski was his PhD student). His primary achievement was a system of foundational mathematical logic intended as an alternative to the Principia Mathematica of Alfred North Whitehead and Bertrand Russell. Its three strands-'protothetic', 'ontology', and 'mereology', are detailed in discrete sections of this volume, alongside a wealth other chapters grouped to provide the fullest possible coverage of Lesniewski's academic output. With material on his early philosophical views, his contributions to set theory and his work on nominalism and higher-order quantification, this book offers a uniquely expansive critical commentary on one of analytical philosophy's great pioneers.

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.

This volume is the first systematic and thorough attempt to investigate the relation and the possible applications of mereology to contemporary science. It gathers contributions from leading scholars in the field and covers a wide range of scientific theories and practices such as physics, mathematics, chemistry, biology, computer science and engineering. Throughout the volume, a variety of foundational issues are investigated both from the formal and the empirical point of view. The first section looks at the topic as it applies to physics. The section addresses questions of persistence and composition within quantum and relativistic physics and concludes by scrutinizing the possibility to capture continuity of motion as described by our best physical theories within gunky space times. The second part tackles mathematics and shows how to provide a foundation for point-free geometry of space switching to fuzzy-logic. The relation between mereological sums and set-theoretic suprema is investigated and issues about different mereological perspectives such as classical and natural Mereology are thoroughly discussed. The third section in the volume looks at natural science. Several questions from biology, medicine and chemistry are investigated. From the perspective of biology, there is an attempt to provide axioms for inferring statements about part hood between two biological entities from statements about their spatial relation. From the perspective of chemistry, it is argued that classical mereological frameworks are not adequate to capture the practices of chemistry in that they consider neither temporal nor modal parameters. The final part introduces computer science and engineering. A new formal mereological framework in which an indeterminate relation of part hood is taken as a primitive notion is constructed and then applied to a wide variety of disciplines from robotics to knowledge engineering. A formal framework for discrete mereotopology and its applications is developed and finally, the importance of mereology for the relatively new science of domain engineering is also discussed.

This volume is dedicated to Prof. Dag Prawitz and his outstanding contributions to philosophical and mathematical logic. Prawitz's eminent contributions to structural proof theory, or general proof theory, as he calls it, and inference-based meaning theories have been extremely influential in the development of modern proof theory and anti-realistic semantics. In particular, Prawitz is the main author on natural deduction in addition to Gerhard Gentzen, who defined natural deduction in his PhD thesis published in 1934. The book opens with an introductory paper that surveys Prawitz's numerous contributions to proof theory and proof-theoretic semantics and puts his work into a somewhat broader perspective, both historically and systematically. Chapters include either in-depth studies of certain aspects of Dag Prawitz's work or address open research problems that are concerned with core issues in structural proof theory and range from philosophical essays to papers of a mathematical nature. Investigations into the necessity of thought and the theory of grounds and computational justifications as well as an examination of Prawitz's conception of the validity of inferences in the light of three "dogmas of proof-theoretic semantics" are included. More formal papers deal with the constructive behaviour of fragments of classical logic and fragments of the modal logic S4 among other topics. In addition, there are chapters about inversion principles, normalization of p roofs, and the notion of proof-theoretic harmony and other areas of a more mathematical persuasion. Dag Prawitz also writes a chapter in which he explains his current views on the epistemic dimension of proofs and addresses the question why some inferences succeed in conferring evidence on their conclusions when applied to premises for which one already possesses evidence.

Combinatorial Algebra: Syntax and Semantics provides comprehensive account of many areas of combinatorial algebra. It contains self-contained proofs of more than 20 fundamental results, both classical and modern. This includes Golod-Shafarevich and Olshanskii's solutions of Burnside problems, Shirshov's solution of Kurosh's problem for PI rings, Belov's solution of Specht's problem for varieties of rings, Grigorchuk's solution of Milnor's problem, Bass-Guivarc'h theorem about growth of nilpotent groups, Kleiman's solution of Hanna Neumann's problem for varieties of groups, Adian's solution of von Neumann-Day's problem, Trahtman's solution of the road coloring problem of Adler, Goodwyn and Weiss. The book emphasize several ``universal" tools, such as trees, subshifts, uniformly recurrent words, diagrams and automata. With over 350 exercises at various levels of difficulty and with hints for the more difficult problems, this book can be used as a textbook, and aims to reach a wide and diversified audience. No prerequisites beyond standard courses in linear and abstract algebra are required. The broad appeal of this textbook extends to a variety of student levels: from advanced high-schoolers to undergraduates and graduate students, including those in search of a Ph.D. thesis who will benefit from the "Further reading and open problems" sections at the end of Chapters 2 -5. The book can also be used for self-study, engaging those beyond t he classroom setting: researchers, instructors, students, virtually anyone who wishes to learn and better understand this important area of mathematics.