The contributions gathered here demonstrate how categorical ontology can provide a basis for linking three important basic sciences: mathematics, physics, and philosophy. Category theory is a new formal ontology that shifts the main focus from objects to processes. The book approaches formal ontology in the original sense put forward by the philosopher Edmund Husserl, namely as a science that deals with entities that can be exemplified in all spheres and domains of reality. It is a dynamic, processual, and non-substantial ontology in which all entities can be treated as transformations, and in which objects are merely the sources and aims of these transformations. Thus, in a rather surprising way, when employed as a formal ontology, category theory can unite seemingly disparate disciplines in contemporary science and the humanities, such as physics, mathematics and philosophy, but also computer and complex systems science.

Since its inception, fuzzy logic has attracted an incredible amount of interest, and this interest continues to grow at an exponential rate. As such, scientists, researchers, educators and practitioners of fuzzy logic continue to expand on the applicability of what and how fuzzy can be utilised in the real-world. In this book, the authors present key application areas where fuzzy has had significant success. The chapters cover a plethora of application domains, proving credence to the versatility and robustness of a fuzzy approach. A better understanding of fuzzy will ultimately allow for a better appreciation of fuzzy. This book provides the reader with a varied range of examples to illustrate what fuzzy logic can be capable of and how it can be applied. The text will be ideal for individuals new to the notion of fuzzy, as well as for early career academics who wish to further expand on their knowledge of fuzzy applications. The book is also suitable as a supporting text for advanced undergraduate and graduate-level modules on fuzzy logic, soft computing, and applications of AI.

Fuzzy logics are many-valued logics that are well suited to reasoning in the context of vagueness. They provide the basis for the wider field of Fuzzy Logic, encompassing diverse areas such as fuzzy control, fuzzy databases, and fuzzy mathematics. This book provides an accessible and up-to-date introduction to this fast-growing and increasingly popular area. It focuses in particular on the development and applications of "proof-theoretic" presentations of fuzzy logics; the result of more than ten years of intensive work by researchers in the area, including the authors. In addition to providing alternative elegant presentations of fuzzy logics, proof-theoretic methods are useful for addressing theoretical problems (including key standard completeness results) and developing efficient deduction and decision algorithms. Proof-theoretic presentations also place fuzzy logics in the broader landscape of non-classical logics, revealing deep relations with other logics studied in Computer Science, Mathematics, and Philosophy. The book builds methodically from the semantic origins of fuzzy logics to proof-theoretic presentations such as Hilbert and Gentzen systems, introducing both theoretical and practical applications of these presentations.

This book is the first systematic treatment of this area so far scattered in a vast number of articles. As in classical topology, concrete problems require restricting the (generalized point-free) spaces by various conditions playing the roles of classical separation axioms. These are typically formulated in the language of points; but in the point-free context one has either suitable translations, parallels, or satisfactory replacements. The interrelations of separation type conditions, their merits, advantages and disadvantages, and consequences are discussed. Highlights of the book include a treatment of the merits and consequences of subfitness, various approaches to the Hausdorff's axiom, and normality type axioms. Global treatment of the separation conditions put them in a new perspective, and, a.o., gave some of them unexpected importance. The text contains a lot of quite recent results; the reader will see the directions the area is taking, and may find inspiration for her/his further work. The book will be of use for researchers already active in the area, but also for those interested in this growing field (sometimes even penetrating into some parts of theoretical computer science), for graduate and PhD students, and others. For the reader's convenience, the text is supplemented with an Appendix containing necessary background on posets, frames and locales.

Mathematical Puzzle Tales from Mount Olympus uses fascinating tales from Greek Mythology as the background for introducing mathematics puzzles to the general public. A background in high school mathematics will be ample preparation for using this book, and it should appeal to anyone who enjoys puzzles and recreational mathematics. Features: Combines the arts and science, and emphasizes the fact that mathematics straddles both domains. Great resource for students preparing for mathematics competitions, and the trainers of such students.

Provides an in-depth treatment of the Traveling Salesman problem--the archetypical problem in combinatorial optimization. Each chapter deals with a different aspect of the problem, and has been written by an acknowledged expert in the field. Focusses on the essential ideas in a self-contained manner. Includes exercises and an extensive bibliography.

This undergraduate textbook promotes an active transition to higher mathematics. Problem solving is the heart and soul of this book: each problem is carefully chosen to demonstrate, elucidate, or extend a concept. More than 300 exercises engage the reader in extensive arguments and creative approaches, while exploring connections between fundamental mathematical topics. Divided into four parts, this book begins with a playful exploration of the building blocks of mathematics, such as definitions, axioms, and proofs. A study of the fundamental concepts of logic, sets, and functions follows, before focus turns to methods of proof. Having covered the core of a transition course, the author goes on to present a selection of advanced topics that offer opportunities for extension or further study. Throughout, appendices touch on historical perspectives, current trends, and open questions, showing mathematics as a vibrant and dynamic human enterprise. This second edition has been reorganized to better reflect the layout and curriculum of standard transition courses. It also features recent developments and improved appendices. An Invitation to Abstract Mathematics is ideal for those seeking a challenging and engaging transition to advanced mathematics, and will appeal to both undergraduates majoring in mathematics, as well as non-math majors interested in exploring higher-level concepts. From reviews of the first edition: Bajnok's new book truly invites students to enjoy the beauty, power, and challenge of abstract mathematics. ... The book can be used as a text for traditional transition or structure courses ... but since Bajnok invites all students, not just mathematics majors, to enjoy the subject, he assumes very little background knowledge. Jill Dietz, MAA ReviewsThe style of writing is careful, but joyously enthusiastic.... The author's clear attitude is that mathematics consists of problem solving, and that writing a proof falls into this category. Students of mathematics are, therefore, engaged in problem solving, and should be given problems to solve, rather than problems to imitate. The author attributes this approach to his Hungarian background ... and encourages students to embrace the challenge in the same way an athlete engages in vigorous practice. John Perry, zbMATH

This book is dedicated to V.A. Yankov's seminal contributions to the theory of propositional logics. His papers, published in the 1960s, are highly cited even today. The Yankov characteristic formulas have become a very useful tool in propositional, modal and algebraic logic. The papers contributed to this book provide the new results on different generalizations and applications of characteristic formulas in propositional, modal and algebraic logics. In particular, an exposition of Yankov's results and their applications in algebraic logic, the theory of admissible rules and refutation systems is included in the book. In addition, the reader can find the studies on splitting and join-splitting in intermediate propositional logics that are based on Yankov-type formulas which are closely related to canonical formulas, and the study of properties of predicate extensions of non-classical propositional logics. The book also contains an exposition of Yankov's revolutionary approach to constructive proof theory. The editors also include Yankov's contributions to history and philosophy of mathematics and foundations of mathematics, as well as an examination of his original interpretation of history of Greek philosophy and mathematics.

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

This book features a series of lectures that explores three different fields in which functor homology (short for homological algebra in functor categories) has recently played a significant role. For each of these applications, the functor viewpoint provides both essential insights and new methods for tackling difficult mathematical problems. In the lectures by Aurelien Djament, polynomial functors appear as coefficients in the homology of infinite families of classical groups, e.g. general linear groups or symplectic groups, and their stabilization. Djament's theorem states that this stable homology can be computed using only the homology with trivial coefficients and the manageable functor homology. The series includes an intriguing development of Scorichenko's unpublished results. The lectures by Wilberd van der Kallen lead to the solution of the general cohomological finite generation problem, extending Hilbert's fourteenth problem and its solution to the context of cohomology. The focus here is on the cohomology of algebraic groups, or rational cohomology, and the coefficients are Friedlander and Suslin's strict polynomial functors, a conceptual form of modules over the Schur algebra. Roman Mikhailov's lectures highlight topological invariants: homoto py and homology of topological spaces, through derived functors of polynomial functors. In this regard the functor framework makes better use of naturality, allowing it to reach calculations that remain beyond the grasp of classical algebraic topology. Lastly, Antoine Touze's introductory course on homological algebra makes the book accessible to graduate students new to the field. The links between functor homology and the three fields mentioned above offer compelling arguments for pushing the development of the functor viewpoint. The lectures in this book will provide readers with a feel for functors, and a valuable new perspective to apply to their favourite problems.

Kurt Goedel (1906-1978) shook the mathematical world in 1931 by a result that has become an icon of 20th century science: The search for rigour in proving mathematical theorems had led to the formalization of mathematical proofs, to the extent that such proving could be reduced to the application of a few mechanical rules. Goedel showed that whenever the part of mathematics under formalization contains elementary arithmetic, there will be arithmetical statements that should be formally provable but aren't. The result is known as Goedel's first incompleteness theorem, so called because there is a second incompleteness result, embodied in his answer to the question "Can mathematics be proved consistent?" This book offers the first examination of Goedel's preserved notebooks from 1930, written in a long-forgotten German shorthand, that show his way to the results: his first ideas, how they evolved, and how the jewel-like final presentation in his famous publication On formally undecidable propositions was composed.The book also contains the original version of Goedel's incompleteness article, as handed in for publication with no mentioning of the second incompleteness theorem, as well as six contemporary lectures and seminars Goedel gave between 1931 and 1934 in Austria, Germany, and the United States. The lectures are masterpieces of accessible presentations of deep scientific results, readable even for those without special mathematical training, and published here for the first time.

The Bittinger Worktext Series changed the face of developmental education with the introduction of objective-based worktexts that presented math one concept at a time. This approach allowed students to understand the rationale behind each concept before practicing the associated skills and then moving on to the next topic. With this revision, Marv Bittinger continues to focus on building success through conceptual understanding, while also supporting students with quality applications, exercises, and new review and study materials to help them apply and retain their knowledge.

MATRIX is Australia's international, residential mathematical research institute. It facilitates new collaborations and mathematical advances through intensive residential research programs, each lasting 1-4 weeks. This book is a scientific record of the five programs held at MATRIX in its first year, 2016: - Higher Structures in Geometry and Physics - Winter of Disconnectedness - Approximation and Optimisation - Refining C*-Algebraic Invariants for Dynamics using KK-theory - Interactions between Topological Recursion, Modularity, Quantum Invariants and Low- dimensional Topology The MATRIX Scientific Committee selected these programs based on their scientific excellence and the participation rate of high-profile international participants. Each program included ample unstructured time to encourage collaborative research; some of the longer programs also included an embedded conference or lecture series. The articles are grouped into peer-reviewed contributions and other contributions. The peer-reviewed articles present original results or reviews on selected topics related to the MATRIX program; the remaining contributions are predominantly lecture notes based on talks or activities at MATRIX.

This book demonstrates how to formally model various mathematical domains (including algorithms operating in these domains) in a way that makes them amenable to a fully automatic analysis by computer software.The presented domains are typically investigated in discrete mathematics, logic, algebra, and computer science; they are modeled in a formal language based on first-order logic which is sufficiently rich to express the core entities in whose correctness we are interested: mathematical theorems and algorithmic specifications. This formal language is the language of RISCAL, a “mathematical model checker” by which the validity of all formulas and the correctness of all algorithms can be automatically decided. The RISCAL software is freely available; all formal contents presented in the book are given in the form of specification files by which the reader may interact with the software while studying the corresponding book material.

This book is a collection of contributions honouring Arnon Avron's seminal work on the semantics and proof theory of non-classical logics. It includes presentations of advanced work by some of the most esteemed scholars working on semantic and proof-theoretical aspects of computer science logic. Topics in this book include frameworks for paraconsistent reasoning, foundations of relevance logics, analysis and characterizations of modal logics and fuzzy logics, hypersequent calculi and their properties, non-deterministic semantics, algebraic structures for many-valued logics, and representations of the mechanization of mathematics. Avron's foundational and pioneering contributions have been widely acknowledged and adopted by the scientific community. His research interests are very broad, spanning over proof theory, automated reasoning, non-classical logics, foundations of mathematics, and applications of logic in computer science and artificial intelligence. This is clearly reflected by the diversity of topics discussed in the chapters included in this book, all of which directly relate to Avron's past and present works. This book is of interest to computer scientists and scholars of formal logic.

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

This volume provides an introduction to the properties of functional differential equations and their applications in diverse fields such as immunology, nuclear power generation, heat transfer, signal processing, medicine and economics. In particular, it deals with problems and methods relating to systems having a memory (hereditary systems). The book contains eight chapters. Chapter 1 explains where functional differential equations come from and what sort of problems arise in applications. Chapter 2 gives a broad introduction to the basic principle involved and deals with systems having discrete and distributed delay. Chapters 3-5 are devoted to stability problems for retarded, neutral and stochastic functional differential equations. Problems of optimal control and estimation are considered in Chapters 6-8. For applied mathematicians, engineers, and physicists whose work involves mathematical modeling of hereditary systems. This volume can also be recommended as a supplementary text for graduate students who wish to become better acquainted with the properties and applications of functional differential equations.

The book offers a collection of essays on various aspects of Leibniz's scientific thought, written by historians of science and world-leading experts on Leibniz. The essays deal with a vast array of topics on the exact sciences: Leibniz's logic, mereology, the notion of infinity and cardinality, the foundations of geometry, the theory of curves and differential geometry, and finally dynamics and general epistemology. Several chapters attempt a reading of Leibniz's scientific works through modern mathematical tools, and compare Leibniz's results in these fields with 19th- and 20th-Century conceptions of them. All of them have special care in framing Leibniz's work in historical context, and sometimes offer wider historical perspectives that go much beyond Leibniz's researches. A special emphasis is given to effective mathematical practice rather than purely epistemological thought. The book is addressed to all scholars of the exact sciences who have an interest in historical research and Leibniz in particular, and may be useful to historians of mathematics, physics, and epistemology, mathematicians with historical interests, and philosophers of science at large.

Introduction to Mathematical Modeling helps students master the processes used by scientists and engineers to model real-world problems, including the challenges posed by space exploration, climate change, energy sustainability, chaotic dynamical systems and random processes. Primarily intended for students with a working knowledge of calculus but minimal training in computer programming in a first course on modeling, the more advanced topics in the book are also useful for advanced undergraduate and graduate students seeking to get to grips with the analytical, numerical, and visual aspects of mathematical modeling, as well as the approximations and abstractions needed for the creation of a viable model.

For a brief time in history, it was possible to imagine that a sufficiently advanced intellect could, given sufficient time and resources, in principle understand how to mathematically prove everything that was true. They could discern what math corresponds to physical laws, and use those laws to predict anything that happens before it happens. That time has passed. Goedel's undecidability results (the incompleteness theorems), Turing's proof of non-computable values, the formulation of quantum theory, chaos, and other developments over the past century have shown that there are rigorous arguments limiting what we can prove, compute, and predict. While some connections between these results have come to light, many remain obscure, and the implications are unclear. Are there, for example, real consequences for physics - including quantum mechanics - of undecidability and non-computability? Are there implications for our understanding of the relations between agency, intelligence, mind, and the physical world? This book, based on the winning essays from the annual FQXi competition, contains ten explorations of Undecidability, Uncomputability, and Unpredictability. The contributions abound with connections, implications, and speculations while undertaking rigorous but bold and open-minded investigation of the meaning of these constraints for the physical world, and for us as humans.

Cyber-physical systems (CPSs) combine cyber capabilities, such as computation or communication, with physical capabilities, such as motion or other physical processes. Cars, aircraft, and robots are prime examples, because they move physically in space in a way that is determined by discrete computerized control algorithms. Designing these algorithms is challenging due to their tight coupling with physical behavior, while it is vital that these algorithms be correct because we rely on them for safety-critical tasks. This textbook teaches undergraduate students the core principles behind CPSs. It shows them how to develop models and controls; identify safety specifications and critical properties; reason rigorously about CPS models; leverage multi-dynamical systems compositionality to tame CPS complexity; identify required control constraints; verify CPS models of appropriate scale in logic; and develop an intuition for operational effects. The book is supported with homework exercises, lecture videos, and slides.

While it is well known that the Delian problems are impossible to solve with a straightedge and compass - for example, it is impossible to construct a segment whose length is cube root of 2 with these instruments - the discovery of the Italian mathematician Margherita Beloch Piazzolla in 1934 that one can in fact construct a segment of length cube root of 2 with a single paper fold was completely ignored (till the end of the 1980s). This comes as no surprise, since with few exceptions paper folding was seldom considered as a mathematical practice, let alone as a mathematical procedure of inference or proof that could prompt novel mathematical discoveries. A few questions immediately arise: Why did paper folding become a non-instrument? What caused the marginalisation of this technique? And how was the mathematical knowledge, which was nevertheless transmitted and prompted by paper folding, later treated and conceptualised? Aiming to answer these questions, this volume provides, for the first time, an extensive historical study on the history of folding in mathematics, spanning from the 16th century to the 20th century, and offers a general study on the ways mathematical knowledge is marginalised, disappears, is ignored or becomes obsolete. In doing so, it makes a valuable contribution to the field of history and philosophy of science, particularly the history and philosophy of mathematics and is highly recommended for anyone interested in these topics.

This monograph presents a new model of mathematical structures called weak n-categories. These structures find their motivation in a wide range of fields, from algebraic topology to mathematical physics, algebraic geometry and mathematical logic. While strict n-categories are easily defined in terms associative and unital composition operations they are of limited use in applications, which often call for weakened variants of these laws. The author proposes a new approach to this weakening, whose generality arises not from a weakening of such laws but from the very geometric structure of its cells; a geometry dubbed weak globularity. The new model, called weakly globular n-fold categories, is one of the simplest known algebraic structures yielding a model of weak n-categories. The central result is the equivalence of this model to one of the existing models, due to Tamsamani and further studied by Simpson. This theory has intended applications to homotopy theory, mathematical physics and to long-standing open questions in category theory. As the theory is described in elementary terms and the book is largely self-contained, it is accessible to beginning graduate students and to mathematicians from a wide range of disciplines well beyond higher category theory. The new model makes a transparent connection between higher category theory and homotopy theory, rendering it particularly suitable for category theorists and algebraic topologists. Although the results are complex, readers are guided with an intuitive explanation before each concept is introduced, and with diagrams showing the interconnections between the main ideas and results.

This book presents a set theoretical development for the foundations of the theory of atomic and finitely supported structures. It analyzes whether a classical result can be adequately reformulated by replacing a 'non-atomic structure' with an 'atomic, finitely supported structure'. It also presents many specific properties, such as finiteness, cardinality, connectivity, fixed point, order and uniformity, of finitely supported atomic structures that do not have non-atomic correspondents. In the framework of finitely supported sets, the authors analyze the consistency of various forms of choice and related results. They introduce and study the notion of 'cardinality' by presenting various order and arithmetic properties. Finitely supported partially ordered sets, chain complete sets, lattices and Galois connections are studied, and new fixed point, calculability and approximation properties are presented. In this framework, the authors study the finitely supported L-fuzzy subsets of a finitely supported set and the finitely supported fuzzy subgroups of a finitely supported group. Several pairwise non-equivalent definitions for the notion of 'infinity' (Dedekind infinity, Mostowski infinity, Kuratowski infinity, Tarski infinity, ascending infinity) are introduced, compared and studied in the new framework. Relevant examples of sets that satisfy some forms of infinity while not satisfying others are provided. Uniformly supported sets are analyzed, and certain surprising properties are presented. Finally, some variations of the finite support requirement are discussed. The book will be of value to researchers in the foundations of set theory, algebra and logic.

Steps forward in mathematics often reverberate in other scientific disciplines, and give rise to innovative conceptual developments or find surprising technological applications. This volume brings to the forefront some of the proponents of the mathematics of the twentieth century, who have put at our disposal new and powerful instruments for investigating the reality around us. The portraits present people who have impressive charisma and wide-ranging cultural interests, who are passionate about defending the importance of their own research, are sensitive to beauty, and attentive to the social and political problems of their times. What we have sought to document is mathematics' central position in the culture of our day. Space has been made not only for the great mathematicians but also for literary texts, including contributions by two apparent interlopers, Robert Musil and Raymond Queneau, for whom mathematical concepts represented a valuable tool for resolving the struggle between 'soul and precision.'