The book begins with the basic concepts of logic and set theory, to familiarize students with the language of mathematics and how it is interpreted. These concepts are used as the basis for a step-by-step breakdown of the most important techniques used in constructing proofs. To help students construct their own proofs, this new edition contains over 200 new exercises, selected solutions, and an introduction to Proof Designer software. No background beyond standard high school mathematics is assumed. Previous Edition Hb (1994) 0-521-44116-1 Previous Edition Pb (1994) 0-521-44663-5

    The progressively more difficult puzzles include a double murder.

    Enjoy being a parent again!

    The author overturns the traditional perspective by showing how figurative aspects of language reveal the poetic structure of mind. Ideas and research from psychology, linguistics, philosophy, anthropology, and literary theory are used to establish important links between the poetic structure of thought and everyday use of language. The Poetics of Mind evaluates current philosophical, linguistic, and literary theories of figurative language and relates the empirical work on figurative language understanding to the broader issues concerning the nature of everyday thought and reasoning.

    Two-color illustrations with explanations, enable students to progress with the minimum of guidance from the instructor, allowing them to solve problems by computer and by hand.

    The basic rudiments of formal and informal logic are here, all clearly described. But Tom and Jim go much further. They focus students on the real world, where the discipline of logic adds substance and meaning to all kinds of human discourse. Everything from puzzles, paradoxes, and mathematical proofs to campaign debate excerpts, government regulations, and cartoons are used to show how logic is put to work by philosophers, mathematicians, advertisers, computer scientists, politicians, and others.

    It is through the inference rule of resolution that both proofs and computations can be manipulated on computers, and this book contains elegant versions and proofs of the fundamental theorems and lemmas in the proof theory of logic programming. Advanced topics such as recursive complexity and negation as failure and its semantics are covered, and streamlined setups for SLD- and SLDNF-resolution are described. No other book treats this material in such detail and with such sophistication. Doets provides a novel approach to resolution that is applied to the first-order case and the case of (positive) logic programs. In contrast to the usual approach, the concept of a resolvent is defined nonconstructively, without recourse to the concept of unification, allowing the soundness and completeness proofs to be carried out in a more economic way. Other new material includes computability results dealing with analytical hierarchy, results on infinite derivations and an exposition on general logic programs using 3-valued logic.