The overall topic of the volume, Mathematics for Computation (M4C), is mathematics taking crucially into account the aspect of computation, investigating the interaction of mathematics with computation, bridging the gap between mathematics and computation wherever desirable and possible, and otherwise explaining why not.Recently, abstract mathematics has proved to have more computational content than ever expected. Indeed, the axiomatic method, originally intended to do away with concrete computations, seems to suit surprisingly well the programs-from-proofs paradigm, with abstraction helping not only clarity but also efficiency.Unlike computational mathematics, which rather focusses on objects of computational nature such as algorithms, the scope of M4C generally encompasses all the mathematics, including abstract concepts such as functions. The purpose of M4C actually is a strongly theory-based and therefore, is a more reliable and sustainable approach to actual computation, up to the systematic development of verified software.While M4C is situated within mathematical logic and the related area of theoretical computer science, in principle it involves all branches of mathematics, especially those which prompt computational considerations. In traditional terms, the topics of M4C include proof theory, constructive mathematics, complexity theory, reverse mathematics, type theory, category theory and domain theory.The aim of this volume is to provide a point of reference by presenting up-to-date contributions by some of the most active scholars in each field. A variety of approaches and techniques are represented to give as wide a view as possible and promote cross-fertilization between different styles and traditions.

These pun-studded fables by a popular science writer make complicated mathematical concepts accessible and fun. Twelve essays take a playful approach to mathematics, investigating the topology of a warm blanket, the odds of beating a superior tennis player, and how to distinguish between fact and fallacy. 1991 edition.

Model theory deals with a branch of mathematical logic showing connections between a formal language and its interpretations or models. This is the first and most successful textbook in logical model theory. Extensively updated and corrected in 1990 to accommodate developments in model theoretic methods -- including classification theory and nonstandard analysis -- the third edition added entirely new sections, exercises, and references.
Each chapter introduces an individual method and discusses specific applications. Basic methods of constructing models include constants, elementary chains, Skolem functions, indiscernibles, ultraproducts, and special models. The final chapters present more advanced topics that feature a combination of several methods. This classic treatment covers most aspects of first-order model theory and many of its applications to algebra and set theory.

As one of the leading critical voices on art of the postwar years, polymath Lawrence Gowing (1918-1991) combined a passion for close visual involvement with formidable literary skills. Edited by art historian Sarah Whitfield, four decades of Gowing's writing are brought together for the first time in this volume, covering subjects from the Old Masters to Francis Bacon and Howard Hodgkin. Having first gained success as a painter, Gowing's 1952 monograph on Vermeer brought him early recognition as a writer with the ability to combine aesthetic experience with a meticulous historical perspective. Gowing's foremost commitment was to the pioneering painters of the late nineteenth and early twentieth centuries, notably Paul Cezanne and Henri Matisse. The exhibitions he curated at the Tate and Museum of Modern Art famously helped to mould and reshape public perceptions. Characterised by a desire to instruct and encourage, his writing reflects a highly successful career as a curator and teacher.

Category theory is unmatched in its ability to organize and layer abstractions and to find commonalities between structures of all sorts. No longer the exclusive preserve of pure mathematicians, it is now proving itself to be a powerful tool in science, informatics, and industry. By facilitating communication between communities and building rigorous bridges between disparate worlds, applied category theory has the potential to be a major organizing force. This book offers a self-contained tour of applied category theory. Each chapter follows a single thread motivated by a real-world application and discussed with category-theoretic tools. We see data migration as an adjoint functor, electrical circuits in terms of monoidal categories and operads, and collaborative design via enriched profunctors. All the relevant category theory, from simple to sophisticated, is introduced in an accessible way with many examples and exercises, making this an ideal guide even for those without experience of university-level mathematics.

Proof complexity is a rich subject drawing on methods from logic, combinatorics, algebra and computer science. This self-contained book presents the basic concepts, classical results, current state of the art and possible future directions in the field. It stresses a view of proof complexity as a whole entity rather than a collection of various topics held together loosely by a few notions, and it favors more generalizable statements. Lower bounds for lengths of proofs, often regarded as the key issue in proof complexity, are of course covered in detail. However, upper bounds are not neglected: this book also explores the relations between bounded arithmetic theories and proof systems and how they can be used to prove upper bounds on lengths of proofs and simulations among proof systems. It goes on to discuss topics that transcend specific proof systems, allowing for deeper understanding of the fundamental problems of the subject.

Optimization Theory Based on Neutrosophic and Plithogenic Sets presents the state-of-the-art research on neutrosophic and plithogenic theories and their applications in various optimization fields. Its table of contents covers new concepts, methods, algorithms, modelling, and applications of green supply chain, inventory control problems, assignment problems, transportation problem, nonlinear problems and new information related to optimization for the topic from the theoretical and applied viewpoints in neutrosophic sets and logic.

At the heart of the justification for the reasoning used in modern mathematics lies the completeness theorem for predicate calculus. This unique textbook covers two entirely different ways of looking at such reasoning. Topics include:

• the representation of mathematical statements by formulas in a formal language;
• the interpretation of formulas as true or false in a mathematical structure;
• logical consequence of one formula from others;
• formal proof;
• the soundness and completeness theorems connecting logical consequence and formal proof;
• the axiomatization of some mathematical theories using a formal language;
• the compactness theorem and an introduction to model theory.

This book is designed for self-study by students, as well as for taught courses, using principles successfully developed by the Open University and used across the world. It includes exercises embedded within the text with full solutions to many of these. In addition there are a number of exercises without answers so that students studying under the guidance of a tutor may be assessed on the basis of what has been taught.

Some experience of axiom-based mathematics is required but no previous experience of logic. Propositional and Predicate Calculus gives students the basis for further study of mathematical logic and the use of formal languages in other subjects.

Derek Goldrei is Senior Lecturer and Staff Tutor at the Open University and part-time Lecturer in Mathematics at Mansfield College, Oxford, UK.

This open access book makes a case for extending logic beyond its traditional boundaries, to encompass not only statements but also also questions. The motivations for this extension are examined in detail. It is shown that important notions, including logical answerhood and dependency, emerge as facets of the fundamental notion of entailment once logic is extended to questions, and can therefore be treated with the logician's toolkit, including model-theoretic constructions and proof systems. After motivating the enterprise, the book describes how classical propositional and predicate logic can be made inquisitive-i.e., extended conservatively with questions-and what the resulting logics look like in terms of meta-theoretic properties and proof systems. Finally, the book discusses the tight connections between inquisitive logic and dependence logic.

This accessible textbook gives beginning undergraduate mathematics students a first exposure to introductory logic, proofs, sets, functions, number theory, relations, finite and infinite sets, and the foundations of analysis. The book provides students with a quick path to writing proofs and a practical collection of tools that they can use in later mathematics courses such as abstract algebra and analysis. The importance of the logical structure of a mathematical statement as a framework for finding a proof of that statement, and the proper use of variables, is an early and consistent theme used throughout the book.

Floating-point arithmetic is ubiquitous in modern computing, as it is the tool of choice to approximate real numbers. Due to its limited range and precision, its use can become quite involved and potentially lead to numerous failures. One way to greatly increase confidence in floating-point software is by computer-assisted verification of its correctness proofs. This book provides a comprehensive view of how to formally specify and verify tricky floating-point algorithms with the Coq proof assistant. It describes the Flocq formalization of floating-point arithmetic and some methods to automate theorem proofs. It then presents the specification and verification of various algorithms, from error-free transformations to a numerical scheme for a partial differential equation. The examples cover not only mathematical algorithms but also C programs as well as issues related to compilation.

The information age owes its existence to a little-known but crucial development, the theoretical study of logic and the foundations of mathematics. The Great Formal Machinery Works draws on original sources and rare archival materials to trace the history of the theories of deduction and computation that laid the logical foundations for the digital revolution. Jan von Plato examines the contributions of figures such as Aristotle; the nineteenth-century German polymath Hermann Grassmann; George Boole, whose Boolean logic would prove essential to programming languages and computing; Ernst Schroder, best known for his work on algebraic logic; and Giuseppe Peano, cofounder of mathematical logic. Von Plato shows how the idea of a formal proof in mathematics emerged gradually in the second half of the nineteenth century, hand in hand with the notion of a formal process of computation. A turning point was reached by 1930, when Kurt Godel conceived his celebrated incompleteness theorems. They were an enormous boost to the study of formal languages and computability, which were brought to perfection by the end of the 1930s with precise theories of formal languages and formal deduction and parallel theories of algorithmic computability. Von Plato describes how the first theoretical ideas of a computer soon emerged in the work of Alan Turing in 1936 and John von Neumann some years later. Shedding new light on this crucial chapter in the history of science, The Great Formal Machinery Works is essential reading for students and researchers in logic, mathematics, and computer science.

Calculi of temporal logic are widely used in modern computer science. The temporal organization of information flows in the different architectures of laptops, the Internet, or supercomputers would not be possible without appropriate temporal calculi. In the age of digitalization and High-Tech applications, people are often not aware that temporal logic is deeply rooted in the philosophy of modalities. A deep understanding of these roots opens avenues to the modern calculi of temporal logic which have emerged by extension of modal logic with temporal operators. Computationally, temporal operators can be introduced in different formalisms with increasing complexity such as Basic Modal Logic (BML), Linear-Time Temporal Logic (LTL), Computation Tree Logic (CTL), and Full Computation Tree Logic (CTL*). Proof-theoretically, these formalisms of temporal logic can be interpreted by the sequent calculus of Gentzen, the tableau-based calculus, automata-based calculus, game-based calculus, and dialogue-based calculus with different advantages for different purposes, especially in computer science.The book culminates in an outlook on trendsetting applications of temporal logics in future technologies such as artificial intelligence and quantum technology. However, it will not be sufficient, as in traditional temporal logic, to start from the everyday understanding of time. Since the 20th century, physics has fundamentally changed the modern understanding of time, which now also determines technology. In temporal logic, we are only just beginning to grasp these differences in proof theory which needs interdisciplinary cooperation of proof theory, computer science, physics, technology, and philosophy.

This textbook reviews the foundational topics that are typically covered in an introduction to proof course and studies the language of sentential logic as well as investigating the more powerful language of first-order logic and the notion of a formal deduction in first-order logic, in addition, it proves Godel's Completeness Theorem and discusses incompleteness and the computability concept.