Fascinating study of the origin and nature of mathematical thought, including relation of mathematics and science, 20th-century developments, impact of computers, and more.Includes 34 illustrations. 1968 edition."
Contents include an elementary but thorough overview of mathematical logic of 1st order; formal number theory; surveys of the work by Church, Turing, and others, including Gödel's completeness theorem, Gentzen's theorem, more.
Mathematical Logic for Computer Science is a mathematics textbook with theorems and proofs, but the choice of topics has been guided by the needs of students of computer science. The method of semantic tableaux provides an elegant way to teach logic that is both theoretically sound and easy to understand. The uniform use of tableaux-based techniques facilitates learning advanced logical systems based on what the student has learned from elementary systems. The logical systems presented are: propositional logic, first-order logic, resolution and its application to logic programming, Hoare logic for the verification of sequential programs, and linear temporal logic for the verification of concurrent programs. The third edition has been entirely rewritten and includes new chapters on central topics of modern computer science: SAT solvers and model checking.
"This book chronicles the work of mathematician Ernst Zermelo (1871-1953) and his development of set theory's crucial principle, the axiom of choice. It covers the axiom's formulation during the early 20th century, the controversy it engendered, and its current central place in set theory and mathematical logic. 1982 edition"--
Winner of the 2012 PROSE Award for Mathematics from The American Publishers Awards for Professional and Scholarly Excellence. "A great book, one that I will certainly add to my personal library." —Paul J. Nahin, Professor Emeritus of Electrical Engineering, University of New Hampshire Classic Problems of Probability presents a lively account of the most intriguing aspects of statistics. The book features a large collection of more than thirty classic probability problems which have been carefully selected for their interesting history, the way they have shaped the field, and their counterintuitive nature. From Cardano's 1564 Games of Chance to Jacob Bernoulli's 1713 Golden Theorem to Parrondo's 1996 Perplexing Paradox, the book clearly outlines the puzzles and problems of probability, interweaving the discussion with rich historical detail and the story of how the mathematicians involved arrived at their solutions. Each problem is given an in-depth treatment, including detailed and rigorous mathematical proofs as needed. Some of the fascinating topics discussed by the author include: Buffon's Needle problem and its ingenious treatment by Joseph Barbier, culminating into a discussion of invariance Various paradoxes raised by Joseph Bertrand Classic problems in decision theory, including Pascal's Wager, Kraitchik's Neckties, and Newcomb's problem The Bayesian paradigm and various philosophies of probability Coverage of both elementary and more complex problems, including the Chevalier de Méré problems, Fisher and the lady testing tea, the birthday problem and its various extensions, and the Borel-Kolmogorov paradox Classic Problems of Probability is an eye-opening, one-of-a-kind reference for researchers and professionals interested in the history of probability and the varied problem-solving strategies employed throughout the ages. The book also serves as an insightful supplement for courses on mathematical probability and introductory probability and statistics at the undergraduate level.
Presenting mathematics as forming a natural bridge between the humanities and the sciences, this book makes calculus accessible to those in the liberal arts. Much of the necessary geometry and algebra are exposed through historical development, and a section on the development of calculus offers insights into the place of mathematics in the history of thought.
An ethologist shows man to be a gene machine whose world is one of savage competition and deceit
The Fourth Edition of this long-established text retains all the key features of the previous editions, covering the basic topics of a solid first course in mathematical logic. This edition includes an extensive appendix on second-order logic, a section on set theory with urlements, and a section on the logic that results when we allow models with empty domains. The text contains numerous exercises and an appendix furnishes answers to many of them. Introduction to Mathematical Logic includes: propositional logic first-order logic first-order number theory and the incompleteness and undecidability theorems of Gödel, Rosser, Church, and Tarski axiomatic set theory theory of computability The study of mathematical logic, axiomatic set theory, and computability theory provides an understanding of the fundamental assumptions and proof techniques that form basis of mathematics. Logic and computability theory have also become indispensable tools in theoretical computer science, including artificial intelligence. Introduction to Mathematical Logic covers these topics in a clear, reader-friendly style that will be valued by anyone working in computer science as well as lecturers and researchers in mathematics, philosophy, and related fields.
When, after the agreeable fatigues of solicitation, Mrs Millamant set out a long bill of conditions subject to which she might by degrees dwindle into a wife, Mirabell offered in return the condition that he might not thereby be beyond measure enlarged into a husband. With age and experience in research come the twin dangers of dwindling into a philosopher of science while being enlarged into a dotard. The philosophy of science, I believe, should not be the preserve of senile scientists and of teachers of philosophy who have themselves never so much as understood the contents of a textbook of theoretical physics, let alone done a bit of mathematical research or even enjoyed the confidence of a creating scientist. On the latter count I run no risk: Any reader will see that I am untrained (though not altogether unread) in classroom philosophy. Of no ignorance of mine do I boast, indeed I regret it, but neither do I find this one ignorance fatal here, for few indeed of the great philosophers to explicate whose works hodiernal professors of phil osophy destroy forests of pulp were themselves so broadly and specially trained as are their scholiasts. In attempt to palliate the former count I have chosen to collect works written over the past thirty years, some of them not published before, and I include only a few very recent essays.
Mathematical demography is the centerpiece of quantitative social science. The founding works of this field from Roman times to the late Twentieth Century are collected here, in a new edition of a classic work by David R. Smith and Nathan Keyfitz. Commentaries by Smith and Keyfitz have been brought up to date and extended by Kenneth Wachter and Hervé Le Bras, giving a synoptic picture of the leading achievements in formal population studies. Like the original collection, this new edition constitutes an indispensable source for students and scientists alike, and illustrates the deep roots and continuing vitality of mathematical demography.