Famous classic has introduced countless readers to symbolic logic with its thorough and precise exposition. Starts with simple symbols and conventions and concludes with the Boole-Schroeder and Russell-Whitehead systems. No special knowledge of mathematics necessary. "One of the clearest and simplest introductions to a subject which is very much alive." — Mathematics Gazette.

Brimming with visual examples of concepts, derivation rules, and proof strategies, this introductory text is ideal for students with no previous experience in logic. Symbolic Logic: Syntax, Semantics, and Proof introduces students to the fundamental concepts, techniques, and topics involved in deductive reasoning. Agler guides students through the basics of symbolic logic by explaining the essentials of two classical systems, propositional and predicate logic. Students will learn translation both from formal language into English and from English into formal language; how to use truth trees and truth tables to test propositions for logical properties; and how to construct and strategically use derivation rules in proofs. This text makes this often confounding topic much more accessible with step-by-step example proofs, chapter glossaries of key terms, hundreds of homework problems and solutions for practice, and suggested further readings.

This volume offers a serious study of the fundamentals of symbolic logic that will neither frustrate nor bore the reader. The emphasis is on developing the students grasp of standard techniques and concepts rather than on achieving a high degree of sophistication. Coverage embraces all of the standard topics in sentential and quantificational logic, including multiple quantification, relations, and identity. Semantic and deductive topics are carefully distinguished, and appendices include an optional discussion of metatheory for sentential logic and truth trees.

This accessible, SHORT introduction to symbolic logic includes coverage of sentential and predicate logic, translations, truth tables, and derivations. The author's engaging style makes this the most informal of introductions to formal logic. Topics are explained in a conversational, easy-to-understand way for readers not familiar with mathematics or formal systems, and the author provides patient, reader-friendly explanations—even with the occasional bit of humour. The first half of the book deals with all the basic elements of Sentential Logic: the five truth-functional connectives, formation rules and translation into this language, truth-tables for validity, logical truth/falsity, equivalency, consistency and derivations. The second half deals with Quantifier Logic: the two quantifiers, formation rules and translation, demonstrating certain logical characteristics by “Finding an Interpretation” and derivations. There are plenty of exercises scattered throughout, more than in many texts, arranged in order of increasing difficulty and including separate answer keys.

Note: This is a custom edition of Levin's full Discrete Mathematics text, arranged specifically for use in a discrete math course for future elementary and middle school teachers. (It is NOT a new and updated edition of the main text.)This gentle introduction to discrete mathematics is written for first and second year math majors, especially those who intend to teach. The text began as a set of lecture notes for the discrete mathematics course at the University of Northern Colorado. This course serves both as an introduction to topics in discrete math and as the "introduction to proof" course for math majors. The course is usually taught with a large amount of student inquiry, and this text is written to help facilitate this.Four main topics are covered: counting, sequences, logic, and graph theory. Along the way proofs are introduced, including proofs by contradiction, proofs by induction, and combinatorial proofs.While there are many fine discrete math textbooks available, this text has the following advantages: - It is written to be used in an inquiry rich course.- It is written to be used in a course for future math teachers.- It is open source, with low cost print editions and free electronic editions.

Clear, comprehensive, and rigorous treatment develops the subject from elementary concepts to the construction and analysis of relatively complex logical languages. Hundreds of problems, examples, and exercises. 1958 edition.