Mathematical Foundation for Computer Science

In this book, which was originally published in 1985, Arto Salomaa gives an introduction to certain mathematical topics central to theoretical computer science: computability and recursive functions, formal languages and automata, computational complexity and cryptography. Without sacrificing readability, the presentation is essentially self-contained, with detailed proofs of all statements provided. Professor Salomaa is well known for his books in this area. The present work provides an insight into the basics, together with explanations of some of the more important developments in the field.

In this book, which was originally published in 1985, Arto Salomaa gives an introduction to certain mathematical topics central to theoretical computer science: computability and recursive functions, formal languages and automata, computational complexity and cryptography. Without sacrificing readability, the presentation is essentially self-contained, with detailed proofs of all statements provided. Professor Salomaa is well known for his books in this area. The present work provides an insight into the basics, together with explanations of some of the more important developments in the field.

Atmospheric analysis is the method of transforming the enormous and scattered database of atmospheric observations into the powerful mathematical and physical tools required to meet the growing demand for atmospheric data. Atmospheric Data Analysis is intended to fill a void in the atmospheric science literature and curricula. The book is self contained, and includes topics important in several other fields outside atmospheric observation, including atmospheric dynamics and statistics. It outlines the physical and mathematical basis of all aspects of atmospheric analysis. The emphasis is on the theoretical foundation of the subject and most of the development is analytic, but many practical considerations and examples are introduced. There are numerous exercises at the end of each chapter to aid the student in comprehending the material.

Introduction to digital imaging covering core techniques of image capture and the display of monochrome and color images. Basic tools required to describe sampling and image display on real devices are presented within a powerful mathematical framework. Starting with an overview of digital imaging, mathematical representation, and the elementary display of images, the topics progressively move to quantization, spatial sampling, photometry and colorimetry, and color sampling, and conclude with the estimation of image model parameters, and image restoration. The characterization of input and output devices is also covered. The reader will learn the processes used to generate accurate images, and appreciate the mathematical basis required to test and evaluate new devices. Contains illustrations, real-world examples, and end-of-chapter homework problems. Suitable for advanced undergraduate and graduate courses in digital imaging in electrical engineering and computer science departments.

Boolean functions are perhaps the most basic objects of study in theoretical computer science. They also arise in other areas of mathematics, including combinatorics, statistical physics, and mathematical social choice. The field of analysis of Boolean functions seeks to understand them via their Fourier transform and other analytic methods. This text gives a thorough overview of the field, beginning with the most basic definitions and proceeding to advanced topics such as hypercontractivity and isoperimetry. Each chapter includes a 'highlight application' such as Arrow's theorem from economics, the Goldreich–Levin algorithm from cryptography/learning theory, Håstad's NP-hardness of approximation results, and 'sharp threshold' theorems for random graph properties. The book includes roughly 450 exercises and can be used as the basis of a one-semester graduate course. It should appeal to advanced undergraduates, graduate students and researchers in computer science theory and related mat

This book develops a view of logic as a theory of information-driven agency and intelligent interaction between many agents - with conversation, argumentation and games as guiding examples. It provides one uniform account of dynamic logics for acts of inference, observation, questions and communication, that can handle both update of knowledge and revision of beliefs. It then extends the dynamic style of analysis to include changing preferences and goals, temporal processes, group action and strategic interaction in games. Throughout, the book develops a mathematical theory unifying all these systems, and positioning them at the interface of logic, philosophy, computer science and game theory. A series of further chapters explores repercussions of the 'dynamic stance' for these areas, as well as cognitive science.

This book develops a view of logic as a theory of information-driven agency and intelligent interaction between many agents - with conversation, argumentation and games as guiding examples. It provides one uniform account of dynamic logics for acts of inference, observation, questions and communication, that can handle both update of knowledge and revision of beliefs. It then extends the dynamic style of analysis to include changing preferences and goals, temporal processes, group action and strategic interaction in games. Throughout, the book develops a mathematical theory unifying all these systems, and positioning them at the interface of logic, philosophy, computer science and game theory. A series of further chapters explores repercussions of the 'dynamic stance' for these areas, as well as cognitive science.

This is the 2005 second edition of a highly successful and well-respected textbook on the numerical techniques used to solve partial differential equations arising from mathematical models in science, engineering and other fields. The authors maintain an emphasis on finite difference methods for simple but representative examples of parabolic, hyperbolic and elliptic equations from the first edition. However this is augmented by new sections on finite volume methods, modified equation analysis, symplectic integration schemes, convection-diffusion problems, multigrid, and conjugate gradient methods; and several sections, including that on the energy method of analysis, have been extensively rewritten to reflect modern developments. Already an excellent choice for students and teachers in mathematics, engineering and computer science departments, the revised text includes more latest theoretical and industrial developments.

Connecting theory with practice, this systematic and rigorous introduction covers the fundamental principles, algorithms and applications of key mathematical models for high-dimensional data analysis. Comprehensive in its approach, it provides unified coverage of many different low-dimensional models and analytical techniques, including sparse and low-rank models, and both convex and non-convex formulations. Readers will learn how to develop efficient and scalable algorithms for solving real-world problems, supported by numerous examples and exercises throughout, and how to use the computational tools learnt in several application contexts. Applications presented include scientific imaging, communication, face recognition, 3D vision, and deep networks for classification. With code available online, this is an ideal textbook for senior and graduate students in computer science, data science, and electrical engineering, as well as for those taking courses on sparsity, low-dimensional str

This book is ideal for a first or second year discrete mathematics course for mathematics, engineering, and computer science majors. The author has extensively class-tested early conceptions of the book over the years and supplements mathematical arguments with informal discussions to aid readers in understanding the presented topics. "Safe" - that is, paradox-free - informal set theory is introduced following on the heels of Russell's Paradox as well as the topics of finite, countable, and uncountable sets with an exposition and use of Cantor's diagonalisation technique. Predicate logic "for the user" is introduced along with axioms and rules and extensive examples. Partial orders and the minimal condition are studied in detail with the latter shown to be equivalent to the induction principle. Mathematical induction is illustrated with several examples and is followed by a thorough exposition of inductive definitions of functions and sets. Techniques for solving recurrence relations i

This new edition of Introduction to Lattices and Order presents a radical reorganization and updating, though its primary aim is unchanged. The explosive development of theoretical computer science in recent years has, in particular, influenced the book's evolution: a fresh treatment of fixpoints testifies to this and Galois connections now feature prominently. An early presentation of concept analysis gives both a concrete foundation for the subsequent theory of complete lattices and a glimpse of a methodology for data analysis that is of commercial value in social science. Classroom experience has led to numerous pedagogical improvements and many new exercises have been added. As before, exposure to elementary abstract algebra and the notation of set theory are the only prerequisites, making the book suitable for advanced undergraduates and beginning graduate students. It will also be a valuable resource for anyone who meets ordered structures.

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.

Machine learning methods extract value from vast data sets quickly and with modest resources. They are established tools in a wide range of industrial applications, including search engines, DNA sequencing, stock market analysis, and robot locomotion, and their use is spreading rapidly. People who know the methods have their choice of rewarding jobs. This hands-on text opens these opportunities to computer science students with modest mathematical backgrounds. It is designed for final-year undergraduates and master's students with limited background in linear algebra and calculus. Comprehensive and coherent, it develops everything from basic reasoning to advanced techniques within the framework of graphical models. Students learn more than a menu of techniques, they develop analytical and problem-solving skills that equip them for the real world. Numerous examples and exercises, both computer based and theoretical, are included in every chapter. Resources for students and instructors,

Ideal for classroom use and self-study, this book explains the implementation of the most effective modern methods in image analysis, covering segmentation, registration and visualisation, and focusing on the key theories, algorithms and applications that have emerged from recent progress in computer vision, imaging and computational biomedical science. Structured around five core building blocks - signals, systems, image formation and modality; stochastic models; computational geometry; level set methods; and tools and CAD models - it provides a solid overview of the field. Mathematical and statistical topics are presented in a straightforward manner, enabling the reader to gain a deep understanding of the subject without becoming entangled in mathematical complexities. Theory is connected to practical examples in x-ray, ultrasound, nuclear medicine, MRI and CT imaging, removing the abstract nature of the models and assisting reader understanding.

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 Lecture Notes in Logic series, Shoenfield gives a clear and focused introduction to recursion theory. The fundamental concept of recursion makes the idea of computability accessible to a mathematical analysis, thus forming one of the pillars on which modern computer science rests. This introduction is an ideal instrument for teaching and self-study that prepares the reader for the study of advanced monographs and the current literature on recursion theory.

Text-to-Speech Synthesis provides a complete, end-to-end account of the process of generating speech by computer. Giving an in-depth explanation of all aspects of current speech synthesis technology, it assumes no specialised prior knowledge. Introductory chapters on linguistics, phonetics, signal processing and speech signals lay the foundation, with subsequent material explaining how this knowledge is put to use in building practical systems that generate speech. Including coverage of the very latest techniques such as unit selection, hidden Markov model synthesis, and statistical text analysis, explanations of the more traditional techniques such as format synthesis and synthesis by rule are also provided. Weaving together the various strands of this multidisciplinary field, the book is designed for graduate students in electrical engineering, computer science, and linguistics. It is also an ideal reference for practitioners in the fields of human communication interaction and telep

This textbook is an introduction to algebra via examples. The book moves from properties of integers, through other examples, to the beginnings of group theory. Applications to public key codes and to error correcting codes are emphasised. These applications, together with sections on logic and finite state machines, make the text suitable for students of computer science as well as mathematics students. Attention is paid to historical development of the mathematical ideas. This second edition contains new material on mathematical reasoning skills and a new chapter on polynomials has been added. The book was developed from first-level courses taught in the UK and USA. These courses proved successful in developing not only a theoretical understanding but also algorithmic skills. This book can be used at a wide range of levels: it is suitable for first- or second-level university students, and could be used as enrichment material for upper-level school students.

Providing a basic foundation for advanced graduate study and research in the mechanics of solids, this 2004 treatise contains a systematic development of the fundamentals of finite inelastic deformations of heterogeneous materials. The book combines the mathematical rigour of solid mechanics with the physics-based micro-structural understanding of the material science, to present a coherent picture of finite inelastic deformation of single and polycrystalline metals, over broad ranges of strain rates and temperatures. It also includes a similarly rigourous and experimentally based development of the quasi-static deformation of cohesionless granular materials that support the applied loads through contact friction. Every effort has been made to provide a thorough treatment of the subject, rendering the book accessible to students in solid mechanics and in the mechanics of materials. This book integrates rigourous mathematical description of finite deformations seamlessly with mechanisms

Providing a basic foundation for advanced graduate study and research in the mechanics of solids, this 2004 treatise contains a systematic development of the fundamentals of finite inelastic deformations of heterogeneous materials. The book combines the mathematical rigour of solid mechanics with the physics-based micro-structural understanding of the material science, to present a coherent picture of finite inelastic deformation of single and polycrystalline metals, over broad ranges of strain rates and temperatures. It also includes a similarly rigourous and experimentally based development of the quasi-static deformation of cohesionless granular materials that support the applied loads through contact friction. Every effort has been made to provide a thorough treatment of the subject, rendering the book accessible to students in solid mechanics and in the mechanics of materials. This book integrates rigourous mathematical description of finite deformations seamlessly with mechanisms

Classical logic is concerned, loosely, with the behaviour of truths. Epistemic logic similarly is about the behaviour of known or believed truths. Justification logic is a theory of reasoning that enables the tracking of evidence for statements and therefore provides a logical framework for the reliability of assertions. This book, the first in the area, is a systematic account of the subject, progressing from modal logic through to the establishment of an arithmetic interpretation of intuitionistic logic. The presentation is mathematically rigorous but in a style that will appeal to readers from a wide variety of areas to which the theory applies. These include mathematical logic, artificial intelligence, computer science, philosophical logic and epistemology, linguistics, and game theory.

The Annual European Meeting of the Association for Symbolic Logic, also known as the Logic Colloquium, is among the most prestigious annual meetings in the field. The current volume, Logic Colloquium 2007, with contributions from plenary speakers and selected special session speakers, contains both expository and research papers by some of the best logicians in the world. This volume covers many areas of contemporary logic: model theory, proof theory, set theory, and computer science, as well as philosophical logic, including tutorials on cardinal arithmetic, on Pillay's conjecture, and on automatic structures. This volume will be invaluable for experts as well as those interested in an overview of central contemporary themes in mathematical logic.

This book surveys the mathematical and computational properties of finite sets of points in the plane, covering recent breakthroughs on important problems in discrete geometry, and listing many open problems. It unifies these mathematical and computational views using forbidden configurations, which are patterns that cannot appear in sets with a given property, and explores the implications of this unified view. Written with minimal prerequisites and featuring plenty of figures, this engaging book will be of interest to undergraduate students and researchers in mathematics and computer science. Most topics are introduced with a related puzzle or brain-teaser. The topics range from abstract issues of collinearity, convexity, and general position to more applied areas including robust statistical estimation and network visualization, with connections to related areas of mathematics including number theory, graph theory, and the theory of permutation patterns. Pseudocode is included for m

This book surveys the mathematical and computational properties of finite sets of points in the plane, covering recent breakthroughs on important problems in discrete geometry, and listing many open problems. It unifies these mathematical and computational views using forbidden configurations, which are patterns that cannot appear in sets with a given property, and explores the implications of this unified view. Written with minimal prerequisites and featuring plenty of figures, this engaging book will be of interest to undergraduate students and researchers in mathematics and computer science. Most topics are introduced with a related puzzle or brain-teaser. The topics range from abstract issues of collinearity, convexity, and general position to more applied areas including robust statistical estimation and network visualization, with connections to related areas of mathematics including number theory, graph theory, and the theory of permutation patterns. Pseudocode is included for m

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 Lecture Notes in Logic series, is the proceedings of the Association for Symbolic Logic meeting held in Helsinki, Finland, in July 1990. It contains eighteen papers by leading researchers, covering all fields of mathematical logic from the philosophy of mathematics, through model theory, proof theory, recursion theory, and set theory, to the connections of logic to computer science. The articles published here are still widely cited and continue to provide ideas for ongoing research projects.

Game theory is the science of interaction. This textbook, derived from courses taught by the author and developed over several years, is a comprehensive, straightforward introduction to the mathematics of non-cooperative games. It teaches what every game theorist should know: the important ideas and results on strategies, game trees, utility theory, imperfect information, and Nash equilibrium. The proofs of these results, in particular existence of an equilibrium via fixed points, and an elegant direct proof of the minimax theorem for zero-sum games, are presented in a self-contained, accessible way. This is complemented by chapters on combinatorial games like Go; and, it has introductions to algorithmic game theory, traffic games, and the geometry of two-player games. This detailed and lively text requires minimal mathematical background and includes many examples, exercises, and pictures. It is suitable for self-study or introductory courses in mathematics, computer science, or econo

Game theory is the science of interaction. This textbook, derived from courses taught by the author and developed over several years, is a comprehensive, straightforward introduction to the mathematics of non-cooperative games. It teaches what every game theorist should know: the important ideas and results on strategies, game trees, utility theory, imperfect information, and Nash equilibrium. The proofs of these results, in particular existence of an equilibrium via fixed points, and an elegant direct proof of the minimax theorem for zero-sum games, are presented in a self-contained, accessible way. This is complemented by chapters on combinatorial games like Go; and, it has introductions to algorithmic game theory, traffic games, and the geometry of two-player games. This detailed and lively text requires minimal mathematical background and includes many examples, exercises, and pictures. It is suitable for self-study or introductory courses in mathematics, computer science, or econo

This is an introduction to the dynamics of fluids at small scales, the physical and mathematical underpinnings of Brownian motion, and the application of these subjects to the dynamics and flow of complex fluids such as colloidal suspensions and polymer solutions. It brings together continuum mechanics, statistical mechanics, polymer and colloid science, and various branches of applied mathematics, in a self-contained and integrated treatment that provides a foundation for understanding complex fluids, with a strong emphasis on fluid dynamics. Students and researchers will find that this book is extensively cross-referenced to illustrate connections between different aspects of the field. Its focus on fundamental principles and theoretical approaches provides the necessary groundwork for research in the dynamics of flowing complex fluids.

This is an introduction to the dynamics of fluids at small scales, the physical and mathematical underpinnings of Brownian motion, and the application of these subjects to the dynamics and flow of complex fluids such as colloidal suspensions and polymer solutions. It brings together continuum mechanics, statistical mechanics, polymer and colloid science, and various branches of applied mathematics, in a self-contained and integrated treatment that provides a foundation for understanding complex fluids, with a strong emphasis on fluid dynamics. Students and researchers will find that this book is extensively cross-referenced to illustrate connections between different aspects of the field. Its focus on fundamental principles and theoretical approaches provides the necessary groundwork for research in the dynamics of flowing complex fluids.

Neurons in the brain communicate by short electrical pulses, the so-called action potentials or spikes. How can we understand the process of spike generation? How can we understand information transmission by neurons? What happens if thousands of neurons are coupled together in a seemingly random network? How does the network connectivity determine the activity patterns? And, vice versa, how does the spike activity influence the connectivity pattern? These questions are addressed in this 2002 introduction to spiking neurons aimed at those taking courses in computational neuroscience, theoretical biology, biophysics, or neural networks. The approach will suit students of physics, mathematics, or computer science; it will also be useful for biologists who are interested in mathematical modelling. The text is enhanced by many worked examples and illustrations. There are no mathematical prerequisites beyond what the audience would meet as undergraduates: more advanced techniques are introd

Self-organized criticality (SOC) is based upon the idea that complex behavior can develop spontaneously in certain multi-body systems whose dynamics vary abruptly. This book is a clear and concise introduction to the field of self-organized criticality, and contains an overview of the main research results. The author begins with an examination of what is meant by SOC, and the systems in which it can occur. He then presents and analyzes computer models to describe a number of systems, and he explains the different mathematical formalisms developed to understand SOC. The final chapter assesses the impact of this field of study, and highlights some key areas of new research. The author assumes no previous knowledge of the field, and the book contains several exercises. It will be ideal as a textbook for graduate students taking physics, engineering, or mathematical biology courses in nonlinear science or complexity.

The study of complex variables is beautiful from a purely mathematical point of view, and very useful for solving a wide array of problems arising in applications. This introduction to complex variables, suitable as a text for a one-semester course, has been written for undergraduate students in applied mathematics, science, and engineering. Based on the authors' extensive teaching experience, it covers topics of keen interest to these students, including ordinary differential equations, as well as Fourier and Laplace transform methods for solving partial differential equations arising in physical applications. Many worked examples, applications, and exercises are included. With this foundation, students can progress beyond the standard course and explore a range of additional topics, including generalized Cauchy theorem, Painlevé equations, computational methods, and conformal mapping with circular arcs. Advanced topics are labeled with an asterisk and can be included in the syllabus

The study of complex variables is beautiful from a purely mathematical point of view, and very useful for solving a wide array of problems arising in applications. This introduction to complex variables, suitable as a text for a one-semester course, has been written for undergraduate students in applied mathematics, science, and engineering. Based on the authors' extensive teaching experience, it covers topics of keen interest to these students, including ordinary differential equations, as well as Fourier and Laplace transform methods for solving partial differential equations arising in physical applications. Many worked examples, applications, and exercises are included. With this foundation, students can progress beyond the standard course and explore a range of additional topics, including generalized Cauchy theorem, Painlevé equations, computational methods, and conformal mapping with circular arcs. Advanced topics are labeled with an asterisk and can be included in the syllabus

Originally published in 1960, as the second edition of a 1957 original, this textbook is aimed at those without advanced mathematical training and provides a comprehensive introductory account of digital computers, what they are capable of doing and how they are made to do it. It begins with a discussion of programming - the preparation of instructions for the computer. This leads on to a consideration of systems of number storage, from the simple decimal system of desk calculating machines to the varieties of binary storage systems used in modern high-speed computers. The final chapter considers points, which arise in applying computers to engineering calculations, and gives details of some of the problems already solved in this way. Throughout the book the emphasis is on the applications of computers to routine work rather than to advanced research. This book will be of value to students of the history of computer science.

Some of our earliest experiences of the conclusive force of an argument come from school mathematics: faced with a mathematical proof, we cannot deny the conclusion once the premises have been accepted. Behind such arguments lies a more general pattern of 'demonstrative arguments' that is studied in the science of logic. Logical reasoning is applied at all levels, from everyday life to advanced sciences, and a remarkable level of complexity is achieved in everyday logical reasoning, even if the principles behind it remain intuitive. Jan von Plato provides an accessible but rigorous introduction to an important aspect of contemporary logic: its deductive machinery. He shows that when the forms of logical reasoning are analysed, it turns out that a limited set of first principles can represent any logical argument. His book will be valuable for students of logic, mathematics and computer science.

Some of our earliest experiences of the conclusive force of an argument come from school mathematics: faced with a mathematical proof, we cannot deny the conclusion once the premises have been accepted. Behind such arguments lies a more general pattern of 'demonstrative arguments' that is studied in the science of logic. Logical reasoning is applied at all levels, from everyday life to advanced sciences, and a remarkable level of complexity is achieved in everyday logical reasoning, even if the principles behind it remain intuitive. Jan von Plato provides an accessible but rigorous introduction to an important aspect of contemporary logic: its deductive machinery. He shows that when the forms of logical reasoning are analysed, it turns out that a limited set of first principles can represent any logical argument. His book will be valuable for students of logic, mathematics and computer science.

Formal semantics - the scientific study of meaning in natural language - is one of the most fundamental and long-established areas of linguistics. This Handbook offers a comprehensive, yet compact guide to the field, bringing together research from a wide range of world-leading experts. Chapters include coverage of the historical context and foundation of contemporary formal semantics, a survey of the variety of formal/logical approaches to linguistic meaning and an overview of the major areas of research within current semantic theory, broadly conceived. The Handbook also explores the interfaces between semantics and neighbouring disciplines, including research in cognition and computation. This work will be essential reading for students and researchers working in linguistics, philosophy, psychology and computer science.

Formal semantics - the scientific study of meaning in natural language - is one of the most fundamental and long-established areas of linguistics. This Handbook offers a comprehensive, yet compact guide to the field, bringing together research from a wide range of world-leading experts. Chapters include coverage of the historical context and foundation of contemporary formal semantics, a survey of the variety of formal/logical approaches to linguistic meaning and an overview of the major areas of research within current semantic theory, broadly conceived. The Handbook also explores the interfaces between semantics and neighbouring disciplines, including research in cognition and computation. This work will be essential reading for students and researchers working in linguistics, philosophy, psychology and computer science.

Phylogenetic combinatorics is a branch of discrete applied mathematics concerned with the combinatorial description and analysis of phylogenetic trees and related mathematical structures such as phylogenetic networks and tight spans. Based on a natural conceptual framework, the book focuses on the interrelationship between the principal options for encoding phylogenetic trees: split systems, quartet systems and metrics. Such encodings provide useful options for analyzing and manipulating phylogenetic trees and networks, and are at the basis of much of phylogenetic data processing. This book highlights how each one provides a unique perspective for viewing and perceiving the combinatorial structure of a phylogenetic tree and is, simultaneously, a rich source for combinatorial analysis and theory building. Graduate students and researchers in mathematics and computer science will enjoy exploring this fascinating new area and learn how mathematics may be used to help solve topical problem

Combining physics, mathematics and computer science, topological quantum computation is a rapidly expanding research area focused on the exploration of quantum evolutions that are immune to errors. In this book, the author presents a variety of different topics developed together for the first time, forming an excellent introduction to topological quantum computation. The makings of anyonic systems, their properties and their computational power are presented in a pedagogical way. Relevant calculations are fully explained, and numerous worked examples and exercises support and aid understanding. Special emphasis is given to the motivation and physical intuition behind every mathematical concept. Demystifying difficult topics by using accessible language, this book has broad appeal and is ideal for graduate students and researchers from various disciplines who want to get into this new and exciting research field.

Formal languages are widely regarded as being above all mathematical objects and as producing a greater level of precision and technical complexity in logical investigations because of this. Yet defining formal languages exclusively in this way offers only a partial and limited explanation of the impact which their use (and the uses of formalisms more generally elsewhere) actually has. In this book, Catarina Dutilh Novaes adopts a much wider conception of formal languages so as to investigate more broadly what exactly is going on when theorists put these tools to use. She looks at the history and philosophy of formal languages and focuses on the cognitive impact of formal languages on human reasoning, drawing on their historical development, psychology, cognitive science and philosophy. Her wide-ranging study will be valuable for both students and researchers in philosophy, logic, psychology and cognitive and computer science.