Formal Logic
Autor Paul A. Gregoryen Limba Engleză Paperback – 24 aug 2017
Preț: 404.23 lei
Preț vechi: 462.16 lei
-13%
Puncte Express: 606
Preț estimativ în valută:
71.52€ • 83.15$ • 61.99£
71.52€ • 83.15$ • 61.99£
Carte disponibilă
Livrare economică 11-25 februarie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781554812721
ISBN-10: 1554812720
Pagini: 400
Dimensiuni: 127 x 152 x 11989 mm
Greutate: 0.73 kg
Editura: BROADVIEW PR
Colecția Broadview Press
Locul publicării:Peterborough, Canada
ISBN-10: 1554812720
Pagini: 400
Dimensiuni: 127 x 152 x 11989 mm
Greutate: 0.73 kg
Editura: BROADVIEW PR
Colecția Broadview Press
Locul publicării:Peterborough, Canada
Recenzii
Formal Logic is an undergraduate text suitable for introductory, intermediate, and advanced courses in symbolic logic. The book’s nine chapters offer thorough coverage of truth-functional and quantificational logic, as well as the basics of more advanced topics such as set theory and modal logic. Complex ideas are explained in plain language that doesn’t presuppose any background in logic or mathematics, and derivation strategies are illustrated with numerous examples. Translations, tables, trees, natural deduction, and simple meta-proofs are taught through over 400 exercises. A companion website offers supplemental practice software and tutorial videos.
“Formal Logic is clear, accessible, and intuitive, but it is also precise, explicit, and thorough. Complex and often confusing concepts are rolled out in a no-nonsense and direct manner with funny and demystifying terminology and helpful analogies. It's a pedagogical gem.” — Mary Kate McGowan, Wellesley College
“This is an excellent introductory text in symbolic logic. It is accessible, with clear and concise explanations of key concepts, along with many helpful examples and practice problems, but also rigorous enough to prepare students for a second course in logic; indeed, I do not know of any book that better combines these virtues. I am looking forward to using Formal Logic in my courses.” — Kevin Morris, Tulane University
“This book makes the ideas of sentential logic, predicate logic, and formal proof easily accessible by getting directly to the point of each in natural, non-technical language. It is concise while never hurried. It gets the details right, not by focusing on them as details, but through clear insight into why they are as they are.” — Colin McLarty, Case Western Reserve University
“Paul Gregory’s Formal Logic is worth careful consideration for anyone adopting a new logic text. The inclusion of chapters on set theory and modal logic makes it a valuable resource for students looking to go beyond the standard introduction to logic.” — Michael Hicks, Miami University
“Formal Logic is clear, accessible, and intuitive, but it is also precise, explicit, and thorough. Complex and often confusing concepts are rolled out in a no-nonsense and direct manner with funny and demystifying terminology and helpful analogies. It's a pedagogical gem.” — Mary Kate McGowan, Wellesley College
“This is an excellent introductory text in symbolic logic. It is accessible, with clear and concise explanations of key concepts, along with many helpful examples and practice problems, but also rigorous enough to prepare students for a second course in logic; indeed, I do not know of any book that better combines these virtues. I am looking forward to using Formal Logic in my courses.” — Kevin Morris, Tulane University
“This book makes the ideas of sentential logic, predicate logic, and formal proof easily accessible by getting directly to the point of each in natural, non-technical language. It is concise while never hurried. It gets the details right, not by focusing on them as details, but through clear insight into why they are as they are.” — Colin McLarty, Case Western Reserve University
“Paul Gregory’s Formal Logic is worth careful consideration for anyone adopting a new logic text. The inclusion of chapters on set theory and modal logic makes it a valuable resource for students looking to go beyond the standard introduction to logic.” — Michael Hicks, Miami University
Cuprins
I: Informal Notions
1: Informal Introduction
2: The Language S
5: The Language P
8: Basic Set Theory, Paradox, and Infinity
A: Answers to Exercises
B: Glossary
C: Truth Tables, Tree Rules, and Derivation Rules
1: Informal Introduction
- 1.1 Logic: What, Why, How?
1.2 Arguments, Forms, and Truth Values
1.3 Deductive Criteria- 1.3.1Quirky Cases of Deductive Validity
1.5 Other Deductive Properties
1.6 Exercises
1.7 Chapter Glossary
2: The Language S
- 2.1 Introducing S
- 2.1.1 Compound Sentences and Truth-Functional Logic
2.1.2 Negation—It is not the case that…
2.1.3 Conjunction—Both…and---
2.1.4 Disjunction—Either…or---
2.1.5 Material Conditional—If …, then---
2.1.6 Material Biconditional—…if and only if---
2.1.7 Conditionals and Non-Truth-Functionality- 2.2.1 Object Language and Metalanguage
2.2.2 Use and Mention
2.2.3 Metavariables
2.2.4 Syntax and Semantics- 2.3.1 Defining the Language
2.3.2 Syntactic Concepts and Conventions
2.3.3 Exercises
2.5 Chapter Glossary
- 3.1 Truth Value Assignments and Truth Tables
3.2 Semantic Properties of Individual Wffs- 3.2.1 Exercises
- 3.3.1 Exercises
- 3.4.1 Exercises
- 3.5.1 Tests with Truth Trees
3.5.2 Exercises
- 4.1 The Basic Idea
- 4.1.1 Reiteration
4.1.2 Wedge Rules
4.1.3 Arrow Rules
4.1.4 Hook Rules
4.1.5 Vee Rules
4.1.6 Double Arrow Rules
4.1.7 Exercises
4.3 Proof Theory in SD- 4.3.1 Exercises
- 4.4.1 The Inference Rules of SDE
4.4.2 Exercises
4.4.3 The Replacement Rules of SDE
4.4.4 Exercises
5: The Language P
- 5.1 Introducing P
- 5.1.1 Quantificational Logic
5.1.2 Predicates and Singular Terms
5.1.3 Predicate Letters and Individual Constants in P
5.1.4 Pronouns and Quantifiers
5.1.5 Variables and Quantifiers in P- 5.2.1 Defining the Language
5.2.2 Syntactic Concepts and Conventions
5.2.3 Exercises- 5.3.1 Non-categorical Claims
5.3.2 Exercises
5.3.3 Categorical Claims
5.3.4 Exercises- 5.4.1 Basics of Overlapping Quantifiers
5.4.2 Exercises
5.4.3 Identity, Numerical Quantification, and Definite Descriptions
5.4.4 Exercises
- 6.1 Semantics and Interpretations
- 6.1.1 Basics of Interpretations
6.1.2 Interlude: A Little Bit of Set Theory
6.1.3 Formal Interpretation of P
6.1.4 Constructing Interpretations- 6.2.1 Exercises
- 6.3.1 Exercises
- 6.4.1 Exercises
- 6.5.1 Exercises
- 7.1 Derivation Rules for the Quantifiers
- 7.1.1 Universal Elimination
7.1.2 Existential Introduction
7.1.3 Universal Introduction
7.1.4 Existential Elimination
7.1.5 Exercises
7.3 Proof Theory in PD- 7.3.1 Exercises
- 7.4.1 Quantifier Negation
7.4.2 Exercises
8: Basic Set Theory, Paradox, and Infinity
- 8.1 Basics of Sets
8.2 Russell’s Paradox
8.3 The Axiom Schema of Separation
8.4 Subset, Intersection, Union, Difference- 8.4.1 Exercises
8.6 Infinite Sets and Cantor’s Proof- 8.6.1 Exercises
- 9.1 Necessity, Possibility, and Impossibility
- 9.1.1 Modalities
9.1.2 Logical, Metaphysical, Physical
9.1.3 Possible Worlds- 9.2.1 The Syntax of S
9.2.2 Exercises- 9.3.1 Semantic Properties of Wffs and Sets of Wffs
9.3.2 Exercises
9.3.3 Possible Worlds and Trees
9.3.4 Exercises- 9.4.1 System K
9.4.2 System D
9.4.3 System T
9.4.4 System B
9.4.5 System S4
9.4.6 System S5
9.4.7 Relations Between Modal Systems
9.4.8 Exercises
A: Answers to Exercises
B: Glossary
C: Truth Tables, Tree Rules, and Derivation Rules
- C.1 Characteristic Truth Tables
C.2 Truth Tree Rules for S
C.3 The Derivation System SD
C.4 The Derivation System SDE
C.5 The Derivation System PD