Elements of Deductive Inference: An Introduction to Symbolic Logic / Edition 1

Hardcover (Print)
Rent
Rent from BN.com
$49.66
(Save 71%)
Est. Return Date: 09/09/2014
Buy Used
Buy Used from BN.com
$103.85
(Save 39%)
Item is in good condition but packaging may have signs of shelf wear/aging or torn packaging.
Condition: Used – Good details
Used and New from Other Sellers
Used and New from Other Sellers
from $14.98
Usually ships in 1-2 business days
(Save 91%)
Other sellers (Hardcover)
  • All (13) from $14.98   
  • New (3) from $41.72   
  • Used (10) from $14.98   

Overview

The text covers elementary logic, from statement logic through relational logic with identity and function symbols. The authors acquaint students with formal techniques at a level appropriate for undergraduates, but extends far enough and deep enough into the subject that it is suitable for a brief first-year graduate course. The text covers full and brief truth tables, and presents the method of truth (consistency) trees and natural deduction for the whole of elementary logic. The text's organization allows instructors to cover just statement logic, or statement logic combined with various extensions into predicate logic: monadic logic with or without identity, or the preceding plus relational logic with or without identity and with or without function symbols. At each stage, the instructor may elect to pursue truth trees and/or natural deduction. A final chapter provides a perspective for further study and applications of logic. The text may be used with or without the accompanying software.

Read More Show Less

Editorial Reviews

Booknews
A textbook suitable for a wide range of courses from a brief symbolic logic course for first-year undergraduates through a more detailed first course for seniors and first-year graduate students. Bessie (U. of Central Oklahoma) and Glennan (Butler U.) offer a logically and philosophically rigorous introduction to first-order predicate logic that presupposes neither in substance nor in style a background in mathematics or philosophy. The CD-ROM contains a working Inference Engine. Annotation c. Book News, Inc., Portland, OR (booknews.com)
Read More Show Less

Product Details

  • ISBN-13: 9780534551216
  • Publisher: Cengage Learning
  • Publication date: 8/2/1999
  • Edition description: New Edition
  • Edition number: 1
  • Pages: 496
  • Product dimensions: 6.40 (w) x 9.20 (h) x 0.90 (d)

Table of Contents

Editor''s Preface. Acknowledgments. I. INTRODUCTION. Logic and Argument. Deduction and Induction. Statements, Propositions, and Context. Use and Mention. II. STATEMENT LOGIC I: A NEW LANGUAGE. Introduction. Truth-Functionally Compound Statements. Symbolizing Simple and Compound Statements. Symbolizing More Complex Statements and Arguments. Spelling It Out Formally. III. STATEMENT LOGIC II: SEMANTIC METHODS. Introduction. Truth Tables. Formalized Semantics for SL. Truth-Functional Validity and Tautologousness. Further Semantic Properties and Relationships. Truth-Functional Consistency. The Material Conditional Revisited. Brief Truth Tables. Truth Trees. Using Truth Trees to Test for Other Semantic Properties. The Adequacy of the Tree Method. IV. STATEMENT LOGIC III: SYNTACTIC METHODS. Introduction. Whole Line Inference Rules for DSL. Replacement Rules for DSL. Conditional Proof and Reduction ad Absurdum. Proof Strategy. Proving Tautologousness and Other Semantic Properties. The Adequacy of the Natural Deduction System DSL. Additional Inference Rules. A Second Look at the Truth Table for the Material Conditional. V. PREDICATE LOGIC I: SYNTAX AND SEMANTICS. Introduction. Informal Introduction to the Language of Predicate Logic. Syntax for L. Formal Semantics I: Interpretations. Formal Semantics II: Truth Under an Interpretation. Symbolizing English I: Monadic Logic and Categorical Forms. Symbolizing English II: Polyadic Logic and Nested Quantifiers. Semantic Properties and Relationships for L. Classifying Logical Relations. VI. PREDICATE LOGIC II: SEMANTIC METHODS. Introduction. Truth Trees. Reading Interpretations From Finished Open Paths. The Problem of Infinite Trees. The Adequacy of the Tree Method for Lm and L. Soundness, Completeness, and Undecidability. VII. MONADIC PREDICATE LOGIC III: SYNTACTIC METHODS. Introduction. The Rules UI, EG, and Q. The Rules UG, R, PA-EI and EI. The Adequacy of DL. VIII. EXTENSIONS TO L: IDENTITY, RELATIONS AND FUNCTIONS. Introduction. Syntax and Semantics for L=. Symbolization in L= I: ''At Least'', ''At Most'', and ''Exactly''. Symbolization in L= II: Identity and Polyadic Predicates. Truth Trees for L=. Natural Deduction in L=. Syntax and Semantics for L*. Symbolization in L*. Truth Trees in L*. Natural Deduction in L*. IX. SOME APPLICATIONS AND LIMITATIONS OF L*. Introduction. Definite Descriptions and Ontological Commitment. Axiom Systems for Arithmetic. The Incompleteness of Arithmetic. Applications of Axiomatic Theories to the Philosophy of Science. Higher Order Logic. Modal Logic. Strict and Counterfactual Conditionals. General Intensional Logic. Deontic Logic. Free Logic. Many-Valued Logic. Appendix One: Further Reading in Logic. Appendix Two: Answer to Selected Exercises. Index.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)