An Independent Publisher Serving the Humanities Since 1972.

My Cart:

0 item(s) - $0.00
You have no items in your shopping cart.

0

Formal Logic (Fourth Edition)

Formal Logic (Fourth Edition)

Its Scope and Limits

Richard Jeffrey
Edited, with a New Supplement, by John P. Burgess

2006 - 192 pp.

Format ISBN Price Qty
Cloth 978-0-87220-813-1
$39.00
Examination 978-0-87220-813-1
$5.00

Quick Overview

"Jeffrey’s text is a landmark in the history of logic textbooks. It covers elementary material (using tree rather than natural deduction) yet manages to also cover central material for an advanced undergraduate logic class, and it does so compactly and with finesse in barley over 150 pages. It is unique." —Paul McNamara, University of New Hampshire


 

OR

*Free Instructor’s Manual with examination and desk copy orders*

The first beginning logic text to employ the tree method—a complete formal system of first-order logic that is remarkably easy to understand and use—this text allows students to take control of the nuts and bolts of formal logic quickly, and to move on to more complex and abstract problems.

The tree method is elaborated in manageable steps over five chapters, in each of which its adequacy is reviewed; soundness and completeness proofs are extended at each step, and the decidability proof is extended at the step from truth functions to the logic of nonoverlapping quantifiers with a single variable, after which undecidability is demonstrated by example. The first three chapters are bilingual, with arguments presented twice, in logical notation and in English. The last three chapters consider the discoveries defining the scope and limits of formal methods that marked logic’s coming of age in the 20th century: Godel’s completeness and incompleteness theorems for first and second-order logic, and the Church-Turing theorem on the undecidability of first-order logic.

This new edition provides additional problems, solutions to selected problems, and two new Supplements: "Truth-Functional Equivalence" reinstates material on that topic from the second edition that was omitted in the third, and "Variant Methods," in which John Burgess provides a proof regarding the possibility of modifying the tree method so that it will always find a finite model when there is one, and another, which shows that a different modification—once contemplated by Jeffrey—can result in a dramatic speed-up of certain proofs.

 

Reviews:

"Jeffrey’s text is a landmark in the history of logic textbooks. It covers elementary material (using tree rather than natural deduction) yet manages to also cover central material for an advanced undergraduate logic class, and it does so compactly and with finesse in barley over 150 pages. It is unique."
     —Paul McNamara, University of New Hampshire

 

About the Authors:

Richard Jeffrey (1926-2002) was Professor of Philosophy, Princeton University.

John P. Burgess is Professor of Philosophy, Princeton University.