Phil 110, Spring 2007 / April 23, 2007 Practice Questions for the Final Exam on May 7, 2007 (9:00am 12:00noon)
|
|
- Harvey Cecil Elliott
- 5 years ago
- Views:
Transcription
1 Phil 110, Spring 2007 / April 23, 2007 Practice Questions for the Final Exam on May 7, 2007 (9:00am 12:00noon) (1) Which of the following are well-formed sentences of FOL? (Draw a circle around the numbers of the formulas that are well-formed sentences.) 1. Cube(Small(x)) 2. x Cube(Small(x)) 3. Cube(a) 4. x Cube(a) 5. (a c) 6. a = c 7. a Cube(a) 8. Larger(a, a) 9. Larger(a, b) x Cube(x) 10. x Between(x, x, x) 11. x Between(b, x, x) 12. x Between(b, x, c) 13. x (Between(b, x, c) y Small(y)) 14. x (Between(b, x, c) x Small(x)) 15. Tet(a) = Tet(a) 16. (Tet(a) = Tet(a)) 17. Small(Cube(a)) 18. Cube(a) 19. Cube(a) 20. x Cube(x) 21. x x Cube(x) 22. x Cube(x) y Adjoins(x, y) 23. x Cube(x) y Adjoins(a, y) 24. x (Cube(x) y Adjoins(x, y)) 1
2 (2) What are the truth-functional forms of the following sentences? (Use capital letters A, B, C, etc., to represent atomic sentences.) 1. x P(x) x ( Q(x) R(x)) t-f form: 2. x (x = x) t-f form: 3. (( x Q(x) R(a)) x R(x)) x Q(x) t-f form: 4. x (P(x) Q(x)) t-f form: 5. x (Q(x) x (R(x) x S(x))) t-f form: (3) Identify the main connective in each of the following sentences. (Draw a circle around the main connective.) 1. Cube(a) ( Tet(a) Small(a)) 2. (a = c) 3. Cube(a) (( Tet(a) Small(a)) Small(b)) 4. (Cube(a) Cube(c)) 5. Tet(a) Small(a) Medium(b) For the last one, you have to add parentheses first; and there are two acceptable ways to do that. The LPL textbook (p.101) adopts the policy of picking the as the main connective in sequences of conjunctions with no parentheses. (4) Draw a circle around the preceding T or F to indicate whether the respective sentence is true or false: T F 1. All invalid arguments have at least one false premise. T F 2. All tautologies are FO validities. T F 3. All FO validities are tautologies. T F 4. All tautologies are logical necessities. T F 5. All logical necessities are tautologies. T F 6. The symbol is a symbol in FOL. T F 7. Tet(b) is a literal. T F 8. Tet(b) is a literal. T F 9. Tet(b) is a literal. T F 10. Tet(b) is a literal. T F 11. x Tet(x) is a literal. T F 12. Tet(x) is a literal. T F 13. In FOL, an object can have at most one name. 2
3 T F 14. Tet(b) Cube(b) (Tet(b) Cube(b)). T F 15. x Tet(x) x Tet(x). T F 16. Only leopards have spots is logically equivalent to All spotted things are leopards. T F 17. x (Leopard(x) Spotted(x) is a correct translation of All leopards are spotted. T F 18. If P Q, then: Q is a logical consequence of P and vice versa. T F 19. Table(d) Chair(d) says that d is neither a table nor a chair. T F 20. Table(d) Chair(d) says that d is neither a table nor a chair. T F 21. Table(d) Chair(d) says that d is either not a table or not a chair. T F 22. Table(d) Chair(d) says that d is both not a table and not a chair. T F 23. (Table(d) Chair(d)) says that d is neither a table nor a chair. T F 24. (Table(d) Chair(d)) says that d is neither a table nor a chair. T F 25. A valid argument may have false premises. T F 26. A sound argument may have false premises (in a world where it is sound). T F 27. An argument is valid if its conclusion is true whenever its premises are true. T F 28. No valid argument has a false conclusion. T F 29. A sound argument has a true conclusion (in a world where it is sound). T F 30. Formal proofs are as a rule more rigorous than informal proofs. T F 31. An argument may be valid though its conclusion is not actually a logical consequence of its premises. T F 32. Counterexamples may demonstrate invalidity, but examples cannot demonstrate validity. T F 33. Two sentences may have the same truth conditions but not be logically equivalent. T F 34. Two sentences may be logically equivalent but not tautologically equivalent. T F 35. All pairs of sentences that are logically equivalent are tautologically equivalent. T F 36. In a world with no small things, z (Tet(x) Small(x)) would be vacuously true. 3
4 (5) Draw a world which shows that the following argument is invalid: 1. x Square(x) x Striped(x) 2. x (Square(x) Striped(x)) (6) Draw a world which shows that the following argument is invalid: 1. x Square(x) 2. x Square(x) (7) Complete the following truth table (and put an asterisk over the main connective of the given sentence): A B ((A B) (A (B A))) t t t f f t f f Is the given sentence a tautology? yes no Is the given sentence a TT-possibility? yes no 4
5 (8) Complete the following truth table (and put an asterisk over the main connective of the given sentence): A B C ((A B) (A (C B))) t t t t t f t f t t f f Is the given sentence a tautology? yes no Is the given sentence a TT-possibility? yes no (9) Translate the following English sentences into the blocks language: 1. Something is to the left of d, or not. 2. There are no small tetrahedra. 3. Neither b nor d are cubes left of something. 4. Neither b nor d are cubes left of something. [another plausible translation not equivalent to the first one] 5. All cubes and dodecahedra are in the same row but not the same column. 6. All cubes and dodecahedra are in the same row but not the same column. [another plausible translation not equivalent to the first one] 5
6 (10) Fill in the following tables with a Yes or a No in each cell indicating whether the given sentence matches the respective column heading: x Tet(x) x Tet(x) x Tet(x) y Tet(y) x (Tet(x) Tet(x)) x (LeftOf(x, b) RightOf(x, b)) x (Small(x) Medium(x)) ( x Tet(x) x Cube(x) x Dodec(x)) TW Logical FO Necessity Necessity Necessity Tautology (11) Complete the following joint truth table: A B ( A B) A (A B) A B t t t f f t f f Is the third sentence a tautological consequence of the others? yes no If no, draw a star next to a row that serves as a counterexample. If yes, explain why: Is the second sentence a tautological consequence of the others? yes no If no, put an arrow next to a row that serves as a counterexample. If yes, explain why: Which if any of the four sentences are tautologically equivalent? 6
7 (12) Give an example of two sentences that are FO equivalent but which are not tautologically equivalent. (13) Give an example of two sentences that are TW equivalent but which are not FO equivalent. (14) Give an example of two sentences that are TW equivalent but which are not logically equivalent. (15) Give an example of two sentences that are logically equivalent but which are not tautologically equivalent. (16) Give a formal proof showing that x (x = b) is a FO validity: x (x = b) (17) Fill in the missing justifications in the following formal proof: 1. x Cube(x) 2. Cube(b) 3. x Cube(x) Cube(b) 6. x Cube(x) 7
8 (18) Fill in the missing steps in the following formal proof. (Hint: work backwards.) 1. x Cube(x) Elim: 2 4. Elim: 1 5. Intro: 3,4 6. x Cube(x) Intro: 2 5 (19) Fill in the missing justifications in the following formal proof. 1. x (Cube(x) RightOf(x, a)) 2. x (Small(x) Cube(x)) 3. c Small(c) Cube(c) 4. Cube(c) 5. Cube(c) RightOf(c, a) 6. RightOf(c, a) 7. x RightOf(x, a) 8. x RightOf(x, a) (20) Fill in the missing steps in the following formal proof. (Hint: work backwards.) 1. x (Cube(x) Small(x)) 2. x Cube(x) 3. c 4. Elim: Intro: 5 7. Intro: 2, 6 8. Intro: Elim: Elim: 4, x Small(x) Intro:
9 (21) Classify the following statements by placing their numbers in the relevant regions in the Euler diagram below: 1. x ( Tet(x) Cube(x) Dodec(x)) 2. x ( Tet(x) (Cube(x) Dodec(x))) 3. x (Tet(x) Tet(x)) 4. x Tet(x) x Tet(x) 5. ( x Tet(x) x Cube(x)) ( x Cube(x) x Tet(x)) 6. x (Tet(x) Cube(b) x = b) 7. x (Tet(x) Tet(b) x = b) TW Necessities Logical Truths FO Validities Tautologies 9
10 (22) Determine whether the following sentences are true or false in the Tarski-like world depicted below (in 2-D view, where the bottom is to the front). Circle the T or F as appropriate for each sentence. T F 1. z (Tet(z) LeftOf(c, z) T F 2. z (Tet(z) LeftOf(c, z) T F 3. z Cube(z) T F 4. z Cube(z) T F 5. z (FrontOf(z, b) BackOf(z, b)) T F 6. z FrontOf(z, b) z BackOf(z, b) T F 7. z FrontOf(z, b) z (Between(z, b, d) FrontOf(c, z)) T F 8. z FrontOf(z, b) z (Between(b, d, z) FrontOf(c, z)) a c b d 10
Final Exam Theory Quiz Answer Page
Philosophy 120 Introduction to Logic Final Exam Theory Quiz Answer Page 1. (a) is a wff (and a sentence); its outer parentheses have been omitted, which is permissible. (b) is also a wff; the variable
More information2 nd Assignment Answer Key Phil 210 Fall 2013
2 nd Assignment Answer Key Phil 210 Fall 2013 1a. Show that, if Q is a tautological consequence of P 1,..., P n, P, then P Q is a tautological consequence of P 1,..., P n. Proof: Suppose, for conditional
More informationThe Logic of Quantifiers
Chapter 10 The Logic of Quantifiers We have now introduced all of the symbols of first-order logic, though we re nowhere near finished learning all there is to know about them. Before we go on, we should
More informationLogik für Informatiker Logic for computer scientists. Multiple Quantifiers
Logik für Informatiker for computer scientists Multiple Quantifiers WiSe 2011/12 Multiple quantifiers x y Likes(x, y) is very different from y x Likes(x, y) Prenex Normal Form Goal: shift all quantifiers
More informationQuantification What We ve Done. Multiple & Mixed Quantifiers Understanding Quantification. William Starr
What We ve Done Multiple & Mixed Quantifiers Understanding William Starr 11.01.11 1 So far, we ve learned what and mean Recall the semantics and game rules Both based onsatisfaction 2 Use and for translation
More informationLogik für Informatiker Logic for computer scientists
Logik für Informatiker Logic for computer scientists Till Mossakowski WiSe 2013/14 Till Mossakowski Logic 1/ 29 The language of PL1 Till Mossakowski Logic 2/ 29 The language of PL1: individual constants
More informationTautological equivalence. entence equivalence. Tautological vs logical equivalence
entence equivalence Recall two definitions from last class: 1. A sentence is an X possible sentence if it is true in some X possible world. Cube(a) is TW possible sentence. 2. A sentence is an X necessity
More information1.5. Notes for Chapter 5: Introduction to Quantification
36 Symbolic Logic Study Guide: Class Notes 1.5. Notes for Chapter 5: Introduction to Quantification 1.5.1. Basic Components of FOL (5.1-5.4 of the Text) 1. Quantifiers introduced How can we translate the
More informationCompleteness for FOL
Completeness for FOL Completeness Theorem for F Theorem. Let T be a set of sentences of a firstorder language L and let S be a sentence of the same language. If S is a first-order consequence of T, then
More informationLogik für Informatiker Proofs in propositional logic
Logik für Informatiker Proofs in propositional logic WiSe 009/10 al consequence Q is a logical consequence of P 1,, P n, if all worlds that make P 1,, P n true also make Q true Q is a tautological consequence
More informationLogik für Informatiker Logic for computer scientists
Logik für Informatiker Logic for computer scientists Till Mossakowski WiSe 2013/14 Till Mossakowski Logic 1/ 24 Till Mossakowski Logic 2/ 24 Logical consequence 1 Q is a logical consequence of P 1,, P
More informationMore about Quantification
Chapter 14 More about Quantification Many English sentences take the form Q A B where Q is a determiner expression like every, some, the, more than half the, at least three, no, many, Max s, etc.; A is
More informationAnnouncements Multiple & Mixed Quantifiers Understanding Quantification. Quantification What We ve Done. Outline. William Starr
Announcements 04.02 Multiple & Mixed Quantifiers Understanding Quantification 1 HW9 is due next Tuesday William Starr 04.02.09 William Starr Multiple & Mixed Quantifiers (Phil 201.02) Rutgers University
More informationAnnouncements For Methods of Proof for Boolean Logic Proof by Contradiction. Outline. The Big Picture Where is Today? William Starr
Announcements For 09.22 Methods of for Boolean Logic William Starr 1 HW1 grades will be on Bb by end of week 2 HW4 is due on Tuesday This one is mostly written Feel free to type it out! 3 If you have problems
More informationLecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)
Lecture 2 Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits Reading (Epp s textbook) 2.1-2.4 1 Logic Logic is a system based on statements. A statement (or
More informationLogik für Informatiker Logic for computer scientists
Logik für Informatiker for computer scientists WiSe 2009/10 Rooms Monday 12:00-14:00 MZH 1400 Thursday 14:00-16:00 MZH 5210 Exercises (bring your Laptops with you!) Wednesday 8:00-10:00 Sportturm C 5130
More informationa. ~p : if p is T, then ~p is F, and vice versa
Lecture 10: Propositional Logic II Philosophy 130 3 & 8 November 2016 O Rourke & Gibson I. Administrative A. Group papers back to you on November 3. B. Questions? II. The Meaning of the Conditional III.
More informationChapter 14: More on Quantification
Chapter 14: More on Quantification 14.1 Numerical quantification In what we ve seen so far of FOL, our quantifiers are limited to the universal and the existential. This means that we can deal with English
More informationPHIL12A Section answers, 28 Feb 2011
PHIL12A Section answers, 28 Feb 2011 Julian Jonker 1 How much do you know? Give formal proofs for the following arguments. 1. (Ex 6.18) 1 A B 2 A B 1 A B 2 A 3 A B Elim: 2 4 B 5 B 6 Intro: 4,5 7 B Intro:
More informationIntroduction to Sets and Logic (MATH 1190)
Introduction to Sets Logic () Instructor: Email: shenlili@yorku.ca Department of Mathematics Statistics York University Sept 18, 2014 Outline 1 2 Tautologies Definition A tautology is a compound proposition
More informationAnnouncements For Formal Proofs & Boolean Logic I: Extending F with rules for and. Outline
Announcements For 0927 Formal Proofs & Boolean Logic I: Extending F with rules for and William Starr 1 HW4 is due today 2 HW1 grades are posted on Bb heck on them! 3 HW1-3 will be returned soon After you
More informationPHIL 500 Introduction to Logic Prof. Cian Dorr Sample Final Exam Part 1: Translations
PHIL 500 Introduction to Logic Prof. Cian Dorr Sample Final Exam Part 1: Translations Translate each of the following sentences into a dialect of FOL with the following vocabulary: smith : Smith jones
More informationPHIL12A Section answers, 16 February 2011
PHIL12A Section answers, 16 February 2011 Julian Jonker 1 How much do you know? 1. Show that the following sentences are equivalent. (a) (Ex 4.16) A B A and A B A B (A B) A A B T T T T T T T T T T T F
More information3. The Logic of Quantified Statements Summary. Aaron Tan August 2017
3. The Logic of Quantified Statements Summary Aaron Tan 28 31 August 2017 1 3. The Logic of Quantified Statements 3.1 Predicates and Quantified Statements I Predicate; domain; truth set Universal quantifier,
More informationPHIL12A Section answers, 14 February 2011
PHIL12A Section answers, 14 February 2011 Julian Jonker 1 How much do you know? 1. You should understand why a truth table is constructed the way it is: why are the truth values listed in the order they
More informationAnnouncements For The Logic of Atomic Sentences Counterexamples & Formal Proofs. Logical Consequence & Validity The Definitions.
Announcements For 0906 The Logic of Atomic Sentences & William Starr 1 Complete survey for Logic section times (on Bb) Before Wednesday at midnight!! 2 HW1 & HW2 are due next Tuesday But you can start
More informationSection 1.1 Propositions
Set Theory & Logic Section 1.1 Propositions Fall, 2009 Section 1.1 Propositions In Chapter 1, our main goals are to prove sentences about numbers, equations or functions and to write the proofs. Definition.
More informationMat 243 Exam 1 Review
OBJECTIVES (Review problems: on next page) 1.1 Distinguish between propositions and non-propositions. Know the truth tables (i.e., the definitions) of the logical operators,,,, and Write truth tables for
More informationPropositional Logic Not Enough
Section 1.4 Propositional Logic Not Enough If we have: All men are mortal. Socrates is a man. Does it follow that Socrates is mortal? Can t be represented in propositional logic. Need a language that talks
More informationA Little Deductive Logic
A Little Deductive Logic In propositional or sentential deductive logic, we begin by specifying that we will use capital letters (like A, B, C, D, and so on) to stand in for sentences, and we assume that
More informationCSC Discrete Math I, Spring Propositional Logic
CSC 125 - Discrete Math I, Spring 2017 Propositional Logic Propositions A proposition is a declarative sentence that is either true or false Propositional Variables A propositional variable (p, q, r, s,...)
More informationPropositional Logic Review
Propositional Logic Review UC Berkeley, Philosophy 142, Spring 2016 John MacFarlane The task of describing a logical system comes in three parts: Grammar Describing what counts as a formula Semantics Defining
More informationLogic and Truth Tables
Logic and Truth Tables What is a Truth Table? A truth table is a tool that helps you analyze statements or arguments in order to verify whether or not they are logical, or true. There are five basic operations
More informationLogik für Informatiker Formal proofs for propositional logic
Logik für Informatiker Formal proofs for propositional logic WiSe 2009/10 Strategies and tactics in Fitch 1 Understand what the sentences are saying. 2 Decide whether you think the conclusion follows from
More informationTHE LOGIC OF COMPOUND STATEMENTS
CHAPTER 2 THE LOGIC OF COMPOUND STATEMENTS Copyright Cengage Learning. All rights reserved. SECTION 2.1 Logical Form and Logical Equivalence Copyright Cengage Learning. All rights reserved. Logical Form
More informationLogic and Propositional Calculus
CHAPTER 4 Logic and Propositional Calculus 4.1 INTRODUCTION Many algorithms and proofs use logical expressions such as: IF p THEN q or If p 1 AND p 2, THEN q 1 OR q 2 Therefore it is necessary to know
More informationComputation and Logic Definitions
Computation and Logic Definitions True and False Also called Boolean truth values, True and False represent the two values or states an atom can assume. We can use any two distinct objects to represent
More informationChapter 9: Introduction to Quantification
Chapter 9: Introduction to Quantification 9.1 Variables and atomic wffs Variables behave syntactically like names they appear in sentences in the same places that names appear. So all of the following
More informationIntroduction to Metalogic
Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)
More informationChapter 4 : The Logic of Boolean Connec6ves. Not all English connec4ves are truth- func4onal
Chapter 4 : The Logic of Boolean Connec6ves Not all English connec4ves are truth- func4onal Max was at home because Claire went to the library. Home(max) because WentToLibrary(claire) T T T T F T Hence
More information3/29/2017. Logic. Propositions and logical operations. Main concepts: propositions truth values propositional variables logical operations
Logic Propositions and logical operations Main concepts: propositions truth values propositional variables logical operations 1 Propositions and logical operations A proposition is the most basic element
More informationFORMAL PROOFS DONU ARAPURA
FORMAL PROOFS DONU ARAPURA This is a supplement for M385 on formal proofs in propositional logic. Rather than following the presentation of Rubin, I want to use a slightly different set of rules which
More informationPL: Truth Trees. Handout Truth Trees: The Setup
Handout 4 PL: Truth Trees Truth tables provide a mechanical method for determining whether a proposition, set of propositions, or argument has a particular logical property. For example, we can show that
More informationSection 1.1: Logical Form and Logical Equivalence
Section 1.1: Logical Form and Logical Equivalence An argument is a sequence of statements aimed at demonstrating the truth of an assertion. The assertion at the end of an argument is called the conclusion,
More informationTECHNISCHE UNIVERSITEIT EINDHOVEN Faculteit Wiskunde en Informatica. Final exam Logic & Set Theory (2IT61) (correction model)
TECHNISCHE UNIVERSITEIT EINDHOVEN Faculteit Wiskunde en Informatica Final exam Logic & Set Theory (2IT61) (correction model) Thursday November 4, 2016, 9:00 12:00 hrs. (2) 1. Determine whether the abstract
More informationDeMorgan s Laws and the Biconditional. Philosophy and Logic Sections 2.3, 2.4 ( Some difficult combinations )
DeMorgan s aws and the Biconditional Philosophy and ogic Sections 2.3, 2.4 ( Some difficult combinations ) Some difficult combinations Not both p and q = ~(p & q) We won t both sing and dance. A negation
More informationAI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic
AI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic and Predicate Logic Propositional logic Logical connectives Rules for wffs Truth tables for the connectives Using Truth Tables to evaluate
More informationLogic and Propositional Calculus
CHAPTER 4 Logic and Propositional Calculus 4.1 INTRODUCTION Many algorithms and proofs use logical expressions such as: IF p THEN q or If p 1 AND p 2, THEN q 1 OR q 2 Therefore it is necessary to know
More informationLogic and Proofs. (A brief summary)
Logic and Proofs (A brief summary) Why Study Logic: To learn to prove claims/statements rigorously To be able to judge better the soundness and consistency of (others ) arguments To gain the foundations
More informationManual of Logical Style (fresh version 2018)
Manual of Logical Style (fresh version 2018) Randall Holmes 9/5/2018 1 Introduction This is a fresh version of a document I have been working on with my classes at various levels for years. The idea that
More informationTHE LOGIC OF QUANTIFIED STATEMENTS
CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS Copyright Cengage Learning. All rights reserved. SECTION 3.1 Predicates and Quantified Statements I Copyright Cengage Learning. All rights reserved. Predicates
More informationA statement is a sentence that is definitely either true or false but not both.
5 Logic In this part of the course we consider logic. Logic is used in many places in computer science including digital circuit design, relational databases, automata theory and computability, and artificial
More informationA Little Deductive Logic
A Little Deductive Logic In propositional or sentential deductive logic, we begin by specifying that we will use capital letters (like A, B, C, D, and so on) to stand in for sentences, and we assume that
More informationQuantifiers. P. Danziger
- 2 Quantifiers P. Danziger 1 Elementary Quantifiers (2.1) We wish to be able to use variables, such as x or n in logical statements. We do this by using the two quantifiers: 1. - There Exists 2. - For
More informationCS 2740 Knowledge Representation. Lecture 4. Propositional logic. CS 2740 Knowledge Representation. Administration
Lecture 4 Propositional logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square dministration Homework assignment 1 is out Due next week on Wednesday, September 17 Problems: LISP programming a PL
More information3 The Semantics of the Propositional Calculus
3 The Semantics of the Propositional Calculus 1. Interpretations Formulas of the propositional calculus express statement forms. In chapter two, we gave informal descriptions of the meanings of the logical
More informationMath.3336: Discrete Mathematics. Propositional Equivalences
Math.3336: Discrete Mathematics Propositional Equivalences Instructor: Dr. Blerina Xhabli Department of Mathematics, University of Houston https://www.math.uh.edu/ blerina Email: blerina@math.uh.edu Fall
More informationChapter 1 Elementary Logic
2017-2018 Chapter 1 Elementary Logic The study of logic is the study of the principles and methods used in distinguishing valid arguments from those that are not valid. The aim of this chapter is to help
More informationFinal Exam (100 points)
Final Exam (100 points) Honor Code: Each question is worth 10 points. There is one bonus question worth 5 points. In contrast to the homework assignments, you may not collaborate on this final exam. You
More informationINTRODUCTION. Tomoya Sato. Department of Philosophy University of California, San Diego. Phil120: Symbolic Logic Summer 2014
INTRODUCTION Tomoya Sato Department of Philosophy University of California, San Diego Phil120: Symbolic Logic Summer 2014 TOMOYA SATO LECTURE 1: INTRODUCTION 1 / 51 WHAT IS LOGIC? LOGIC Logic is the study
More informationSymbolic Logic 3. For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true.
Symbolic Logic 3 Testing deductive validity with truth tables For an inference to be deductively valid it is impossible for the conclusion to be false if the premises are true. So, given that truth tables
More informationLecture 11: Measuring the Complexity of Proofs
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Advanced Course on Computational Complexity Lecture 11: Measuring the Complexity of Proofs David Mix Barrington and Alexis Maciel July
More informationLogic Review Solutions
Logic Review Solutions 1. What is true concerning the validity of the argument below? (hint: Use a Venn diagram.) 1. All pesticides are harmful to the environment. 2. No fertilizer is a pesticide. Therefore,
More informationTHE LOGIC OF QUANTIFIED STATEMENTS. Predicates and Quantified Statements I. Predicates and Quantified Statements I CHAPTER 3 SECTION 3.
CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS SECTION 3.1 Predicates and Quantified Statements I Copyright Cengage Learning. All rights reserved. Copyright Cengage Learning. All rights reserved. Predicates
More informationx = a Yes No x = x Yes No xcube(y) Yes No x x xcube(x) Yes No x Yes No x(x Cube(x)) Yes No x(tall(x) Short(tim)) Yes No
1 Philosophy 57 Final March 19, 2004 This final is closed-book and closed-notes. There are 100 points total. Within each section, all questions are worth the same number of points. Don t forget to write
More informationChapter 1: Formal Logic
Chapter 1: Formal Logic Dr. Fang (Daisy) Tang ftang@cpp.edu www.cpp.edu/~ftang/ CS 130 Discrete Structures Logic: The Foundation of Reasoning Definition: the foundation for the organized, careful method
More informationLogic and Truth Tables
Logic and ruth ables What is a ruth able? A truth table is a tool that helps you analyze statements or arguments in order to verify whether or not they are logical, or true. here are five basic operations
More information1.1 Language and Logic
c Oksana Shatalov, Spring 2018 1 1.1 Language and Logic Mathematical Statements DEFINITION 1. A proposition is any declarative sentence (i.e. it has both a subject and a verb) that is either true or false,
More informationChapter 1, Section 1.1 Propositional Logic
Discrete Structures Chapter 1, Section 1.1 Propositional Logic These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 6 th ed., by Kenneth H. Rosen, published
More informationLogic and Proofs. (A brief summary)
Logic and Proofs (A brief summary) Why Study Logic: To learn to prove claims/statements rigorously To be able to judge better the soundness and consistency of (others ) arguments To gain the foundations
More informationG52DOA - Derivation of Algorithms Predicate Logic
G52DOA - Derivation of Algorithms Predicate Logic Venanzio Capretta Predicate Logic So far, we studied propositional logic, in which we started with unspecified propositional variables A, B, C, and combined
More informationArguments and Proofs. 1. A set of sentences (the premises) 2. A sentence (the conclusion)
Arguments and Proofs For the next section of this course, we will study PROOFS. A proof can be thought of as the formal representation of a process of reasoning. Proofs are comparable to arguments, since
More informationAnnouncements CompSci 102 Discrete Math for Computer Science
Announcements CompSci 102 Discrete Math for Computer Science Read for next time Chap. 1.4-1.6 Recitation 1 is tomorrow Homework will be posted by Friday January 19, 2012 Today more logic Prof. Rodger Most
More information2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic
CS 103 Discrete Structures Chapter 1 Propositional Logic Chapter 1.1 Propositional Logic 1 1.1 Propositional Logic Definition: A proposition :is a declarative sentence (that is, a sentence that declares
More informationMAT2345 Discrete Math
Fall 2013 General Syllabus Schedule (note exam dates) Homework, Worksheets, Quizzes, and possibly Programs & Reports Academic Integrity Do Your Own Work Course Web Site: www.eiu.edu/~mathcs Course Overview
More informationMaryam Al-Towailb (KSU) Discrete Mathematics and Its Applications Math. Rules Math. of1101 Inference 1 / 13
Maryam Al-Towailb (KSU) Discrete Mathematics and Its Applications Math. Rules 151 - Math. of1101 Inference 1 / 13 Maryam Al-Towailb (KSU) Discrete Mathematics and Its Applications Math. Rules 151 - Math.
More informationNatural deduction for truth-functional logic
Natural deduction for truth-functional logic Phil 160 - Boston University Why natural deduction? After all, we just found this nice method of truth-tables, which can be used to determine the validity or
More informationPropositional Logic Basics Propositional Equivalences Normal forms Boolean functions and digital circuits. Propositional Logic.
Propositional Logic Winter 2012 Propositional Logic: Section 1.1 Proposition A proposition is a declarative sentence that is either true or false. Which ones of the following sentences are propositions?
More informationSolutions to Exercises (Sections )
s to Exercises (Sections 1.1-1.10) Section 1.1 Exercise 1.1.1: Identifying propositions (a) Have a nice day. : Command, not a proposition. (b) The soup is cold. : Proposition. Negation: The soup is not
More informationVALIDITY IN SENTENTIAL LOGIC
ITY IN SENTENTIAL LOGIC 1. Tautologies, Contradictions, And Contingent Formulas...66 2. Implication And Equivalence...68 3. Validity In Sentential Logic...70 4. Testing Arguments In Sentential Logic...71
More informationChapter 1: The Logic of Compound Statements. January 7, 2008
Chapter 1: The Logic of Compound Statements January 7, 2008 Outline 1 1.1 Logical Form and Logical Equivalence 2 1.2 Conditional Statements 3 1.3 Valid and Invalid Arguments Central notion of deductive
More informationPropositional Logic: Part II - Syntax & Proofs 0-0
Propositional Logic: Part II - Syntax & Proofs 0-0 Outline Syntax of Propositional Formulas Motivating Proofs Syntactic Entailment and Proofs Proof Rules for Natural Deduction Axioms, theories and theorems
More informationPropositional Logic Arguments (5A) Young W. Lim 11/30/16
Propositional Logic (5A) Young W. Lim Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version
More informationSection 2.1: Introduction to the Logic of Quantified Statements
Section 2.1: Introduction to the Logic of Quantified Statements In the previous chapter, we studied a branch of logic called propositional logic or propositional calculus. Loosely speaking, propositional
More informationVALIDITY IN SENTENTIAL LOGIC
ITY IN SENTENTIAL LOGIC 1. Tautologies, Contradictions, and Contingent Formulas...62 2. Implication And Equivalence...64 3. Validity in Sentential Logic...66 4. Testing Arguments in Sentential Logic...67
More information(c) Give a proof of or a counterexample to the following statement: (3n 2)= n(3n 1) 2
Question 1 (a) Suppose A is the set of distinct letters in the word elephant, B is the set of distinct letters in the word sycophant, C is the set of distinct letters in the word fantastic, and D is the
More informationArtificial Intelligence Chapter 7: Logical Agents
Artificial Intelligence Chapter 7: Logical Agents Michael Scherger Department of Computer Science Kent State University February 20, 2006 AI: Chapter 7: Logical Agents 1 Contents Knowledge Based Agents
More informationKnowledge Representation. Propositional logic
CS 2710 Foundations of AI Lecture 10 Knowledge Representation. Propositional logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Knowledge-based agent Knowledge base Inference engine Knowledge
More informationWhy Learning Logic? Logic. Propositional Logic. Compound Propositions
Logic Objectives Propositions and compound propositions Negation, conjunction, disjunction, and exclusive or Implication and biconditional Logic equivalence and satisfiability Application of propositional
More informationPropositional Logic Arguments (5A) Young W. Lim 11/8/16
Propositional Logic (5A) Young W. Lim Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version
More informationPropositional Logic: Review
Propositional Logic: Review Propositional logic Logical constants: true, false Propositional symbols: P, Q, S,... (atomic sentences) Wrapping parentheses: ( ) Sentences are combined by connectives:...and...or
More informationINTRODUCTION TO LOGIC. Propositional Logic. Examples of syntactic claims
Introduction INTRODUCTION TO LOGIC 2 Syntax and Semantics of Propositional Logic Volker Halbach In what follows I look at some formal languages that are much simpler than English and define validity of
More informationLogic and Proof. On my first day of school my parents dropped me off at the wrong nursery. There I was...surrounded by trees and bushes!
Logic and Proof On my first day of school my parents dropped me off at the wrong nursery. There I was...surrounded by trees and bushes! 26-Aug-2011 MA 341 001 2 Requirements for Proof 1. Mutual understanding
More informationLearning Goals of CS245 Logic and Computation
Learning Goals of CS245 Logic and Computation Alice Gao April 27, 2018 Contents 1 Propositional Logic 2 2 Predicate Logic 4 3 Program Verification 6 4 Undecidability 7 1 1 Propositional Logic Introduction
More informationPropositional Logic (2A) Young W. Lim 11/8/15
Propositional Logic (2A) Young W. Lim Copyright (c) 2014 2015 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU ree Documentation License, Version
More informationProposition logic and argument. CISC2100, Spring 2017 X.Zhang
Proposition logic and argument CISC2100, Spring 2017 X.Zhang 1 Where are my glasses? I know the following statements are true. 1. If I was reading the newspaper in the kitchen, then my glasses are on the
More informationWhere are my glasses?
Proposition logic and argument CISC2100, Spring 2017 X.Zhang 1 Where are my glasses? I know the following statements are true. 1. If I was reading the newspaper in the kitchen, then my glasses are on the
More informationMathematical Reasoning (Part I) 1
c Oksana Shatalov, Spring 2017 1 Mathematical Reasoning (art I) 1 Statements DEFINITION 1. A statement is any declarative sentence 2 that is either true or false, but not both. A statement cannot be neither
More informationUnit 1. Propositional Logic Reading do all quick-checks Propositional Logic: Ch. 2.intro, 2.2, 2.3, 2.4. Review 2.9
Unit 1. Propositional Logic Reading do all quick-checks Propositional Logic: Ch. 2.intro, 2.2, 2.3, 2.4. Review 2.9 Typeset September 23, 2005 1 Statements or propositions Defn: A statement is an assertion
More informationOn my first day of school my parents dropped me off at the wrong nursery. There I was...surrounded by trees and bushes! 26-Aug-2011 MA
Logic and Proof On my first day of school my parents dropped me off at the wrong nursery. There I was...surrounded by trees and bushes! 26-Aug-2011 MA 341 001 2 Requirements for Proof 1. Mutual understanding
More information