This book provides an introduction to some key subjects in algebra and topology. It consists of comprehensive texts of some hours courses on the preliminaries for several advanced theories in (categorical) algebra and topology. Often, this kind of presentations is not so easy to find in the literature, where one begins articles by assuming a lot of knowledge in the field. This volume can both help young researchers to quickly get into the subject by offering a kind of " roadmap " and also help master students to be aware of the basics of other research directions in these fields before deciding to specialize in one of them. Furthermore, it can be used by established researchers who need a particular result for their own research and do not want to go through several research papers in order to understand a single proof. Although the chapters can be read as " self-contained " chapters, the authors have tried to coordinate the texts in order to make them complementary. The seven chapters of this volume correspond to the seven courses taught in two Summer Schools that took place in Louvain-la-Neuve in the frame of the project Fonds d'Appui a l'Internationalisation of the Universite catholique de Louvain to strengthen the collaborations with the universities of Coimbra, Padova and Poitiers, within the Coimbra Group.

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.

Categories for the Working Mathematician provides an array of general ideas useful in a wide variety of fields. Starting from the foundations, this book illuminates the concepts of category, functor, natural transformation, and duality. The book then turns to adjoint functors, which provide a description of universal constructions, an analysis of the representations of functors by sets of morphisms, and a means of manipulating direct and inverse limits. These categorical concepts are extensively illustrated in the remaining chapters, which include many applications of the basic existence theorem for adjoint functors. The categories of algebraic systems are constructed from certain adjoint-like data and characterized by Beck's theorem. After considering a variety of applications, the book continues with the construction and exploitation of Kan extensions. This second edition includes a number of revisions and additions, including two new chapters on topics of active interest. One is on symmetric monoidal categories and braided monoidal categories and the coherence theorems for them. The second describes 2-categories and the higher dimensional categories which have recently come into prominence. The bibliography has also been expanded to cover some of the many other recent advances concerning categories.

This volume is dedicated to Hiroakira Ono life's work on substructural logics. Chapters, written by well-established academics, cover topics related to universal algebra, algebraic logic and the Full Lambek calculus; the book includes a short biography about Hiroakira Ono. The book starts with detailed surveys on universal algebra, abstract algebraic logic, topological dualities, and connections to computer science. It further contains specialised contributions on connections to formal languages (recognizability in residuated lattices and connections to the finite embedding property), covering systems for modal substructural logics, results on the existence and disjunction properties and finally a study of conservativity of expansions. This book will be primarily of interest to researchers working in algebraic and non-classical logic.

Category theory has experienced a resurgence in popularity recently because of new links with topology and mathematical physics. This book provides a clearly written account of higher order category theory and presents operads and multicategories as a natural language for its study. Tom Leinster has included necessary background material and applications as well as appendices containing some of the more technical proofs that might have disrupted the flow of the text.

This book gives a proof of Cherlin's conjecture for finite binary primitive permutation groups. Motivated by the part of model theory concerned with Lachlan's theory of finite homogeneous relational structures, this conjecture proposes a classification of those finite primitive permutation groups that have relational complexity equal to 2. The first part gives a full introduction to Cherlin's conjecture, including all the key ideas that have been used in the literature to prove some of its special cases. The second part completes the proof by dealing with primitive permutation groups that are almost simple with socle a group of Lie type. A great deal of material concerning properties of primitive permutation groups and almost simple groups is included, and new ideas are introduced. Addressing a hot topic which cuts across the disciplines of group theory, model theory and logic, this book will be of interest to a wide range of readers. It will be particularly useful for graduate students and researchers who need to work with simple groups of Lie type.

This volume provides a unified and accessible account of recent developments regarding the real homotopy type of configuration spaces of manifolds. Configuration spaces consist of collections of pairwise distinct points in a given manifold, the study of which is a classical topic in algebraic topology. One of this theory's most important questions concerns homotopy invariance: if a manifold can be continuously deformed into another one, then can the configuration spaces of the first manifold be continuously deformed into the configuration spaces of the second? This conjecture remains open for simply connected closed manifolds. Here, it is proved in characteristic zero (i.e. restricted to algebrotopological invariants with real coefficients), using ideas from the theory of operads. A generalization to manifolds with boundary is then considered. Based on the work of Campos, Ducoulombier, Lambrechts, Willwacher, and the author, the book covers a vast array of topics, including rational homotopy theory, compactifications, PA forms, propagators, Kontsevich integrals, and graph complexes, and will be of interest to a wide audience.

This book constitutes the refereed proceedings of the International Symposium on Logical Foundations of Computer Science, LFCS 2022, held in Deerfield Beach, FL, USA, in January 2022. The 23 revised full papers were carefully reviewed and selected from 35 submissions. The scope of the Symposium is broad and includes constructive mathematics and type theory; homotopy type theory; logic, automata, and automatic structures; computability and randomness; logical foundations of programming; logical aspects of computational complexity; parameterized complexity; logic programming and constraints; automated deduction and interactive theorem proving; logical methods in protocol and program verification; logical methods in program specification and extraction; domain theory logics; logical foundations of database theory; equational logic and term rewriting; lambda and combinatory calculi; categorical logic and topological semantics; linear logic; epistemic and temporal logics; intelligent and multiple-agent system logics; logics of proof and justification; non-monotonic reasoning; logic in game theory and social software; logic of hybrid systems; distributed system logics; mathematical fuzzy logic; system design logics; other logics in computer science.

Desktop Grid Computing presents common techniques used in numerous models, algorithms, and tools developed during the last decade to implement desktop grid computing. These techniques enable the solution of many important sub-problems for middleware design, including scheduling, data management, security, load balancing, result certification, and fault tolerance. The book's first part covers the initial ideas and basic concepts of desktop grid computing. The second part explores challenging current and future problems. Each chapter presents the sub-problems, discusses theoretical and practical issues, offers details about implementation and experiments, and includes references to further reading and notes. One of the first books to give a thorough and up-to-date presentation of this topic, this resource describes various approaches and models as well as recent trends that underline the evolution of desktop grids. It balances the theory of designing desktop grid middleware and architecture with applications and real-world deployment on large-scale platforms.

This book is an exposition of recent progress on the Donaldson-Thomas (DT) theory. The DT invariant was introduced by R. Thomas in 1998 as a virtual counting of stable coherent sheaves on Calabi-Yau 3-folds. Later, it turned out that the DT invariants have many interesting properties and appear in several contexts such as the Gromov-Witten/Donaldson-Thomas conjecture on curve-counting theories, wall-crossing in derived categories with respect to Bridgeland stability conditions, BPS state counting in string theory, and others. Recently, a deeper structure of the moduli spaces of coherent sheaves on Calabi-Yau 3-folds was found through derived algebraic geometry. These moduli spaces admit shifted symplectic structures and the associated d-critical structures, which lead to refined versions of DT invariants such as cohomological DT invariants. The idea of cohomological DT invariants led to a mathematical definition of the Gopakumar-Vafa invariant, which was first proposed by Gopakumar-Vafa in 1998, but its precise mathematical definition has not been available until recently. This book surveys the recent progress on DT invariants and related topics, with a focus on applications to curve-counting theories.

Is mathematics a highly sophisticated intellectual game in which the adepts display their skill by tackling invented problems, or are mathematicians engaged in acts of discovery as they explore an independent realm of mathematical reality? Why does this seemingly abstract discipline provide the key to unlocking the deep secrets of the physical universe? How one answers these questions will significantly influence metaphysical thinking about reality.
This book is intended to fill a gap between popular 'wonders of mathematics' books and the technical writings of the philosophers of mathematics. The chapters are written by some of the world's finest mathematicians, mathematical physicists and philosophers of mathematics, each giving their perspective on this fascinating debate. Every chapter is followed by a short response from another member of the author team, reinforcing the main theme and raising further questions.
Accessible to anyone interested in what mathematics really means, and useful for mathematicians and philosophers of science at all levels, Meaning in Mathematics offers deep new insights into a subject many people take for granted.

This book constitutes the proceedings of the 23rd International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2022, which took place in Philadelphia, PA, USA, in January 2022.The 22 papers presented in this volume were carefully reviewed from 48 submissions. VMCAI provides a forum for researchers working on verification, model checking, and abstract interpretation and facilitates interaction, cross-fertilization, and advancement of hybrid methods that combine these and related areas.

This book is dedicated to the work of Alasdair Urquhart. The book starts out with an introduction to and an overview of Urquhart's work, and an autobiographical essay by Urquhart. This introductory section is followed by papers on algebraic logic and lattice theory, papers on the complexity of proofs, and papers on philosophical logic and history of logic. The final section of the book contains a response to the papers by Urquhart. Alasdair Urquhart has made extremely important contributions to a variety of fields in logic. He produced some of the earliest work on the semantics of relevant logic. He provided the undecidability of the logics R (of relevant implication) and E (of relevant entailment), as well as some of their close neighbors. He proved that interpolation fails in some of those systems. Urquhart has done very important work in complexity theory, both about the complexity of proofs in classical and some nonclassical logics. In pure algebra, he has produced a representation theorem for lattices and some rather beautiful duality theorems. In addition, he has done important work in the history of logic, especially on Bertrand Russell, including editing Volume four of Russell's Collected Papers.

If you have ever wondered what quaternions are - then look no further, John Vince will show you how simple and useful they are. This 2nd edition has been completely revised and includes extra detail on the invention of quaternions, a complete review of the text and equations, all figures are in colour, extra worked examples, an expanded index, and a bibliography arranged for each chapter. Quaternions for Computer Graphics includes chapters on number sets and algebra, imaginary and complex numbers, the complex plane, rotation transforms, and a comprehensive description of quaternions in the context of rotation. The book will appeal to students of computer graphics, computer science and mathematics, as well as programmers, researchers, academics and professional practitioners interested in learning about quaternions. John Vince explains in an easy-to-understand language, with the aid of useful figures, how quaternions emerged, gave birth to modern vector analysis, disappeared, and reemerged to be adopted by the flight simulation industry and computer graphics. This book will give you the confidence to use quaternions within your every-day mathematics, and explore more advanced texts.

Practical Foundations of Mathematics explains the basis of mathematical reasoning both in pure mathematics itself (algebra and topology in particular) and in computer science. In addition to the formal logic, this volume examines the relationship between computer languages and "plain English" mathematical proofs. The book introduces the reader to discrete mathematics, reasoning, and categorical logic. It offers a new approach to term algebras, induction and recursion and proves in detail the equivalence of types and categories. Each idea is illustrated by wide-ranging examples, and followed critically along its natural path, transcending disciplinary boundaries across universal algebra, type theory, category theory, set theory, sheaf theory, topology and programming. Students and teachers of computing, mathematics and philosophy will find this book both readable and of lasting value as a reference work.

This book, the third book in the four-volume series in algebra, deals with important topics in homological algebra, including abstract theory of derived functors, sheaf co-homology, and an introduction to etale and l-adic co-homology. It contains four chapters which discuss homology theory in an abelian category together with some important and fundamental applications in geometry, topology, algebraic geometry (including basics in abstract algebraic geometry), and group theory. The book will be of value to graduate and higher undergraduate students specializing in any branch of mathematics. The author has tried to make the book self-contained by introducing relevant concepts and results required. Prerequisite knowledge of the basics of algebra, linear algebra, topology, and calculus of several variables will be useful.

This book offers an original and informative view of the development of fundamental concepts of computability theory. The treatment is put into historical context, emphasizing the motivation for ideas as well as their logical and formal development. In Part I the author introduces computability theory, with chapters on the foundational crisis of mathematics in the early twentieth century, and formalism. In Part II he explains classical computability theory, with chapters on the quest for formalization, the Turing Machine, and early successes such as defining incomputable problems, c.e. (computably enumerable) sets, and developing methods for proving incomputability. In Part III he explains relative computability, with chapters on computation with external help, degrees of unsolvability, the Turing hierarchy of unsolvability, the class of degrees of unsolvability, c.e. degrees and the priority method, and the arithmetical hierarchy. Finally, in the new Part IV the author revisits the computability (Church-Turing) thesis in greater detail. He offers a systematic and detailed account of its origins, evolution, and meaning, he describes more powerful, modern versions of the thesis, and he discusses recent speculative proposals for new computing paradigms such as hypercomputing. This is a gentle introduction from the origins of computability theory up to current research, and it will be of value as a textbook and guide for advanced undergraduate and graduate students and researchers in the domains of computability theory and theoretical computer science. This new edition is completely revised, with almost one hundred pages of new material. In particular the author applied more up-to-date, more consistent terminology, and he addressed some notational redundancies and minor errors. He developed a glossary relating to computability theory, expanded the bibliographic references with new entries, and added the new part described above and other new sections.

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

The book has two parts: In the first, after a review of some seminal classical accounts of laws and explanations, a new account is proposed for distinguishing between laws and accidental generalizations (LAG). Among the new consequences of this proposal it is proved that any explanation of a contingent generalization shows that the generalization is not accidental. The second part involves physical theories, their modality, and their explanatory power. In particular, it is shown that (1) Each theory has a theoretical implication structure associated with it, such that there are new physical modal operators on these structures and also special modal entities that are in these structures. A special subset of the physical modals, the nomic modals are associated with the laws of theories. (2) The familiar idea that theories always explain laws by deduction of them has to be seriously modified in light of the fact that there are a host of physical theories (including for example, Newtonian Classical mechanics, Hamiltonian, and Lagrangian theory, and probability theory) that we believe are schematic (they do not have any truth value). Nevertheless, we think that there is a kind of non-deductive explanation and generality that they achieve by subsumtion under a schema.

This open access book is the first ever collection of Karl Popper's writings on deductive logic. Karl R. Popper (1902-1994) was one of the most influential philosophers of the 20th century. His philosophy of science ("falsificationism") and his social and political philosophy ("open society") have been widely discussed way beyond academic philosophy. What is not so well known is that Popper also produced a considerable work on the foundations of deductive logic, most of it published at the end of the 1940s as articles at scattered places. This little-known work deserves to be known better, as it is highly significant for modern proof-theoretic semantics. This collection assembles Popper's published writings on deductive logic in a single volume, together with all reviews of these papers. It also contains a large amount of unpublished material from the Popper Archives, including Popper's correspondence related to deductive logic and manuscripts that were (almost) finished, but did not reach the publication stage. All of these items are critically edited with additional comments by the editors. A general introduction puts Popper's work into the context of current discussions on the foundations of logic. This book should be of interest to logicians, philosophers, and anybody concerned with Popper's work.

This collection contains translations of papers on propositional satisfiability and related logical problems which appeared in ""Problemy Sokrashcheniya Perebora"", published in Russian in 1987 by the Scientific Council 'Cybernetics' of the USSR Academy of Sciences. The problems form the nucleus of this intensively developing area.This translation is dedicated to the memory of two remarkable Russian mathematicians, Sergei Maslov and his wife, Nina Maslova. Maslov is known as the originator of the inverse method in automated deduction, which was discovered at the same time as the resolution method of J. A. Robinson and has approximately the same range of applications. In 1981, Maslov proposed an iterative algorithm for propositional satisfiability based on some general ideas of search described in detail in his posthumously published book, ""Theory of Deductive Systems and Its Applications"" (1986; English 1987). This collection contains translations of papers on propositional satisfiability and related logical problems. The papers related to Maslov's iterative method of search reduction play a significant role.

This book carefully presents a unified treatment of equivariant Poincare duality in a wide variety of contexts, illuminating an area of mathematics that is often glossed over elsewhere. The approach used here allows the parallel treatment of both equivariant and nonequivariant cases. It also makes it possible to replace the usual field of coefficients for cohomology, the field of real numbers, with any field of arbitrary characteristic, and hence change (equivariant) de Rham cohomology to the usual singular (equivariant) cohomology . The book will be of interest to graduate students and researchers wanting to learn about the equivariant extension of tools familiar from non-equivariant differential geometry.

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.

In this book, Paulo Guilherme Santos studies diagonalization in formal mathematics from logical aspects to everyday mathematics. He starts with a study of the diagonalization lemma and its relation to the strong diagonalization lemma. After that, Yablo's paradox is examined, and a self-referential interpretation is given. From that, a general structure of diagonalization with paradoxes is presented. Finally, the author studies a general theory of diagonalization with the help of examples from mathematics.

This Festschrift was published in honor of Egon Boerger on the occasion of his 75th birthday. It acknowledges Prof. Boerger's inspiration as a scientist, author, mentor, and community organizer. Dedicated to a pioneer in the fields of logic and computer science, Egon Boerger's research interests are unusual in scope, from programming languages to hardware architectures, software architectures, control systems, workflow and interaction patterns, business processes, web applications, and concurrent systems. The 18 invited contributions in this volume are by leading researchers in the areas of software engineering, programming languages, business information systems, and computer science logic.