Spline functions entered Approximation Theory as solutions of natural extremal problems. A typical example is the problem of drawing a function curve through given n + k points that has a minimal norm of its k-th derivative. Isolated facts about the functions, now called splines, can be found in the papers of L. Euler, A. Lebesgue, G. Birkhoff, J. Favard, L. Tschakaloff. However, the Theory of Spline Functions has developed in the last 30 years by the effort of dozens of mathematicians. Recent fundamental results on multivariate polynomial interpolation and multivari ate splines have initiated a new wave of theoretical investigations and variety of applications. The purpose of this book is to introduce the reader to the theory of spline functions. The emphasis is given to some new developments, such as the general Birkoff's type interpolation, the extremal properties of the splines and their prominant role in the optimal recovery of functions, multivariate interpolation by polynomials and splines. The material presented is based on the lectures of the authors, given to the students at the University of Sofia and Yerevan University during the last 10 years. Some more elementary results are left as excercises and detailed hints are given."

Algorithmic Information Theory treats the mathematics of many important areas in digital information processing. It has been written as a read-and-learn book on concrete mathematics, for teachers, students and practitioners in electronic engineering, computer science and mathematics. The presentation is dense, and the examples and exercises are numerous. It is based on lectures on information technology (Data Compaction, Cryptography, Polynomial Coding) for engineers.

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.

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.

In this two-volume compilation of articles, leading researchers reevaluate the success of Hilbert's axiomatic method, which not only laid the foundations for our understanding of modern mathematics, but also found applications in physics, computer science and elsewhere. The title takes its name from David Hilbert's seminal talk Axiomatisches Denken, given at a meeting of the Swiss Mathematical Society in Zurich in 1917. This marked the beginning of Hilbert's return to his foundational studies, which ultimately resulted in the establishment of proof theory as a new branch in the emerging field of mathematical logic. Hilbert also used the opportunity to bring Paul Bernays back to Goettingen as his main collaborator in foundational studies in the years to come. The contributions are addressed to mathematical and philosophical logicians, but also to philosophers of science as well as physicists and computer scientists with an interest in foundations.

Features Provides a uniquely historical perspective on the mathematical underpinnings of a comprehensive list of games Suitable for a broad audience of differing mathematical levels. Anyone with a passion for games, game theory, and mathematics will enjoy this book, whether they be students, academics, or game enthusiasts Covers a wide selection of topics at a level that can be appreciated on a historical, recreational, and mathematical level.

Model theory is used in every theoretical branch of analytic philosophy: in philosophy of mathematics, in philosophy of science, in philosophy of language, in philosophical logic, and in metaphysics. But these wide-ranging uses of model theory have created a highly fragmented literature. On the one hand, many philosophically significant results are found only in mathematics textbooks: these are aimed squarely at mathematicians; they typically presuppose that the reader has a serious background in mathematics; and little clue is given as to their philosophical significance. On the other hand, the philosophical applications of these results are scattered across disconnected pockets of papers. The first aim of this book, then, is to explore the philosophical uses of model theory, focusing on the central topics of reference, realism, and doxology. Its second aim is to address important questions in the philosophy of model theory, such as: sameness of theories and structure, the boundaries of logic, and the classification of mathematical structures. Philosophy and Model Theory will be accessible to anyone who has completed an introductory logic course. It does not assume that readers have encountered model theory before, but starts right at the beginning, discussing philosophical issues that arise even with conceptually basic model theory. Moreover, the book is largely self-contained: model-theoretic notions are defined as and when they are needed for the philosophical discussion, and many of the most philosophically significant results are given accessible proofs.

Stig Kanger (1924-1988) made important contributions to logic and formal philosophy. Kanger's dissertation Provability in Logic, 1957, contained significant results in proof theory as well as the first fully worked out model-theoretic interpretation of quantified modal logic. It is generally accepted nowadays that Kanger was one of the originators of possible worlds semantics for modal logic. Kanger's most original achievements were in the areas of general proof theory, the semantics of modal and deontic logic, and the logical analysis of the concept of rights. He also contributed to action theory, preference logic, and the theory of measurement. This is the first of two volumes dedicated to the work of Stig Kanger. The present volume is a complete collection of Kanger's philosophical papers. The second volume contains critical essays on Kanger's work, as well as biographical essays on Kanger written by colleagues and friends.

The modern theory of algebras of binary relations, reformulated by Tarski as an abstract, algebraic, equational theory of relation algebras, has considerable mathematical significance, with applications in various fields: e.g., in computer science---databases, specification theory, AI---and in anthropology, economics, physics, and philosophical logic.
This comprehensive treatment of the theory of relation algebras and the calculus of relations is the first devoted to a systematic development of the subject.
Key Features:
- Presents historical milestones from a modern perspective
- Careful, thorough, detailed guide to understanding relation algebras
- Provides a framework and unified perspective of the subject

This second volume of the book series shows R-calculus is a combination of one monotonic tableau proof system and one non-monotonic one. The R-calculus is a Gentzen-type deduction system which is non-monotonic, and is a concrete belief revision operator which is proved to satisfy the AGM postulates and the DP postulates. It discusses the algebraical and logical properties of tableau proof systems and R-calculi in many-valued logics. This book offers a rich blend of theory and practice. It is suitable for students, researchers and practitioners in the field of logic. Also it is very useful for all those who are interested in data, digitization and correctness and consistency of information, in modal logics, non monotonic logics, decidable/undecidable logics, logic programming, description logics, default logics and semantic inheritance networks.

Logic plays a central conceptual role in modern mathematics. However, mathematical logic has grown into one of the most recondite areas of mathematics. As a result, most of modern logic is inaccessible to all but the specialist. This new book is a resource that provides a quick introduction and review of the key topics in logic for the computer scientist, engineer, or mathematician.

Handbook of Logic and Proof Techniques for Computer Science presents the elements of modern logic, including many current topics, to the reader having only basic mathematical literacy. Computer scientists will find specific examples and important ideas such as axiomatics, recursion theory, decidability, independence, completeness, consistency, model theory, and P/NP completeness. The book contains definitions, examples and discussion of all of the key ideas in basic logic, but also makes a special effort to cut through the mathematical formalism, difficult notation, and esoteric terminology that is typical of modern mathematical logic. T

This handbook delivers cogent and self-contained introductions to critical advanced topics, including:

* Godels completeness and incompleteness theorems

* Methods of proof, cardinal and ordinal numbers, the continuum hypothesis, the axiom of choice, model theory, and number systems and their construction

* Extensive treatment of complexity theory and programming applications

* Applications to algorithms in Boolean algebra

* Discussion of set theory and applications of logic

The book is an excellent resource for the working mathematical scientist. The graduate student or professional in computer science and engineering or the systems scientist whoneeds to have a quick sketch of a key idea from logic will find it here in this self-contained, accessible, and easy-to-use reference.

This book offers an original introduction to the representation theory of algebras, suitable for beginning researchers in algebra. It includes many results and techniques not usually covered in introductory books, some of which appear here for the first time in book form. The exposition employs methods from linear algebra (spectral methods and quadratic forms), as well as categorical and homological methods (module categories, Galois coverings, Hochschild cohomology) to present classical aspects of ring theory under new light. This includes topics such as rings with several objects, the Harada-Sai lemma, chain conditions, and Auslander-Reiten theory. Noteworthy and significant results covered in the book include the Brauer-Thrall conjectures, Drozd's theorem, and criteria to distinguish tame from wild algebras. This text may serve as the basis for a second graduate course in algebra or as an introduction to research in the field of representation theory of algebras. The originality of the exposition and the wealth of topics covered also make it a valuable resource for more established researchers.

This book gives a comprehensive introduction to Universal Algebraic Logic. The three main themes are (i) universal logic and the question of what logic is, (ii) duality theories between the world of logics and the world of algebra, and (iii) Tarskian algebraic logic proper including algebras of relations of various ranks, cylindric algebras, relation algebras, polyadic algebras and other kinds of algebras of logic. One of the strengths of our approach is that it is directly applicable to a wide range of logics including not only propositional logics but also e.g. classical first order logic and other quantifier logics. Following the Tarskian tradition, besides the connections between logic and algebra, related logical connections with geometry and eventually spacetime geometry leading up to relativity are also part of the perspective of the book. Besides Tarskian algebraizations of logics, category theoretical perspectives are also touched upon. This book, apart from being a monograph containing state of the art results in algebraic logic, can be used as the basis for a number of different courses intended for both novices and more experienced students of logic, mathematics, or philosophy. For instance, the first two chapters can be used in their own right as a crash course in Universal Algebra.

This monograph shows that, through a recourse to the concepts and methods of abstract algebraic logic, the algebraic theory of regular varieties and the concept of analyticity in formal logic can profitably interact. By extending the technique of Plonka sums from algebras to logical matrices, the authors investigate the different classes of models for logics of variable inclusion and they shed new light into their formal properties. The book opens with the historical origins of logics of variable inclusion and on their philosophical motivations. It includes the basics of the algebraic theory of regular varieties and the construction of Plonka sums over semilattice direct systems of algebra. The core of the book is devoted to an abstract definition of logics of left and right variable inclusion, respectively, and the authors study their semantics using the construction of Plonka sums of matrix models. The authors also cover Paraconsistent Weak Kleene logic and survey its abstract algebraic logical properties. This book is of interest to scholars of formal logic.

1. The ?rst edition of this book was published in 1977. The text has been well received and is still used, although it has been out of print for some time. In the intervening three decades, a lot of interesting things have happened to mathematical logic: (i) Model theory has shown that insights acquired in the study of formal languages could be used fruitfully in solving old problems of conventional mathematics. (ii) Mathematics has been and is moving with growing acceleration from the set-theoretic language of structures to the language and intuition of (higher) categories, leaving behind old concerns about in?nities: a new view of foundations is now emerging. (iii) Computer science, a no-nonsense child of the abstract computability theory, has been creatively dealing with old challenges and providing new ones, such as the P/NP problem. Planning additional chapters for this second edition, I have decided to focus onmodeltheory, the conspicuousabsenceofwhichinthe ?rsteditionwasnoted in several reviews, and the theory of computation, including its categorical and quantum aspects. The whole Part IV: Model Theory, is new. I am very grateful to Boris I. Zilber, who kindly agreed to write it. It may be read directly after Chapter II. The contents of the ?rst edition are basically reproduced here as Chapters I-VIII. Section IV.7, on the cardinality of the continuum, is completed by Section IV.7.3, discussing H. Woodin's discovery.

This monograph looks at causal nets from a philosophical point of view. The author shows that one can build a general philosophical theory of causation on the basis of the causal nets framework that can be fruitfully used to shed new light on philosophical issues. Coverage includes both a theoretical as well as application-oriented approach to the subject. The author first counters David Hume's challenge about whether causation is something ontologically real. The idea behind this is that good metaphysical concepts should behave analogously to good theoretical concepts in scientific theories. In the process, the author offers support for the theory of causal nets as indeed being a correct theory of causation. Next, the book offers an application-oriented approach to the subject. The author shows that causal nets can investigate philosophical issues related to causation. He does this by means of two exemplary applications. The first consists of an evaluation of Jim Woodward's interventionist theory of causation. The second offers a contribution to the new mechanist debate. Introductory chapters outline all the formal basics required. This helps make the book useful for those who are not familiar with causal nets, but interested in causation or in tools for the investigation of philosophical issues related to causation.

Games, Norms, and Reasons: Logic at the Crossroads provides an overview of modern logic focusing on its relationships with other disciplines, including new interfaces with rational choice theory, epistemology, game theory and informatics. This book continues a series called "Logic at the Crossroads" whose title reflects a view that the deep insights from the classical phase of mathematical logic can form a harmonious mixture with a new, more ambitious research agenda of understanding and enhancing human reasoning and intelligent interaction. The editors have gathered together articles from active authors in this new area that explore dynamic logical aspects of norms, reasons, preferences and beliefs in human agency, human interaction and groups. The book pays a special tribute to Professor Rohit Parikh, a pioneer in this movement.

Can you really keep your eye on the ball? How is massive data collection changing sports? Sports science courses are growing in popularity. The author's course at Roanoke College is a mix of physics, physiology, mathematics, and statistics. Many students of both genders find it exciting to think about sports. Sports problems are easy to create and state, even for students who do not live sports 24/7. Sports are part of their culture and knowledge base, and the opportunity to be an expert on some area of sports is invigorating. This should be the primary reason for the growth of mathematics of sports courses: the topic provides intrinsic motivation for students to do their best work. From the Author: "The topics covered in Sports Science and Sports Analytics courses vary widely. To use a golfing analogy, writing a book like this is like hitting a drive at a driving range; there are many directions you can go without going out of bounds. At the driving range, I pick out a small target to focus on, and that is what I have done here. I have chosen a sample of topics I find very interesting. Ideally, users of this book will have enough to choose from to suit whichever version of a sports course is being run." "The book is very appealing to teach from as well as to learn from. Students seem to have a growing interest in ways to apply traditionally different areas to solve problems. This, coupled with an enthusiasm for sports, makes Dr. Minton's book appealing to me."-Kevin Hutson, Furman University

After the pioneering works by Robbins {1944, 1945) and Choquet (1955), the notation of a set-valued random variable (called a random closed set in literatures) was systematically introduced by Kendall {1974) and Matheron {1975). It is well known that the theory of set-valued random variables is a natural extension of that of general real-valued random variables or random vectors. However, owing to the topological structure of the space of closed sets and special features of set-theoretic operations ( cf. Beer [27]), set-valued random variables have many special properties. This gives new meanings for the classical probability theory. As a result of the development in this area in the past more than 30 years, the theory of set-valued random variables with many applications has become one of new and active branches in probability theory. In practice also, we are often faced with random experiments whose outcomes are not numbers but are expressed in inexact linguistic terms.

Proof theory and category theory were first drawn together by Lambek some 30 years ago but, until now, the most fundamental notions of category theory (as opposed to their embodiments in logic) have not been explained systematically in terms of proof theory. Here it is shown that these notions, in particular the notion of adjunction, can be formulated in such as way as to be characterised by composition elimination. Among the benefits of these composition-free formulations are syntactical and simple model-theoretical, geometrical decision procedures for the commuting of diagrams of arrows. Composition elimination, in the form of Gentzen's cut elimination, takes in categories, and techniques inspired by Gentzen are shown to work even better in a purely categorical context than in logic. An acquaintance with the basic ideas of general proof theory is relied on only for the sake of motivation, however, and the treatment of matters related to categories is also in general self contained. Besides familiar topics, presented in a novel, simple way, the monograph also contains new results. It can be used as an introductory text in categorical proof theory.

This book offers an up-to-date, comprehensive account of determinantal rings and varieties, presenting a multitude of methods used in their study, with tools from combinatorics, algebra, representation theory and geometry. After a concise introduction to Groebner and Sagbi bases, determinantal ideals are studied via the standard monomial theory and the straightening law. This opens the door for representation theoretic methods, such as the Robinson-Schensted-Knuth correspondence, which provide a description of the Groebner bases of determinantal ideals, yielding homological and enumerative theorems on determinantal rings. Sagbi bases then lead to the introduction of toric methods. In positive characteristic, the Frobenius functor is used to study properties of singularities, such as F-regularity and F-rationality. Castelnuovo-Mumford regularity, an important complexity measure in commutative algebra and algebraic geometry, is introduced in the general setting of a Noetherian base ring and then applied to powers and products of ideals. The remainder of the book focuses on algebraic geometry, where general vanishing results for the cohomology of line bundles on flag varieties are presented and used to obtain asymptotic values of the regularity of symbolic powers of determinantal ideals. In characteristic zero, the Borel-Weil-Bott theorem provides sharper results for GL-invariant ideals. The book concludes with a computation of cohomology with support in determinantal ideals and a survey of their free resolutions. Determinants, Groebner Bases and Cohomology provides a unique reference for the theory of determinantal ideals and varieties, as well as an introduction to the beautiful mathematics developed in their study. Accessible to graduate students with basic grounding in commutative algebra and algebraic geometry, it can be used alongside general texts to illustrate the theory with a particularly interesting and important class of varieties.

Arising from the 1996 Cape Town conference in honour of the mathematician Bernhard Banaschewski, this collection of 30 refereed papers represents current developments in category theory, topology, topos theory, universal algebra, model theory, and diverse ordered and algebraic structures. Banaschewski's influence is reflected here, particularly in the contributions to pointfree topology at the levels of nearness, uniformity, and asymmetry. The unifying theme of the volume is the application of categorical methods. The contributing authors are: D. Baboolar, P. Bankston, R. Betti, D. Bourn, P. Cherenack, D. Dikranjan/H.-P. KA1/4nzi, X. Dong/W. Tholen, M. ErnA(c), T.H. Fay, T.H. Fay/S.V. Joubert, D.N. Georgiou/B.K. Papadopoulos, K.A. Hardie/K.H. Kamps/R.W. Kieboom, H. Herrlich/A. Pultr, K.M. Hofmann, S.S. Hong/Y.K. Kim, J. Isbell, R. Jayewardene/O. Wyler, P. Johnstone, R. Lowen/P. Wuyts, E. Lowen-Colebunders/C. Verbeeck, R. Nailana, J. Picado, T. Plewe, J. Reinhold, G. Richter, H. RArl, S.-H. Sun, Tozzi/V. TrnkovA, V. Valov/D. Vuma, and S. Veldsman. Audience: This volume will be of interest to mathematicians whose research involves category theory and its applications to topology, order, and algebra.

This third volume of the book series shows R-calculus is a Gentzen-typed deduction system which is non-monotonic, and is a concrete belief revision operator which is proved to satisfy the AGM postulates and the DP postulates. In this book, R-calculus is taken as Tableau-based/sequent-based/multisequent-based to preserve the satisfiability of the Theory/sequent/multisequent to revise, or sequent-based, to preserve the satisfiability of the sequent to revise. The R-calculi for Post and three-valued logic is given. This book offers a rich blend of theory and practice. It is suitable for students, researchers and practitioners in the field of logic.

In these essays Geoffrey Hellman presents a strong case for a healthy pluralism in mathematics and its logics, supporting peaceful coexistence despite what appear to be contradictions between different systems, and positing different frameworks serving different legitimate purposes. The essays refine and extend Hellman's modal-structuralist account of mathematics, developing a height-potentialist view of higher set theory which recognizes indefinite extendability of models and stages at which sets occur. In the first of three new essays written for this volume, Hellman shows how extendability can be deployed to derive the axiom of Infinity and that of Replacement, improving on earlier accounts; he also shows how extendability leads to attractive, novel resolutions of the set-theoretic paradoxes. Other essays explore advantages and limitations of restrictive systems - nominalist, predicativist, and constructivist. Also included are two essays, with Solomon Feferman, on predicative foundations of arithmetic.

Problems books are popular with instructors and students alike, as well as among general readers. The key to this book is the many alternative solutions to single problems. Mathematics educators, secondary mathematics teachers, and university instructors will find the book interesting and useful.

The approach to probability theory followed in this book (which differs radically from the usual one, based on a measure-theoretic framework) characterizes probability as a linear operator rather than as a measure, and is based on the concept of coherence, which can be framed in the most general view of conditional probability. It is a flexible' and unifying tool suited for handling, e.g., partial probability assessments (not requiring that the set of all possible outcomes' be endowed with a previously given algebraic structure, such as a Boolean algebra), and conditional independence, in a way that avoids all the inconsistencies related to logical dependence (so that a theory referring to graphical models more general than those usually considered in bayesian networks can be derived). Moreover, it is possible to encompass other approaches to uncertain reasoning, such as fuzziness, possibility functions, and default reasoning.
The book is kept self-contained, provided the reader is familiar with the elementary aspects of propositional calculus, linear algebra, and analysis.