Practical Foundations collects the methods of construction of the objects of twentieth-century mathematics. Although it is mainly concerned with a framework essentially equivalent to intuitionistic Zermelo-Fraenkel logic, the book looks forward to more subtle bases in categorical type theory and the machine representation of mathematics. Each idea is illustrated by wide-ranging examples, and followed critically along its natural path, transcending disciplinary boundaries between universal algebra, type theory, category theory, set theory, sheaf theory, topology and programming. Students and teachers of computing, mathematics and philosophy will find this book both readable and of lasting value as a reference work.

This book unifies a broad range of programming language concepts under the framework of type systems and structural operational semantics.

This modern introduction to the foundations of logic and mathematics not only takes theory into account, but also treats in some detail applications that have a substantial impact on everyday life (loans and mortgages, bar codes, public-key cryptography). A first college-level introduction to logic, proofs, sets, number theory, and graph theory, and an excellent self-study reference and resource for instructors.

In this book, first published in 2003, categorical algebra is used to build a foundation for the study of geometry, analysis, and algebra.

The Volume Examines, In Depth, The Implications Of Indian History And Philosophy For Contemporary Mathematics And Science. The Conclusions Challenge Current Formal Mathematics And Its Basis In The Western Dogma That Deduction Is Infallible (Or That It Is Less Fallible Than Induction). The Development Of The Calculus In India, Over A Thousand Years, Is Exhaustively Documented In This Volume, Along With Novel Insights, And Is Related To The Key Sources Of Wealth-Monsoon-Dependent Agriculture And Navigation Required For Overseas Trade - And The Corresponding Requirement Of Timekeeping. Refecting The Usual Double Standard Of Evidence Used To Construct Eurocentric History, A Single, New Standard Of Evidence For Transmissions Is Proposed. Using This, It Is Pointed Out That Jesuits In Cochin, Following The Toledo Model Of Translation, Had Long-Term Opportunity To Transmit Indian Calculus Texts To Europe. The European Navigational Problem Of Determining Latitude, Longitude, And Loxodromes, And The 1582 Gregorian Calendar-Reform, Provided Ample Motivation. The Mathematics In These Earlier Indian Texts Suddenly Starts Appearing In European Works From The Mid-16Th Century Onwards, Providing Compelling Circumstantial Evidence. While The Calculus In India Had Valid Pramana, This Differed From Western Notions Of Proof, And The Indian (Algorismus) Notion Of Number Differed From The European (Abacus) Notion. Hence, Like Their Earlier Difficulties With The Algorismus, Europeans Had Difficulties In Understanding The Calculus, Which, Like Computer Technology, Enhanced The Ability To Calculate, Albeit In A Way Regarded As Epistemologically Insecure. Present-Day Difficulties In Learning Mathematics Are Related, Via Phylogeny Is Ontogeny , To These Historical Difficulties In Assimilating Imported Mathematics. An Appendix Takes Up Further Contemporary Implications Of The New Philosophy Of Mathematics For The Extension Of The Calculus, Which Is Needed To Handle The Infinities Arising In The Study Of Shock Waves And The Renormalization Problem Of Quantum Field Theory.

Philosophical Approaches to the Foundations of Logic and Mathematics consists of eleven articles addressing various aspects of the "roots" of logic and mathematics, their basic concepts and the mechanisms that work in the practice of their use.

This text develops a comprehensive theory of programming languages based on type systems and structural operational semantics. Language concepts are precisely defined by their static and dynamic semantics, presenting the essential tools both intuitively and rigorously while relying on only elementary mathematics. These tools are used to analyze and prove properties of languages and provide the framework for combining and comparing language features. The broad range of concepts includes fundamental data types such as sums and products, polymorphic and abstract types, dynamic typing, dynamic dispatch, subtyping and refinement types, symbols and dynamic classification, parallelism and cost semantics, and concurrency and distribution. The methods are directly applicable to language implementation, to the development of logics for reasoning about programs, and to the formal verification language properties such as type safety. This thoroughly revised second edition includes exercises at the end of nearly every chapter and a new chapter on type refinements.