This handbook with exercises reveals in formalisms, hitherto mainly used for hardware and software design and verification, unexpected mathematical beauty. The lambda calculus forms a prototype universal programming language, which in its untyped version is related to Lisp, and was treated in the first author's classic The Lambda Calculus (1984). The formalism has since been extended with types and used in functional programming (Haskell, Clean) and proof assistants (Coq, Isabelle, HOL), u...

Probability theory is nowadays applied in a huge variety of fields including physics, engineering, biology, economics and the social sciences. This book is a modern, lively and rigorous account which has Doob's theory of martingales in discrete time as its main theme. It proves important results such as Kolmogorov's Strong Law of Large Numbers and the Three-Series Theorem by martingale techniques, and the Central Limit Theorem via the use of characteristic functions. A distinguishing featu...

'A wealth of examples to which solutions are given permeate the text so the reader will certainly be active.'The Mathematical GazetteThis is the final book written by the late great puzzle master and logician, Dr. Raymond Smullyan.This book is a sequel to my Beginner's Guide to Mathematical Logic.The previous volume deals with elements of propositional and first-order logic, contains a bit on formal systems and recursion, and concludes with chapters on Gödel's famous incomp...

Computability Theory: An Introduction to Recursion Theory provides a concise, comprehensive, and authoritative introduction to contemporary computability theory, techniques, and results. The basic concepts and techniques of computability theory are placed in their historical, philosophical and logical context. This presentation is characterized by an unusual breadth of coverage and the inclusion of advanced topics not to be found elsewhere in the literature at this level. The text includes...

Generative Grammar presents a substantial contribution to the field of linguistics in drawing together for the first time the author's most significant work on the theory of generative grammar.The essays collected here display Freidin's role in moving the theory forward in terms of new proposals, and analyse the efforts to understand the evolution and history of the theory by careful investigation of how and why it has changed over the years.

Logic is a branch of philosophy, mathematics and computer science. It studies the required methods to determine whether a statement is true, such as reasoning and computation.Proofs and Algorithms: Introduction to Logic and Computability is an introduction to the fundamental concepts of contemporary logic - those of a proof, a computable function, a model and a set. It presents a series of results, both positive and negative, - Church's undecidability theorem, Gödel’s inco...

This book on modal logic is especially designed for philosophy students. It provides an accessible yet technically sound treatment of modal logic and its philosophical applications. Every effort is made to simplify the presentation by using diagrams instead of more complex mathematical apparatus. These and other innovations provide philosophers with easy access to a rich variety of topics in modal logic, including a full coverage of quantified modal logic, non-rigid designators, definite d...

This book presents the author's research on automatic learning procedures for categorial grammars of natural languages. The research program spans a number of intertwined disciplines, including syntax, semantics, learnability theory, logic, and computer science. The theoretical framework employed is an extension of categorial grammar that has come to be called multimodal or type-logical grammar. The first part of the book presents an expository summary of how grammatical sentences of any l...

A First Course in Computational Algebraic Geometry is designed for young students with some background in algebra who wish to perform their first experiments in computational geometry. Originating from a course taught at the African Institute for Mathematical Sciences, the book gives a compact presentation of the basic theory, with particular emphasis on explicit computational examples using the freely available computer algebra system, Singular. Readers will quickly gain the confidence to...

This is a short, modern, and motivated introduction to mathematical logic for upper undergraduate and beginning graduate students in mathematics and computer science. Any mathematician who is interested in getting acquainted with logic and would like to learn Gödel’s incompleteness theorems should find this book particularly useful. The treatment is thoroughly mathematical and prepares students to branch out in several areas of mathematics related to foundations and computability, such as ...

An Introduction to Homological Algebra discusses the origins of algebraic topology. It also presents the study of homological algebra as a two-stage affair. First, one must learn the language of Ext and Tor and what it describes. Second, one must be able to compute these things, and often, this involves yet another language: spectral sequences. Homological algebra is an accessible subject to those who wish to learn it, and this book is the author's attempt to make it lovable. This book com...

Handbook of Analysis and Its Foundations is a self-contained and unified handbook on mathematical analysis and its foundations. Intended as a self-study guide for advanced undergraduates and beginning graduatestudents in mathematics and a reference for more advanced mathematicians, this highly readable book provides broader coverage than competing texts in the area. Handbook of Analysis and Its Foundations provides an introduction to a wide range of topics, including: algebra; topology; no...