Certified Programming with Dependent Types
The technology of mechanized program verification can play a supporting role in many kinds of research projects in computer science, and related tools for formal proof-checking are seeing increasing adoption in mathematics and engineering. This book provides an introduction to the Coq software for writing and checking mathematical proofs. It takes ...
Advances in Proof-Theoretic Semantics
This volume is the first ever collection devoted to the field of proof-theoretic semantics. Contributions address topics including the systematics of introduction and elimination rules and proofs of normalization, the categorial characterization of deductions, the relation between Heyting's and Gentzen's approaches to meaning, knowability paradoxes...
Street-Fighting Mathematics
In problem solving, as in street fighting, rules are for fools: do whatever works - don't just stand there! Yet we often fear an unjustified leap even though it may land us on a correct result. Traditional mathematics teaching is largely about solving exactly stated problems exactly, yet life often hands us partly defined problems needing only mode...
Discrete Mathematics
Discrete Mathematics: An Open Introduction is a free, open source textbook appropriate for a first or second year undergraduate course for math majors, especially those who will go on to teach. Since Spring 2013, the book has been used as the primary textbook or a supplemental resource at more than 75 colleges and universities around the world (see...
The Philosophy of Mathematics Education
This survey provides a brief and selective overview of research in the philosophy of mathematics education. It asks what makes up the philosophy of mathematics education, what it means, what questions it asks and answers, and what is its overall importance and use? It provides overviews of critical mathematics education, and the most relevant mode...
Planar Maps, Random Walks and Circle Packing
This free book focuses on the interplay between random walks on planar maps and Koebe's circle packing theorem. Further topics covered include electric networks, the He–Schramm theorem on infinite circle packings, uniform spanning trees of planar maps, local limits of finite planar maps and the almost sure recurrence of simple random walks on the...
Principles of Mechanics
This open access textbook takes the reader step-by-step through the concepts of mechanics in a clear and detailed manner. Mechanics is considered to be the core of physics, where a deep understanding of the concepts is essential in understanding all branches of physics. Many proofs and examples are included to help the reader grasp the fundamentals...
Statistical Learning and Sequential Prediction
This free book will focus on theoretical aspects of Statistical Learning and Sequential Prediction. Until recently, these two subjects have been treated separately within the learning community. The course will follow a unified approach to analyzing learning in both scenarios. To make this happen, we shall bring together ideas from probability and ...
Linear Algebra with Applications
Linear Algebra with Applications by W. Keith Nicholson, traditionally published for many years is now being released as an open educational resource. Overall, the aim of the book is to achieve a balance among computational skills, theory, and applications of linear algebra. It is a relatively advanced introduction to the ideas and techniques of ...
Theory of Statistics
This book is directed toward students for whom mathematical statistics is or will become an important part of their lives. Obviously, such students should be able to work through the details of 'hard' proofs and derivations. In addition, students at this level should acquire, or begin acquiring, a deep appreciation for the field, including its hist...
Algorithms
Algorithms are the lifeblood of computer science. They are the machines that proofs build and the music that programs play. Their history is as old as mathematics itself. This book is a wide-ranging, idiosyncratic treatise on the design and analysis of algorithms, covering several fundamental techniques, with an emphasis on intuition and the proble...
A Graduate Course in Applied Cryptography
Cryptography is an indispensable tool used to protect information in computing systems. It is used everywhere and by billions of people worldwide on a daily basis. It is used to protect data at rest and data in motion. Cryptographic systems are an integral part of standard protocols, most notably the Transport Layer Security (TLS) protocol, making ...
SAT/SMT by Example
SAT/SMT solvers can be viewed as solvers of huge systems of equations. The difference is that SMT solvers takes systems in arbitrary format, while SAT solvers are limited to boolean equations in CNF 1 form. A lot of real world problems can be represented as problems of solving system of equations....
Text Genetics in Literary Modernism and Other Essays
This collection of essays from world-renowned scholar Hans Walter Gabler contains writings from a decade and a half of retirement spent exploring textual criticism, genetic criticism, and literary criticism. In these sixteen stimulating contributions, he develops theories of textual criticism and editing that are inflected by our advance into the d...