Acclaimed in all six prior editions for being clear, concise, and comprehensive, A CONCISE INTRODUCTION TO LOGIC covers all of the standard topics for any introductory logic course in neatly-packaged learning units. Known for its concise, direct style that emphasizes clarity, this market-leading text avoids the peculiar quirks, technicalities, and wordiness of other logic texts. Integrated technology such as a CD-ROM, Web-based material, and InfoTrac College Edition make for a complete teaching and learning system.

Essential Logic offers:


· Readability. A dialogue-like yet challenging style makes this introductory logic textbook engaging and interesting.


· Essentials. Deductive and inductive reasoning, formal and informal logic are placed within a philosophical perspective.


· Rigor. A careful sequence of learning steps communicates the essential skills of reasoning and directs students to write, support, and argue by connecting criticism to key concepts.


· Relevance. Explanations and examples take students' lives into consideration and are designed for students with diverse backgrounds and a wide range of experiences.


· A Theme. Traditional concepts are integrated with a discussion of modern technological issues and the world view of modern science. A unique chapter on Logic and Hope addresses questions students often ask and suggests a global perspective.


· Controversy. Students are encouraged to defend and critique positions--including those presented by the author. A unique final chapter on Fuzzy Logic is framed as a debate between Western and Eastern philosophy.


· Exercises. Students gain confidence in recognizing arguments, structuring them into premises and conclusions, identifying and critiquing informal fallacies, while learning to create, follow, and appreciate symbolic reasoning trails.


· Coverage. Chapters cover Argument Recognition and Language Analysis, Inductive Reasoning, Structuring Informal Fallacies, Symbolic Translation, Truth Tables, Formal Proofs of Validity, Quantification, and the basics of Fuzzy Set Theory and Propositional Logic.

Lewis and Papadimitriou present this long awaited Second Edition of their best-selling theory of computation. The authors are well-known for their clear presentation that makes the material accessible to a a broad audience and requires no special previous mathematical experience. In this new edition, the authors incorporate a somewhat more informal, friendly writing style to present both classical and contemporary theories of computation. Algorithms, complexity analysis, and algorithmic ideas are introduced informally in Chapter 1, and are pursued throughout the book. Each section is followed by problems.

This text strikes a good balance between rigor and an intuitive approach to computer theory. Covers all the topics needed by computer scientists with a sometimes humorous approach that reviewers found "refreshing". It is easy to read and the coverage of mathematics is fairly simple so readers do not have to worry about proving theorems.

If you want top grades and thorough understanding of set theory and related topics, this powerful study tool is the best tutor you can have! It takes you step-by-step through the subject and gives you 530 accompanying related problems with fully worked solutions. You also get plenty of practice problems to do on your own, working at your own speed. (Answers at the back show you how you're doing.) This new edition features improved problems in the ordinals, cardinals, and transfinite series chapters, plus new coverage of real numbers and integers.

In one of the finest treatments for upper undergraduate and graduate level students, Professor Suppes presents axiomatic set theory: the basic paradoxes and history of set theory, and advanced topics such as relations and functions, equipollence, finite sets and cardinal numbers, rational and real numbers and more. Exercises. References. Indexes.

Problem Solving Strategies Crossing the River with Dogs and Other Mathematical Adventures Why Teach a Course in Problem Solving? The NCTM Principles andStandards state that problem solving should be integrated throughout all courses and grade levels. For example, guess-and-check is a natural strategy to apply in algebra. Advanced math students often use finite differences to study functions and sequences. And drawing a diagram and using physical representations are commonly employed strategies in many contexts. However, many students never encounter valuable strategies such as matrix logic or unit analysis. And in content-crowded math classes, few students get the concentrated practice or time necessary to fully develop their problem-solving skills. By taking a semester course in problem solving, students can master a multitude of strategies while developing confidence in their problem-solving abilities. Your students will be better prepared to meet the challenges of school and life by taking this course.

Offers a comprehensive and accessible treatment of the theory of algorithms and complexity. Develops all the necessary mathematical prerequisites from such diverse fields as computability, logic, number theory, combinatorics, and probability. DLC: Computational complexity.

Berto’s highly readable and lucid guide introduces students and the interested reader to Gödel’s celebrated Incompleteness Theorem, and discusses some of the most famous - and infamous - claims arising from Gödel's arguments.

• Offers a clear understanding of this difficult subject by presenting each of the key steps of the Theorem in separate chapters
• Discusses interpretations of the Theorem made by celebrated contemporary thinkers
• Sheds light on the wider extra-mathematical and philosophical implications of Gödel’s theories
• Written in an accessible, non-technical style