Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. This volume, the third publication in the Perspectives in Logic series, is a much-needed monograph on the metamathematics of first-order arithmetic. The authors pay particular attention to subsystems (fragments) of Peano arithmetic and give the reader a deeper understanding of the role of the axiom schema of induction and of the phenomenon of incompleteness. The reader is only assumed to know the basics of mathematical logic, which are reviewed in the preliminaries. Part I develops parts of mathematics and logic in various fragments. Part II is devoted to incompleteness. Finally, Part III studies systems that have the induction schema restricted to bounded formulas (bounded arithmetic).

Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. This volume, the second publication in the Perspectives in Logic series, is an almost self-contained introduction to higher recursion theory, in which the reader is only assumed to know the basics of classical recursion theory. The book is divided into four parts: hyperarithmetic sets, metarecursion, -recursion, and E-recursion. This text is essential reading for all researchers in the field.

Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. In this volume, the first publication in the Perspectives in Logic series, Pour-El and Richards present the first graduate-level treatment of computable analysis within the tradition of classical mathematical reasoning. The book focuses on the computability or noncomputability of standard processes in analysis and physics. Topics include classical analysis, Hilbert and Banach spaces, bounded and unbounded linear operators, eigenvalues, eigenvectors, and equations of mathematical physics. The work is self-contained, and although it is intended primarily for logicians and analysts, it should also be of interest to researchers and graduate students in physics and computer science.

Since their inception, the Perspectives in Logic and Lecture Notes in Logic series have published seminal works by leading logicians. Many of the original books in the series have been unavailable for years, but they are now in print once again. In this volume, the third publication in the Lecture Notes in Logic series, Mitchell and Steel construct an inner model with a Woodin cardinal and develop its fine structure theory. This work builds upon the existing theory of a model of the form L[E], where E is a coherent sequence of extenders, and relies upon the fine structure theory of L[E] models with strong cardinals, and the theory of iteration trees and 'backgrounded' L[E] models with Woodin cardinals. This work is what results when fine structure meets iteration trees.

Fascinating connections exist between group theory and automata theory, and a wide variety of them are discussed in this text. Automata can be used in group theory to encode complexity, to represent aspects of underlying geometry on a space on which a group acts, and to provide efficient algorithms for practical computation. There are also many applications in geometric group theory. The authors provide background material in each of these related areas, as well as exploring the connections along a number of strands that lead to the forefront of current research in geometric group theory. Examples studied in detail include hyperbolic groups, Euclidean groups, braid groups, Coxeter groups, Artin groups, and automata groups such as the Grigorchuk group. This book will be a convenient reference point for established mathematicians who need to understand background material for applications, and can serve as a textbook for research students in (geometric) group theory.

Fascinating connections exist between group theory and automata theory, and a wide variety of them are discussed in this text. Automata can be used in group theory to encode complexity, to represent aspects of underlying geometry on a space on which a group acts, and to provide efficient algorithms for practical computation. There are also many applications in geometric group theory. The authors provide background material in each of these related areas, as well as exploring the connections along a number of strands that lead to the forefront of current research in geometric group theory. Examples studied in detail include hyperbolic groups, Euclidean groups, braid groups, Coxeter groups, Artin groups, and automata groups such as the Grigorchuk group. This book will be a convenient reference point for established mathematicians who need to understand background material for applications, and can serve as a textbook for research students in (geometric) group theory.

Wiring diagrams form a kind of graphical language that describes operations or processes with multiple inputs and outputs, and shows how such operations are wired together to form a larger and more complex operation. This monograph presents a comprehensive study of the combinatorial structure of the various operads of wiring diagrams, their algebras, and the relationships between these operads. The book proves finite presentation theorems for operads of wiring diagrams as well as their algebras. These theorems describe the operad in terms of just a few operadic generators and a small number of generating relations. The author further explores recent trends in the application of operad theory to wiring diagrams and related structures, including finite presentations for the propagator algebra, the algebra of discrete systems, the algebra of open dynamical systems, and the relational algebra. A partial verification of David Spivak's conjecture regarding the quotient-freeness of the relational algebra is also provided. In the final part, the author constructs operad maps between the various operads of wiring diagrams and identifies their images. Assuming only basic knowledge of algebra, combinatorics, and set theory, this book is aimed at advanced undergraduate and graduate students as well as researchers working in operad theory and its applications. Numerous illustrations, examples, and practice exercises are included, making this a self-contained volume suitable for self-study.

The logician Kurt Goedel (1906-1978) published a paper in 1931 formulating what have come to be known as his 'incompleteness theorems', which prove, among other things, that within any formal system with resources sufficient to code arithmetic, questions exist which are neither provable nor disprovable on the basis of the axioms which define the system. These are among the most celebrated results in logic today. In this volume, leading philosophers and mathematicians assess important aspects of Goedel's work on the foundations and philosophy of mathematics. Their essays explore almost every aspect of Godel's intellectual legacy including his concepts of intuition and analyticity, the Completeness Theorem, the set-theoretic multiverse, and the state of mathematical logic today. This groundbreaking volume will be invaluable to students, historians, logicians and philosophers of mathematics who wish to understand the current thinking on these issues.

Discrete quantum walks are quantum analogues of classical random walks. They are an important tool in quantum computing and a number of algorithms can be viewed as discrete quantum walks, in particular Grover's search algorithm. These walks are constructed on an underlying graph, and so there is a relation between properties of walks and properties of the graph. This book studies the mathematical problems that arise from this connection, and the different classes of walks that arise. Written at a level suitable for graduate students in mathematics, the only prerequisites are linear algebra and basic graph theory; no prior knowledge of physics is required. The text serves as an introduction to this important and rapidly developing area for mathematicians and as a detailed reference for computer scientists and physicists working on quantum information theory.

Broadly organized around the applications of Fourier analysis, "Methods of Applied Mathematics with a MATLAB Overview" covers both classical applications in partial differential equations and boundary value problems, as well as the concepts and methods associated to the Laplace, Fourier, and discrete transforms. Transform inversion problems are also examined, along with the necessary background in complex variables. A final chapter treats wavelets, short-time Fourier analysis, and geometrically-based transforms. The computer program MATLAB is emphasized throughout, and an introduction to MATLAB is provided in an appendix. Rich in examples, illustrations, and exercises of varying difficulty, this text can be used for a one- or two-semester course and is ideal for students in pure and applied mathematics, physics, and engineering.

This monograph proposes a new way of implementing interaction in logic. It also provides an elementary introduction to Constructive Type Theory (CTT). The authors equally emphasize basic ideas and finer technical details. In addition, many worked out exercises and examples will help readers to better understand the concepts under discussion. One of the chief ideas animating this study is that the dialogical understanding of definitional equality and its execution provide both a simple and a direct way of implementing the CTT approach within a game-theoretical conception of meaning. In addition, the importance of the play level over the strategy level is stressed, binding together the matter of execution with that of equality and the finitary perspective on games constituting meaning. According to this perspective the emergence of concepts are not only games of giving and asking for reasons (games involving Why-questions), they are also games that include moves establishing how it is that the reasons brought forward accomplish their explicative task. Thus, immanent reasoning games are dialogical games of Why and How.

This visionary and engaging book provides a mathematical perspective on the fundamental ideas of numbers, space, life, evolution, the brain and the mind. The author suggests how a development of mathematical concepts in the spirit of category theory may lead to unravelling the mystery of the human mind and the design of universal learning algorithms. The book is divided into two parts, the first of which describes the ideas of great mathematicians and scientists, those who saw sparks of light in the dark sea of unknown. The second part, Memorandum Ergo, reflects on how mathematics can contribute to the understanding of the mystery of thought. It argues that the core of the human mind is a structurally elaborated object that needs a creation of a broad mathematical context for its understanding. Readers will discover the main properties of the expected mathematical objects within this context, called ERGO-SYSTEMS, and readers will see how these "systems" may serve as prototypes for design of universal learning computer programs. This is a work of great, poetical insight and is richly illustrated. It is a highly attractive read for all those who welcome a mathematical and scientific way of thinking about the world.

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.

This monograph is devoted to monoidal categories and their connections with 3-dimensional topological field theories. Starting with basic definitions, it proceeds to the forefront of current research. Part 1 introduces monoidal categories and several of their classes, including rigid, pivotal, spherical, fusion, braided, and modular categories. It then presents deep theorems of Muger on the center of a pivotal fusion category. These theorems are proved in Part 2 using the theory of Hopf monads. In Part 3 the authors define the notion of a topological quantum field theory (TQFT) and construct a Turaev-Viro-type 3-dimensional state sum TQFT from a spherical fusion category. Lastly, in Part 4 this construction is extended to 3-manifolds with colored ribbon graphs, yielding a so-called graph TQFT (and, consequently, a 3-2-1 extended TQFT). The authors then prove the main result of the monograph: the state sum graph TQFT derived from any spherical fusion category is isomorphic to the Reshetikhin-Turaev surgery graph TQFT derived from the center of that category. The book is of interest to researchers and students studying topological field theory, monoidal categories, Hopf algebras and Hopf monads.

The philosophy of computer science is concerned with issues that arise from reflection upon the nature and practice of the discipline of computer science. This book presents an approach to the subject that is centered upon the notion of computational artefact. It provides an analysis of the things of computer science as technical artefacts. Seeing them in this way enables the application of the analytical tools and concepts from the philosophy of technology to the technical artefacts of computer science. With this conceptual framework the author examines some of the central philosophical concerns of computer science including the foundations of semantics, the logical role of specification, the nature of correctness, computational ontology and abstraction, formal methods, computational epistemology and explanation, the methodology of computer science, and the nature of computation. The book will be of value to philosophers and computer scientists.

This book offers an inspiring and naive view on language and reasoning. It presents a new approach to ordinary reasoning that follows the author's former work on fuzzy logic. Starting from a pragmatic scientific view on meaning as a quantity, and the common sense reasoning from a primitive notion of inference, which is shared by both laypeople and experts, the book shows how this can evolve, through the addition of more and more suppositions, into various formal and specialized modes of precise, imprecise, and approximate reasoning. The logos are intended here as a synonym for rationality, which is usually shown by the processes of questioning, guessing, telling, and computing. Written in a discursive style and without too many technicalities, the book presents a number of reflections on the study of reasoning, together with a new perspective on fuzzy logic and Zadeh's "computing with words" grounded in both language and reasoning. It also highlights some mathematical developments supporting this view. Lastly, it addresses a series of questions aimed at fostering new discussions and future research into this topic. All in all, this book represents an inspiring read for professors and researchers in computer science, and fuzzy logic in particular, as well as for psychologists, linguists and philosophers.

This book questions the relevance of computation to the physical universe. Our theories deliver computational descriptions, but the gaps and discontinuities in our grasp suggest a need for continued discourse between researchers from different disciplines, and this book is unique in its focus on the mathematical theory of incomputability and its relevance for the real world. The core of the book consists of thirteen chapters in five parts on extended models of computation; the search for natural examples of incomputable objects; mind, matter, and computation; the nature of information, complexity, and randomness; and the mathematics of emergence and morphogenesis. This book will be of interest to researchers in the areas of theoretical computer science, mathematical logic, and philosophy.

This monograph is a comprehensive account of formal matrices, examining homological properties of modules over formal matrix rings and summarising the interplay between Morita contexts and K theory. While various special types of formal matrix rings have been studied for a long time from several points of view and appear in various textbooks, for instance to examine equivalences of module categories and to illustrate rings with one-sided non-symmetric properties, this particular class of rings has, so far, not been treated systematically. Exploring formal matrix rings of order 2 and introducing the notion of the determinant of a formal matrix over a commutative ring, this monograph further covers the Grothendieck and Whitehead groups of rings. Graduate students and researchers interested in ring theory, module theory and operator algebras will find this book particularly valuable. Containing numerous examples, Formal Matrices is a largely self-contained and accessible introduction to the topic, assuming a solid understanding of basic algebra.

This book discusses major milestones in Rohit Jivanlal Parikh's scholarly work. Highlighting the transition in Parikh's interest from formal languages to natural languages, and how he approached Wittgenstein's philosophy of language, it traces the academic trajectory of a brilliant scholar whose work opened up various new avenues in research. This volume is part of Springer's book series Outstanding Contributions to Logic, and honours Rohit Parikh and his works in many ways. Parikh is a leader in the realm of ideas, offering concepts and definitions that enrich the field and lead to new research directions. Parikh has contributed to a variety of areas in logic, computer science and game theory. In mathematical logic his contributions have been in recursive function theory, proof theory and non-standard analysis; in computer science, in the areas of modal, temporal and dynamic logics of programs and semantics of programs, as well as logics of knowledge; in artificial intelligence in the area of belief revision; and in game theory in the formal analysis of social procedures, with a strong undercurrent of philosophy running through all his work.This is not a collection of articles limited to one theme, or even directly connected to specific works by Parikh, but instead all papers are inspired and influenced by Parikh in some way, adding structures to and enriching "Parikh-land". The book presents a brochure-like overview of Parikh-land before providing an "introductory video" on the sights and sounds that you experience when reading the book.

Gerhard Gentzen is best known for his development of the proof systems of natural deduction and sequent calculus, central in many areas of logic and computer science today. Another noteworthy achievement is his resolution of the embarrassing situation created by Goedel's incompleteness results, especially the second one about the unprovability of consistency of elementary arithmetic. After these successes, Gentzen dedicated the rest of his short life to the main problem of Hilbert's proof theory, the question of the consistency of analysis. He was arrested in the summer of 1945 with other professors of the German University of Prague and died soon afterward of starvation in a prison cell. Attempts at locating his lost manuscripts failed at the time, but several decades later, two slim folders of shorthand notes were found. In this volume, Jan von Plato gives an overview of Gentzen's life and scientific achievements, based on detailed archival and systematic studies, and essential for placing the translations of shorthand manuscripts that follow in the right setting. The materials in this book are singular in the way they show the birth and development of Gentzen's central ideas and results, sometimes in a well-developed form, and other times as flashes into the anatomy of the workings of a unique mind.

This book covers work written by leading scholars from different schools within the research area of paraconsistency. The authors critically investigate how contemporary paraconsistent logics can be used to better understand human reasoning in science and mathematics. Offering a variety of perspectives, they shed a new light on the question of whether paraconsistent logics can function as the underlying logics of inconsistent but useful scientific and mathematical theories. The great variety of paraconsistent logics gives rise to various, interrelated questions, such as what are the desiderata a paraconsistent logic should satisfy, is there prospect of a universal approach to paraconsistent reasoning with axiomatic theories, and to what extent is reasoning about sets structurally analogous to reasoning about truth. Furthermore, the authors consider paraconsistent logic's status as either a normative or descriptive discipline (or one which falls in between) and which inconsistent but non-trivial axiomatic theories are well understood by which types of paraconsistent approaches. This volume addresses such questions from different perspectives in order to (i) obtain a representative overview of the state of the art in the philosophical debate on paraconsistency, (ii) come up with fresh ideas for the future of paraconsistency, and most importantly (iii) provide paraconsistent logic with a stronger philosophical foundation, taking into account the developments within the different schools of paraconsistency.

The book offers a comprehensive survey of intuitionistic fuzzy logics. By reporting on both the author's research and others' findings, it provides readers with a complete overview of the field and highlights key issues and open problems, thus suggesting new research directions. Starting with an introduction to the basic elements of intuitionistic fuzzy propositional calculus, it then provides a guide to the use of intuitionistic fuzzy operators and quantifiers, and lastly presents state-of-the-art applications of intuitionistic fuzzy sets. The book is a valuable reference resource for graduate students and researchers alike.

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

Infinitary logic, the logic of languages with infinitely long conjunctions, plays an important role in model theory, recursion theory and descriptive set theory. This book is the first modern introduction to the subject in forty years, and will bring students and researchers in all areas of mathematical logic up to the threshold of modern research. The classical topics of back-and-forth systems, model existence techniques, indiscernibles and end extensions are covered before more modern topics are surveyed. Zilber's categoricity theorem for quasiminimal excellent classes is proved and an application is given to covers of multiplicative groups. Infinitary methods are also used to study uncountable models of counterexamples to Vaught's conjecture, and effective aspects of infinitary model theory are reviewed, including an introduction to Montalban's recent work on spectra of Vaught counterexamples. Self-contained introductions to effective descriptive set theory and hyperarithmetic theory are provided, as is an appendix on admissible model theory.

This book argues for a view in which processes of dialogue and interaction are taken to be foundational to reasoning, logic, and meaning. This is both a continuation, and a substantial modification, of an inferentialist approach to logic. As such, the book not only provides a critical introduction to the inferentialist view, but it also provides an argument that this shift in perspective has deep and foundational consequences for how we understand the nature of logic and its relationship with meaning and reasoning. This has been upheld by several technical results, including, for example a novel approach to logical paradox and logical revision, and an account of the internal justification of logical rules. The book shows that inferentialism is greatly strengthened, such that it can answer the most stringent criticisms of the view. This leads to a view of logic that emphasizes the dynamics of reasoning, provides a novel account of the justification and normativity of logical rules, thus leading to a new, attractive approach to the foundations of logic. The book addresses readers interested in philosophy of language, philosophical and mathematical logic, theories of reasoning, and also those who actively engage in current debates involving, for example, logical revision, and the relationship between logic and reasoning, from advanced undergraduates, to professional philosophers, mathematicians, and linguists.