img Leseprobe Leseprobe

How Logic Works

A User's Guide

Hans Halvorson

ca. 28,99
Amazon iTunes Hugendubel Bü kobo Osiander Google Books Barnes&Noble Legimi
* Affiliatelinks/Werbelinks
Hinweis: Affiliatelinks/Werbelinks
Links auf sind sogenannte Affiliate-Links. Wenn du auf so einen Affiliate-Link klickst und über diesen Link einkaufst, bekommt von dem betreffenden Online-Shop oder Anbieter eine Provision. Für dich verändert sich der Preis nicht.

Princeton University Press img Link Publisher

Geisteswissenschaften, Kunst, Musik / Philosophie


A concise introduction to logic that teaches you not only how reasoning works, but why it works

How Logic Works is an introductory logic textbook that is different by design. Rather than teaching elementary symbolic logic as an abstract or rote mathematical exercise divorced from ordinary thinking, Hans Halvorson presents it as the skill of clear and rigorous reasoning, which is essential in all fields and walks of life, from the sciences to the humanities—anywhere that making good arguments, and spotting bad ones, is critical to success.

Instead of teaching how to apply algorithms using “truth trees,” as in the vast majority of logic textbooks, How Logic Works builds on and reinforces the innate human skills of making and evaluating arguments. It does this by introducing the methods of natural deduction, an approach that teaches students not only how to carry out a proof and solve a problem but also what the principles of valid reasoning are and how they can be applied to any subject. The book also allows students to transition smoothly to more advanced topics in logic by teaching them general techniques that apply to more complicated scenarios, such as how to formulate theories about specific subject matter.

How Logic Works shows that formal logic—far from being only for mathematicians or a diversion from the really deep questions of philosophy and human life—is the best account we have of what it means to be rational. By teaching logic in a way that makes students aware of how they already use it, the book will help them to become even better thinkers.

  • Offers a concise, readable, and user-friendly introduction to elementary symbolic logic that primarily uses natural deduction rather than algorithmic “truth trees”
  • Draws on more than two decades’ experience teaching introductory logic to undergraduates
  • Provides a stepping stone to more advanced topics

Weitere Titel von diesem Autor



Partially ordered set, Mathematical induction, Conjunction elimination, Validity, Natural number, Formal proof, Inductive reasoning, Infimum and supremum, Proof theory, Negation, Modal logic, Logical disjunction, Mathematical logic, Mathematics, Gödel's incompleteness theorems, Predicate logic, Associative property, Material implication (rule of inference), Axiom, Disjunction introduction, Prenex normal form, Set theory, Contradiction, Natural language, Conjunction introduction, Soundness, Decidability (logic), Mathematician, Set (mathematics), Substructural logic, Theorem, Entscheidungsproblem, Fallacy, Intension, Paradox, Propositional calculus, Disjunctive syllogism, Conditional proof, Counterexample, Compact space, Zermelo–Fraenkel set theory, Real number, Logical conjunction, Existential quantification, Classical logic, State of affairs (philosophy), Logic, Truth value, Combination, Direct proof, Empty set, Abstract algebra, Compactness theorem, Modus tollens, Transfinite number, Linear logic, Predicate (mathematical logic), Diagram (category theory), Recursively enumerable set, Successor function, Falsity, Variable (mathematics), Atomic sentence, Intuitionistic logic, Disjunctive normal form, Bayesian statistics, Intuitionism, Rule of inference, Theory, Reductio ad absurdum, Parse tree, Logical connective, Prime number, The Philosopher, First-order logic, Special case, Tautology (logic), Paradoxes of material implication, Quantifier (logic), Logical reasoning, Subset, Consistency, Maximal set, Analogy, Logical biconditional, Disjunction elimination, Integer, Mutual exclusivity, Truth table, Philosophy of mathematics, Inference, Instance (computer science), Sequent, Phrase, Ranking (information retrieval), Non-Euclidean geometry, Truth function, Double negation, AND gate, Sequent calculus