An Introduction to Non-Classical Logic


Graham Priest - 2001
    Part 1, on propositional logic, is the old Introduction, but contains much new material. Part 2 is entirely new, and covers quantification and identity for all the logics in Part 1. The material is unified by the underlying theme of world semantics. All of the topics are explained clearly using devices such as tableau proofs, and their relation to current philosophical issues and debates are discussed. Students with a basic understanding of classical logic will find this book an invaluable introduction to an area that has become of central importance in both logic and philosophy. It will also interest people working in mathematics and computer science who wish to know about the area.

Who Is Fourier? a Mathematical Adventure


Transnational College of Lex - 1995
    This is done in a way that is not only easy to understand, but is actually fun! Professors and engineers, with high school and college students following closely, comprise the largest percentage of our readers. It is a must-have for anyone interested in music, mathematics, physics, engineering, or complex science. Dr. Yoichiro Nambu, 2008 Nobel Prize Winner in Physics, served as a senior adviser to the English version of Who is Fourier? A Mathematical Adventure.

Student Solutions Manual, Vol. 1 for Swokowski's Calculus: The Classic Edition


Earl W. Swokowski - 1991
    Prepare for exams and succeed in your mathematics course with this comprehensive solutions manual! Featuring worked out-solutions to the problems in CALCULUS: THE CLASSIC EDITION, 5th Edition, this manual shows you how to approach and solve problems using the same step-by-step explanations found in your textbook examples.

Vedic Mathematics


Jagadguru S. Maharaja - 1992
    It relates to the truth of numbers and magnitudes equally to all sciences and arts. The book brings to light how great and true knowledge is born of intuition, quite different from modern Western method. The ancient Indian method and its secret techniques are examined and shown to be capable of solving various problems of mathematics.

Computers and Intractability: A Guide to the Theory of NP-Completeness


Michael R. Garey - 1979
    Johnson. It was the first book exclusively on the theory of NP-completeness and computational intractability. The book features an appendix providing a thorough compendium of NP-complete problems (which was updated in later printings of the book). The book is now outdated in some respects as it does not cover more recent development such as the PCP theorem. It is nevertheless still in print and is regarded as a classic: in a 2006 study, the CiteSeer search engine listed the book as the most cited reference in computer science literature.

An Investigation of the Laws of Thought


George Boole - 1854
    A timeless introduction to the field and a landmark in symbolic logic, showing that classical logic can be treated algebraically.

Origami Design Secrets: Mathematical Methods for an Ancient Art


Robert J. Lang - 2003
    Lang, one of the worlds foremost origami artists and scientists, presents the never-before-described mathematical and geometric principles that allow anyone to design original origami, something once restricted to an elite few. From the theoretical underpinnings to detailed step-by-step folding sequences, this book takes a modern look at the centuries-old art of origami.

Adventures of a Computational Explorer


Stephen Wolfram - 2019
    In this lively book of essays, Stephen Wolfram takes the reader along on some of his most surprising and engaging intellectual adventures in science, technology, artificial intelligence and language design.