Floating-point arithmetic is the most widely used way of implementing real-number arithmetic on modern computers. However, making such an arithmetic reliable and portable, yet fast, is a very difficult task. As a result, floating-point arithmetic is far from being exploited to its full potential. This handbook aims to provide a complete overview of modern floating-point arithmetic. So that the techniques presented can be put directly into practice in actual coding or design, they are illustrated, whenever possible, by a corresponding program. The handbook is designed for programmers of numerical applications, compiler designers, programmers of floating-point algorithms, designers of arithmetic operators, and more generally, students and researchers in numerical analysis who wish to better understand a tool used in their daily work and research.

The area of coalgebra has emerged within theoretical computer science with a unifying claim: to be the mathematics of computational dynamics. It combines ideas from the theory of dynamical systems and from the theory of state-based computation. Although still in its infancy, it is an active area of research that generates wide interest. Written by one of the founders of the field, this book acts as the first mature and accessible introduction to coalgebra. It provides clear mathematical explanations, with many examples and exercises involving deterministic and non-deterministic automata, transition systems, streams, Markov chains and weighted automata. The theory is expressed in the language of category theory, which provides the right abstraction to make the similarity and duality between algebra and coalgebra explicit, and which the reader is introduced to in a hands-on manner. The book will be useful to mathematicians and (theoretical) computer scientists and will also be of interest to mathematical physicists, biologists and economists.

Michael Holzhauser discusses generalizations of well-known network flow and packing problems by additional or modified side constraints. By exploiting the inherent connection between the two problem classes, the author investigates the complexity and approximability of several novel network flow and packing problems and presents combinatorial solution and approximation algorithms.

Originally published in 1948, this book was written to provide students with an accessible guide to various elements of mathematics. The text was created for individual working rather than group learning situations. Numerous exercises are included. This book will be of value to anyone with an interest in mathematics and the history of education.

Fourier analysis aims to decompose functions into a superposition of simple trigonometric functions, whose special features can be exploited to isolate specific components into manageable clusters before reassembling the pieces. This two-volume text presents a largely self-contained treatment, comprising not just the major theoretical aspects (Part I) but also exploring links to other areas of mathematics and applications to science and technology (Part II). Following the historical and conceptual genesis, this book (Part I) provides overviews of basic measure theory and functional analysis, with added insight into complex analysis and the theory of distributions. The material is intended for both beginning and advanced graduate students with a thorough knowledge of advanced calculus and linear algebra. Historical notes are provided and topics are illustrated at every stage by examples and exercises, with separate hints and solutions, thus making the exposition useful both as a course textbook and for individual study.

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.

Prime numbers are beautiful, mysterious, and beguiling mathematical objects. The mathematician Bernhard Riemann made a celebrated conjecture about primes in 1859, the so-called Riemann hypothesis, which remains one of the most important unsolved problems in mathematics. Through the deep insights of the authors, this book introduces primes and explains the Riemann hypothesis. Students with a minimal mathematical background and scholars alike will enjoy this comprehensive discussion of primes. The first part of the book will inspire the curiosity of a general reader with an accessible explanation of the key ideas. The exposition of these ideas is generously illuminated by computational graphics that exhibit the key concepts and phenomena in enticing detail. Readers with more mathematical experience will then go deeper into the structure of primes and see how the Riemann hypothesis relates to Fourier analysis using the vocabulary of spectra. Readers with a strong mathematical background will be able to connect these ideas to historical formulations of the Riemann hypothesis.

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

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.

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.

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

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

Providing a timely description of the present state of the art of moduli spaces of curves and their geometry, this volume is written in a way which will make it extremely useful both for young people who want to approach this important field, and also for established researchers, who will find references, problems, original expositions, new viewpoints, etc. The book collects the lecture notes of a number of leading algebraic geometers and in particular specialists in the field of moduli spaces of curves and their geometry. This is an important subject in algebraic geometry and complex analysis which has seen spectacular developments in recent decades, with important applications to other parts of mathematics such as birational geometry and enumerative geometry, and to other sciences, including physics. The themes treated are classical but with a constant look to modern developments (see Cascini, Debarre, Farkas, and Sernesi's contributions), and include very new material, such as Bridgeland stability (see Macri's lecture notes) and tropical geometry (see Chan's lecture notes).

This book contains the proceedings of the 23rd International Workshop on Operator Theory and its Applications (IWOTA 2012), which was held at the University of New South Wales (Sydney, Australia) from 16 July to 20 July 2012. It includes twelve articles presenting both surveys of current research in operator theory and original results.

This ambitious and original book sets out to introduce to mathematicians (even including graduate students ) the mathematical methods of theoretical and experimental quantum field theory, with an emphasis on coordinate-free presentations of the mathematical objects in use. This in turn promotes the interaction between mathematicians and physicists by supplying a common and flexible language for the good of both communities, though mathematicians are the primary target. This reference work provides a coherent and complete mathematical toolbox for classical and quantum field theory, based on categorical and homotopical methods, representing an original contribution to the literature. The first part of the book introduces the mathematical methods needed to work with the physicists' spaces of fields, including parameterized and functional differential geometry, functorial analysis, and the homotopical geometric theory of non-linear partial differential equations, with applications to general gauge theories. The second part presents a large family of examples of classical field theories, both from experimental and theoretical physics, while the third part provides an introduction to quantum field theory, presents various renormalization methods, and discusses the quantization of factorization algebras.

This text offers an extension to the traditional Kripke semantics for non-classical logics by adding the notion of reactivity. Reactive Kripke models change their accessibility relation as we progress in the evaluation process of formulas in the model. This feature makes the reactive Kripke semantics strictly stronger and more applicable than the traditional one. Here we investigate the properties and axiomatisations of this new and most effective semantics, and we offer a wide landscape of applications of the idea of reactivity. Applied topics include reactive automata, reactive grammars, reactive products, reactive deontic logic and reactive preferential structures. Reactive Kripke semantics is the next step in the evolution of possible world semantics for non-classical logics, and this book, written by one of the leading authorities in the field, is essential reading for graduate students and researchers in applied logic, and it offers many research opportunities for PhD students.

The proceedings of the Los Angeles Caltech-UCLA 'Cabal Seminar' were originally published in the 1970s and 1980s. Ordinal Definability and Recursion Theory is the third in a series of four books collecting the seminal papers from the original volumes together with extensive unpublished material, new papers on related topics and discussion of research developments since the publication of the original volumes. Focusing on the subjects of 'HOD and its Local Versions' (Part V) and 'Recursion Theory' (Part VI), each of the two sections is preceded by an introductory survey putting the papers into present context. These four volumes will be a necessary part of the book collection of every set theorist.