III SEMESTER B. A. PHILOSOPHY PHL3B04 - SYMBOLIC LOGIC AND INFORMATICS QUESTION BANK FOR INTERNAL ASSESSMENT. Multiple Choice Questions
|
|
- Adela Merritt
- 5 years ago
- Views:
Transcription
1 III SEMESTER B. A. PHILOSOPHY PHL3B04 - SYMBOLIC LOGIC AND INFORMATICS QUESTION BANK FOR INTERNAL ASSESSMENT Multiple Choice Questions MODULE - I 1. In Symbolic logic, do not change their value. a) Variables b) Constants c) Inference d) Implication 2. A symbol changes its value from argument to argument. a) constant b) variable c) both (a) and (b) d) neither (a) nor (b) 3. By using, the logical form of an argument becomes explicit. a) inferences b) syllogism c) symbols d) none of these 4. By using, the validity of an argument can be determined more accurately. a) symbols b) linguistic expressions c) numbers d) all these 5. The constant symbol stands for. a) negation b) and c) if -- then d) either -- or 6. The constant symbol stands for if -- then relationship. a) ~ b) c) d) כ 7. The constant symbol that stands for and relationship is. a) b) c) ~ d) כ 8. The Constant symbol ~ stands for. a) Negation b) and c) if -- then d) either -- or 9. ~ ~ is. a) negation b) affirmation c) implication d) none of these 10. In proposition, two simple propositions are combined by either -- or. a) Conjunctive b) Negative c) Disjunctive d) Biconditional 63
2 11. In conjunctive propositions, two simple propositions are joined by. a) Either -- or b) if -- then c) negation d) and 12. p q is a proposition. a) Conjunctive b) Negative c) Disjunctive d) Implicative 13. p q is a proposition. a) Conjunctive b) Negative c) Disjunctive d) none of these 14. p q is a proposition. a) Conjunctive b) Negative c) Disjunctive d) Biconditional 15. p q is a/an proposition. a) negative b) conjunctive c) disjunctive d) implicative 16. Milk is not sweet is an example of a proposition. a) disjunctive b) negative c) conjunctive d) biconditional 17. In p q, p and q are. a) variables b) constants c) biconditionals d) none of these 18. is the symbol for. a) negation b) affirmation c) implication d) none of these 19. symbol connects. a) disjuncts b) conjuncts c) biconditionals d) all these 20. is the symbol for. a) negation b) affirmation c) implication d) material equivalence 21. If it is raining then the ground will be wet is an example of. a) Implication b) Negation c) Conjunction d) disjunction 22. is an important work of Russell in collaboration with Whitehead that introduced symbolic logic. a) Principia Mathematica b) Being and Nothingness 64
3 c) Philosophical Investigations d) none of these 23. You will get the job only if you pass the test is symbolized as. a) G P b) G P c) G P d) none of these 24. If a, then b and c is symbolized as. a) a (b c) b) a b c c) ~a b c d) a (b c) 25. is the symbolic expression of p and q. a) p v q b) p q c) p ~ q d) כp q 26. is the symbolic expression of p implies q. a) p v q b) כp q c) p q d) none of these 27. A wedge indicates function. a) Implication b) Negation c) Conjunction d) disjunction 28. A curl is also called. a) wedge b) tilde c) horseshoe d) dot 29. is a truth-functional connective. a) dot b) wedge c) horseshoe d) all these 30. is not a truth-functional connective. a) curl b) dot c) horseshoe d) wedge Answer Key 1 b 2 b 3 c 4 a 5 d 6 d 7 b 8 a 9 b 10 c 11 d 12 c 13 a 14 d 15 d 16 b 17 a 18 d 19 a 20 d 21 a 22 a 23 c 24 a 25 b 26 b 27 d 28 b 29 d 30 a 65
4 MODULE - II 1. is the symbolic expression for p or q. a) p v q b) p q c) p q d) p ~ q 2. is the symbolic expression for p and q. a) p v q b) p q c) p q d) p ~ q 3. is the symbolic expression for p implies q. a) p v q b) p q c) p q d) p ~ q 4. is the symbolic expression for p and negation q. a) p v ~q b) p q c) p ~q d) p ~ q 5. is a compound proposition in which the word and is used to connect statements. a) Conjunction b) Negation c) Syllogism d) Disjunction 6. Find the odd one out. a) Conjunction b) Negation c) Syllogism d) Disjunction 7. It will not both rain and snow. This can be symbolized as. a) ~ (p v q) b) ~ (p q) c) ~ (p q) d) ~ (p q) 8. If Babu attended the class, then Suresh did not can be symbolized as. a) ~ (B S) b) ~ (B v S) c) ~ B S d) B ~S 9. A proposition is one which does not contain any other proposition as its component. a) Compound b) Disjunctive c) Simple d) Contradictory 10. A proposition is the one which contains two or more propositions as its components. a) Compound b) True c) Simple d) False 11. is a compound proposition in which the simple statements are connected by the phrase if --- then. a) Tautology b) Disjunction c) Implication d) Contradiction 66
5 12. The symbol is used to form an implicative statement. a) Wedge b) Tribar c) Tilde d) Horseshoe 13. To connect statements conjunctively, the symbol is used. a) Wedge b) Dot c) Horseshoe d) Tilde 14. Negation is indicated by symbol. a) Tilde b) Dot c) Horseshoe d) Wedge 15. The symbol is used for disjunction. a) Wedge b) Dot c) Horseshoe d) Tilde 16. The symbol indicates material equivalence. a) Tilde b) Tribar c) Horseshoe d) Wedge 17. According to De Morgan s theorem, ~ (p q ) is logically equivalent to. a) (~ p ~ q) b) (~ p v ~ q) c) (~ p ~ q) d) (~ p ~ q) 18. According to De Morgan s theorem, ~ (p v q) is logically equivalent to. a) (~ p ~ q ) b) (~ p v ~ q ) c) (~ p ~ q ) d) (~ p ~ q ) 19. P and are logically equivalent. a) P ~P b) P ~Q c) P Q d) ~ ~ P 20. p q is false if. a) both p and q are false b) both p and q are true c) only p is false d) only q is false 21. p q is false if. a) both p and q are true b) only q is false c) both p and q are false d) none of these 22. If p and q are true, p q is. a) false b) true c) neither (a) nor (b) d) none of these 23. If p is false and q is true, p q is. a) true b) false c) neither (a) nor (b) d) both (a) and (b) 24. If both p and q are false, p q is. 67
6 a) true b) false c) neither (a) nor (b) d) both (a) and (b) ANSWER KEY 1. a 2. b 3. c 4. d 5. a 6. c 7. b 8. d 9. c 10. a 11. c 12. d 13. b 14. a 15. a 16. b 17. b 18. a 19. d 20. a 21. b 22. b 23. a 24. a MODULE - III 1. The statement form with only false substitution instances is called. a) Tautology b) Disjunction c) Contingent d) Contradiction 2. The statement form with only true substitution instances is called. a) Tautology b) Disjunction c) Contingent d) Contradiction 3. The statement form with both true and false substitution instances is called. a) Tautology b) Disjunction c) Contingent d) Contradiction 4. Find the odd one out. a) Tautology b) Disjunction c) Contingent d) Contradiction 5. An argument is valid if and only if it is not possible for all of its premises to be true and its conclusion. a) True b) False c) Tautologous d) Contingent 6. If a sentence form contains four variables, how many lines must its complete truth table? analysis have? a) 12 b) 16 c) 14 d) 18 ANSWER KEY 1. d 2. a 3. c 4. b 5. b 6. b 68
7 MODULE - IV 1. If we can construct a formal proof, the argument is. a) true b) valid c) invalid d) all these 2. The rules of inference for constructing formal proof of validity are self-evident. a) nine b) six c) three d) seven 3. ~p ~ q ~p ~ q is a valid form of. a) Modus Tollens b) Modus Ponens c) Disjunctive Syllogism d) none of these 4. Modus Tollens means denying the. a) consequent b) antecedent c) both (a) and (b) d) neither (a) nor (b) 5. Modus Ponens means the antecedent and the consequent. a) denying b) constructing c) affirming d) none of these 6. The conclusion of a valid constructive dilemma is a/an proposition. a) biconditional b) implicative c) conjunctive d) disjunctive 7. In, the premise is a conjunction. a) Conjunction b) Addition c) Simplification d) Absorption 8. In the rule of inference, H. S. the antecedent in one premise is the in another premise. a) conjunction b) consequent c) antecedent d) none of these 9. In a valid form of disjunctive syllogism, if p q is the first premise and ~p is the second premise, the conclusion will be. a) ~p b) p q c) ~q d) q 10. In, the first premise is an implicative proposition. a) Modus Ponens b) Modus Tollens c) both (a) and (b) d) neither (a) nor (b) 11. Identify the rule used in the following inference. p ~p p a) modus ponens b) modus tollens c) conjunction d) simplification 12. Name the following valid argument form. p q p q a) Modus Ponens b) Modus Tollens 69
8 c) Disjunctive Syllogism d) Hypothetical Syllogism 13. p v q ~p q is an instance of. a) modus ponens b) modus tollens c) disjunctive syllogism d) hypothetical syllogism 14. The rule of conjunction is symbolised as. a) p q b) p c) p d) none of these p (p q) q p v q 15. M (N O) M p q N This is a valid argument form of. a) modus ponens b) modus tollens c) disjunctive syllogism d) constructive dilemma 16. The valid argument form of simplification is. a) p b) p c) p q d) None of these p q q p 17. p q p q q r The conclusion is. a) q r b) p r c) p q d) None of these 18. We construct the formal proof of validity through. a) Rules of inference b) Rules of replacement c) both (a) and (b) d ) All these 19. Identify the rule used in the following instance. (p q) r ~ r ~ (p q) a) Modus ponens b) Modus tollens c) Disjunctive syllogism d) Hypothetical syllogism 20. Find out the rule used in the following inference. 70
9 p p v q a) Simplification b) Addition c) Absorption d) Conjunction ANSWER KEY 1. b 2. a 3. b 4. c 5. c 6. d 7. c 8. b 9. d 10. c 11. d 12. a 13. c 14. b 15. a 16. c 17. b 18. c 19. b 20. b MODULE - V 1. coined the term informatik in a) Karl Hempl b) Karl Steinbuch c) Karl Nic d) Karl Popper 2. The term informatics is the combination of. a) Information and science b) Information and Technology c) Information and Logic d) Information and Automatic 3. A practitioner of Informatics may be called. a) Informatician b) Info technician c) Info scientist d) Info analyst 4. In computer terms, is a representation of a fact or an idea. a) Information b) Data c) Digit d) Picture 5. is data organized or presented in a meaningful fashion. a) Knowledge b) Net work c) LAN d) Information 6. Computer language is also known as. a) Formal language b) Binary language c) Language d) Artificial language 7. Binary language consists of just the two digits. a) 0 and 1 b) 1 and 2 c) 1 and 3 d) 0 and 3 71
10 8. One Kilobyte is equal to: a) bytes b) bytes c) 1024 bytes d) 1024 bits 9. GB means. a) Greatbyte b) Gigabyte c) Gebyte d) Gegebyte 10. PB means: a) Petabyte b) Pigabyte c) Pagebyte d) Pegabyte 11. developed the Ten Commandments of Computer ethics. a) The Computer Value Institute b) The Computer Institute of Ethics c) The Computer Legal Institute d) The Computer Ethics Institute 12. The ethical computing guidelines are also known as. a) Ethical computation b) Ten Commandments of Computer Ethics c) Morals of Computing d) Green Computing 13. is a right to be left alone to do as one pleases. a) Claim b) Freedom c) Privacy d) Choice 14. The term information overload was first coined by. a) AlvinToffler b) Karl Steinbuch c) Stallman d) Hoffman 15. is the author of the book Future Shock. a) Hoffman Hoffman b) Karl Steinbuch c) Stallman d) AlvinToffler 16. Toffler projects the concept of information overload as a/an. a) Ethical disorder b) Psychological disorder c) Social disorder d) Political disorder 17. An individual who becomes too much dependent on computer and internet is called a. a) Computer addict b) Internet addict c) Cyber addict d) Game addict 18. Too much use of computer and internet is called. a) Computer addiction b) Cyber addiction c) Internet addiction d) None of these 19. In India, cyber laws have been defined under the. a.) IT Act 2000 b) IT Act 2003 c) IT Act 2005 d) IT Act In the Not gate, the output A is true if the input X is. a) true b) not true c) on d) none of these 21. In the Or gate, the output X is if the input A is zero and the input B is one. a) zero b) two c) one d) zero, zero 72
11 22. In the And gate, the output X is true if the input. a) A is true b) B is true c) both (a) and (b) d) neither (a) nor (b) 23. The Not gate has. a) two inputs b) three inputs c) no input d) only one input 24. The following truth table represents gate. INPUT OUTPUT a) AND b) NOT c) OR d) NOR ANSWER KEY 1. b 2. d 3. a 4. b 5. d 6. b 7. a 8. c 9. b 10. a 11. d 12. b 13. c 14. a 15. d 16. b 17. c 18. b 19. a 20. b 21. c 22. c 23. d 24. b 73
12 prepared by S. No Name and address of the teachers Assignment 1 Dr. M. Ramakrishnan Former Head of the Dept. of Philosophy Govt. Brennen College Thalassery (Chairperson, Board of Studies in Philosophy, University of Calicut) mramakrishnan1@rediffmail.com 2 Dr. K. Syamala Head of the Dept. of Philosophy Sree Sankaracharya University of Sanskrit, Regional Center Edat, Payyannur, Kannur (Dt.) syamaladev@rediffmail.com 3 Dr. Sirajul Muneer. C Assistant Professor of Philosophy Sree Sankaracharya University of Sanskrit, Regional Center Edat, Payyannur, Kannur (Dt.) muneer.is.siraj@gmail.com 4 Ms. Priya Assistant Professor of Philosophy Govt. Brennen College Thalassery priyaharshan@rediffmail.com 5 Dr. Smitha T. M. Assistant Professor of Philosophy Maharaja s College Ernakulum Cochin smithanil2010@gmail.com Coordinator Module I Module II & III Module IV Module V 74
Summary of Course Coverage
CS-227, Discrete Structures I Spring 2006 Semester Summary of Course Coverage 1) Propositional Calculus a) Negation (logical NOT) b) Conjunction (logical AND) c) Disjunction (logical inclusive-or) d) Inequalities
More informationCSL105: Discrete Mathematical Structures. Ragesh Jaiswal, CSE, IIT Delhi
is another way of showing that an argument is correct. Definitions: Literal: A variable or a negation of a variable is called a literal. Sum and Product: A disjunction of literals is called a sum and a
More informationPlease try all of the TRY THIS problems throughout this document. When done, do the following:
AP Computer Science Summer Assignment Dr. Rabadi-Room 1315 New Rochelle High School nrabadi@nredlearn.org One great resource for any course is YouTube. Please watch videos to help you with any of the summer
More informationPropositional Calculus
Propositional Calculus Proposition is a statement that is either or. Example 1 Propositions: It rains. Sun is shining and my coat is wet. If Ann plays with me, I give her a candy. x > 10 x = 1 and y
More information1. Logic as a subject matter is the study of logics, understood as models of acceptable inference patterns
Lecture 9: Propositional Logic I Philosophy 130 23 & 28 October 2014 O Rourke I. Administrative A. Problem sets due Thursday, 30 October B. Midterm course evaluations C. Questions? II. Logic and Form A.
More informationCSI30. Chapter 1. The Foundations: Logic and Proofs Rules of inference with quantifiers Logic and bit operations Specification consistency
Chapter 1. The Foundations: Logic and Proofs 1.13 Rules of inference with quantifiers Logic and bit operations Specification consistency 1.13 Rules of inference with quantifiers universal instantiation
More informationWhat is the study of logic?
Chapter 2: The Representation of Knowledge Expert Systems: Principles and Programming, Fourth Edition What is the study of logic? Logic is the study of making inferences given a set of facts, we attempt
More informationResolution (14A) Young W. Lim 6/14/14
Copyright (c) 2013-2014. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free
More informationClass 8 - September 13 Indirect Truth Tables for Invalidity and Inconsistency ( 6.5)
Philosophy 240: Symbolic Logic Fall 2010 Mondays, Wednesdays, Fridays: 9am - 9:50am Hamilton College Russell Marcus rmarcus1@hamilton.edu Class 8 - September 13 Indirect Truth Tables for Invalidity and
More informationMathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras. Lecture - 9 Normal Forms
Mathematical Logic Prof. Arindama Singh Department of Mathematics Indian Institute of Technology, Madras Lecture - 9 Normal Forms In the last class we have seen some consequences and some equivalences,
More informationCIS 194: Homework 8. Due Wednesday, 8 April. Propositional Logic. Implication
CIS 194: Homework 8 Due Wednesday, 8 April Propositional Logic In this section, you will prove some theorems in Propositional Logic, using the Haskell compiler to verify your proofs. The Curry-Howard isomorphism
More informationCS 380/480 Foundations of Artificial Intelligence Winter 2007 Assignment 2 Solutions to Selected Problems
CS 380/480 Foundations of Artificial Intelligence Winter 2007 Assignment 2 Solutions to Selected Problems 1. Search trees for the state-space graph given below: We only show the search trees corresponding
More information1 Introduction to Logic
1 Introduction to Logic Some Vocabulary Logic is the science of discursive reasoning.1 As a science, logic aims to discover general laws that apply to all discursive reasoning. Narrowly specific kinds
More informationPropositional Calculus: Boolean Algebra and Simplification. CS 270: Mathematical Foundations of Computer Science Jeremy Johnson
Propositional Calculus: Boolean Algebra and Simplification CS 270: Mathematical Foundations of Computer Science Jeremy Johnson Propositional Calculus Topics Motivation: Simplifying Conditional Expressions
More informationDeclarative Programming. 2: theoretical backgrounds
Declarative Programming 2: theoretical backgrounds 1 Logic Systems: structure and meta-theoretical properties logic system syntax semantics proof theory defines which sentences are legal in the logical
More informationFUZZY BOOLEAN ALGEBRAS AND LUKASIEWICZ LOGIC. Angel Garrido
Acta Universitatis Apulensis ISSN: 1582-5329 No. 22/2010 pp. 101-111 FUZZY BOOLEAN ALGEBRAS AND LUKASIEWICZ LOGIC Angel Garrido Abstract. In this paper, we analyze the more adequate tools to solve many
More informationProgram Verification & Testing; Review of Propositional Logic
8/24: p.1, solved; 9/20: p.5 Program Verification & Testing; Review of Propositional Logic CS 536: Science of Programming, Fall 2018 A. Why Course guidelines are important. Active learning is the style
More informationTruth Functional Properties on Truth Trees
Truth Functional Properties on Truth Trees Truth-functional: Truth Falsity Indeterminacy Entailment Validity Equivalence Consistency A set of sentences of SL is truth-functionally consistent if and only
More informationSection 2.4: Arguments with Quantified Statements
Section 2.4: Arguments with Quantified Statements In this section, we shall generalize the ideas we developed in Section 1.3 to arguments which involve quantified statements. Most of the concepts we shall
More informationLogical Connectives. All kittens are cute. ; I like pizza. ; The sky is blue. ; Triangles have three sides.
Logical Connectives We have learned what a statement is. Recall that a statement is just a proposition that asserts something that is either true or false. For instance, these are propositions: All kittens
More informationGeometry Note-Sheet Overview
Geometry Note-Sheet Overview 1. Logic a. A mathematical sentence is a sentence that states a fact or contains a complete idea. Open sentence it is blue x+3 Contains variables Cannot assign a truth variable
More informationAbout the Tutorial. Audience. Prerequisites. Copyright & Disclaimer. Discrete Mathematics
About the Tutorial Discrete Mathematics is a branch of mathematics involving discrete elements that uses algebra and arithmetic. It is increasingly being applied in the practical fields of mathematics
More informationCPSC 121: Models of Computation. Module 6: Rewriting predicate logic statements
CPSC 121: Models of Computation Module 6: Rewriting predicate logic statements Module 6: Rewriting predicate logic statements Pre-class quiz #7 is due March 1st at 19:00. Assigned reading for the quiz:
More informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Final exam The final exam is Saturday December 16 11:30am-2:30pm. Lecture A will take the exam in Lecture B will take the exam
More informationPropositional Logic. Part I
Part I Propositional Logic 1 Classical Logic and the Material Conditional 1.1 Introduction 1.1.1 The first purpose of this chapter is to review classical propositional logic, including semantic tableaux.
More informationLecture 5. Logic I. Statement Logic
Ling 726: Mathematical Linguistics, Logic. Statement Logic V. Borschev and B. Partee, September 27, 2 p. Lecture 5. Logic I. Statement Logic. Statement Logic...... Goals..... Syntax of Statement Logic....2.
More informationFor Off Campus BCA Programme
BCA DISCRETE MATHEMATICS For Off Campus BCA Programme UNIT 1 1. The range of the function f(x) = (x 2 - x) / (x 2 +2x) is a) R b) R {1 } c) R {-1/2, 1} d) None of these 2. The range of the function f(x)
More informationTHE LOGIC OF QUANTIFIED STATEMENTS
CHAPTER 3 THE LOGIC OF QUANTIFIED STATEMENTS Copyright Cengage Learning. All rights reserved. SECTION 3.4 Arguments with Quantified Statements Copyright Cengage Learning. All rights reserved. Arguments
More informationSection 1.1 Logic LOGIC
Section 1.1 Logic 1.1.1 1.1 LOGIC Mathematics is used to predict empirical reality, and is therefore the foundation of engineering. Logic gives precise meaning to mathematical statements. PROPOSITIONS
More informationTHE FOUNDATIONS OF MATHEMATICS
THE FOUNDATIONS OF MATHEMATICS By: Sterling McKay APRIL 21, 2014 LONE STAR - MONTGOMERY Mentor: William R. Brown, MBA Mckay 1 In mathematics, truth is arguably the most essential of its components. Suppose
More informationQuantification. Using the suggested notation, symbolize the statements expressed by the following sentences.
Quantification In this and subsequent chapters, we will develop a more formal system of dealing with categorical statements, one that will be much more flexible than traditional logic, allow a deeper analysis
More informationPropositional Logic Formal Syntax and Semantics. Computability and Logic
Propositional Logic Formal Syntax and Semantics Computability and Logic Syntax and Semantics Syntax: The study of how expressions are structured (think: grammar) Semantics: The study of the relationship
More informationSTABILITY AND PARADOX IN ALGORITHMIC LOGIC
STABILITY AND PARADOX IN ALGORITHMIC LOGIC WAYNE AITKEN, JEFFREY A. BARRETT Abstract. Algorithmic logic is the logic of basic statements concerning algorithms and the algorithmic rules of deduction between
More informationHomework 1 CS 1050 A Due:
9-4-08 Homework 1 CS 1050 A Due: 9-11-08 Every assignment will be due at the beginning of class. Recall that you can collaborate in groups and/or use external references, but you must acknowledge the group/references
More informationAbout the Tutorial. Audience. Prerequisites. Copyright & Disclaimer. Discrete Mathematics
About the Tutorial Discrete Mathematics is a branch of mathematics involving discrete elements that uses algebra and arithmetic. It is increasingly being applied in the practical fields of mathematics
More informationPropositional logic (Ch. 7)
Propositional logic (Ch. 7) Announcements Writing 3 due Sunday - ideally use for project - if you haven't decided project by then, you will have to redo this work Logic: definitions We say that two sentences
More informationAn Introduction to Critical Thinking and Symbolic Logic: Volume 1 Formal Logic
An Introduction to Critical Thinking and Symbolic Logic: Volume 1 Formal Logic Rebeka Ferreira and Anthony Ferrucci 1 1 An Introduction to Critical Thinking and Symbolic Logic: Volume 1 Formal Logic is
More informationChapter 3. Set Theory. 3.1 What is a Set?
Chapter 3 Set Theory 3.1 What is a Set? A set is a well-defined collection of objects called elements or members of the set. Here, well-defined means accurately and unambiguously stated or described. Any
More informationProofs are Programs. Prof. Clarkson Fall Today s music: Proof by Paul Simon
Proofs are Programs Prof. Clarkson Fall 2017 Today s music: Proof by Paul Simon Review Previously in 3110: Functional programming in Coq Logic in Coq Today: A fundamental idea that goes by many names...
More informationIN A NUTSHELL : WHAT IS A VENN DIAGRAM?
For anyone who tries to Google anything today (August 4, 2014), you may notice that, according to Google, today is the 180 th birthday of the logician John Venn. Those who have taken a course in logic
More information(a) (4 pts) Prove that if a and b are rational, then ab is rational. Since a and b are rational they can be written as the ratio of integers a 1
CS 70 Discrete Mathematics for CS Fall 2000 Wagner MT1 Sol Solutions to Midterm 1 1. (16 pts.) Theorems and proofs (a) (4 pts) Prove that if a and b are rational, then ab is rational. Since a and b are
More informationDefinition: A context-free grammar (CFG) is a 4- tuple. variables = nonterminals, terminals, rules = productions,,
CMPSCI 601: Recall From Last Time Lecture 5 Definition: A context-free grammar (CFG) is a 4- tuple, variables = nonterminals, terminals, rules = productions,,, are all finite. 1 ( ) $ Pumping Lemma for
More informationKnowledge Representation
Knowledge Representation References Rich and Knight, Artificial Intelligence, 2nd ed. McGraw-Hill, 1991 Russell and Norvig, Artificial Intelligence: A modern approach, 2nd ed. Prentice Hall, 2003 Outline
More informationChapter 1.3 Quantifiers, Predicates, and Validity. Reading: 1.3 Next Class: 1.4. Motivation
Chapter 1.3 Quantifiers, Predicates, and Validity Reading: 1.3 Next Class: 1.4 1 Motivation Propositional logic allows to translate and prove certain arguments from natural language If John s wallet was
More informationMath 6 Midterm Review Solutions
Math Midterm Review Solutions 1. a statement b not a statement truth or falsity depends on the reference for the pronoun she c statement d not a statement truth or falsity depends on the reference for
More informationSolutions to Selected Exercises
Chapter 1 Solutions to Selected Exercises Section 1.1 2. {2, 4} 3. {7, 10} 5. {2, 3, 5, 6, 8, 9} 6. {1, 3, 5, 7, 9, 10} 8. A 9. 11. B 12. {1, 4} 14. {1} 15. {2, 3, 4, 5, 6, 7, 8, 9, 10} 18. 1 19. 3 22.
More informationPropositional Logic. Andreas Klappenecker
Propositional Logic Andreas Klappenecker Propositions A proposition is a declarative sentence that is either true or false (but not both). Examples: College Station is the capital of the USA. There are
More information[Ch 6] Set Theory. 1. Basic Concepts and Definitions. 400 lecture note #4. 1) Basics
400 lecture note #4 [Ch 6] Set Theory 1. Basic Concepts and Definitions 1) Basics Element: ; A is a set consisting of elements x which is in a/another set S such that P(x) is true. Empty set: notated {
More informationPROPOSITIONAL LOGIC (2)
PROPOSITIONAL LOGIC (2) based on Huth & Ruan Logic in Computer Science: Modelling and Reasoning about Systems Cambridge University Press, 2004 Russell & Norvig Artificial Intelligence: A Modern Approach
More informationAnswer Key #1 Phil 414 JL Shaheen Fall 2010
Answer Key #1 Phil 414 JL Shaheen Fall 2010 1. 1.42(a) B is equivalent to B, and so also to C, where C is a DNF formula equivalent to B. (By Prop 1.5, there is such a C.) Negated DNF meets de Morgan s
More informationNP-Completeness of 3SAT, 1-IN-3SAT and MAX 2SAT
NP-Completeness of 3SAT, 1-IN-3SAT and MAX 2SAT 3SAT The 3SAT problem is the following. INSTANCE : Given a boolean expression E in conjunctive normal form (CNF) that is the conjunction of clauses, each
More informationDISCRETE MATHEMATICS
DISCRETE MATHEMATICS WITH APPLICATIONS THIRD EDITION SUSANNA S. EPP DePaul University THOIVISON * BROOKS/COLE Australia Canada Mexico Singapore Spain United Kingdom United States CONTENTS Chapter 1 The
More informationOrder from Chaos. University of Nebraska-Lincoln Discrete Mathematics Seminar
Order from Chaos University of Nebraska-Lincoln Discrete Mathematics Seminar Austin Mohr Department of Mathematics Nebraska Wesleyan University February 8, 20 The (, )-Puzzle Start by drawing six dots
More information== is a decent equivalence
Table of standard equiences 30/57 372 TABLES FOR PART I Propositional Logic Lecture 2 (Chapter 7) September 9, 2016 Equiences for connectives Commutativity: Associativity: P Q == Q P, (P Q) R == P (Q R),
More informationPropositional Logic:
CS2209A 2017 Applied Logic for Computer Science Lecture 2 Propositional Logic: Syntax, semantics, truth table Instructor: Yu Zhen Xie Language of logic: building blocks Proposition: A sentence that can
More informationLOGIC AND DISCRETE MATHEMATICS
LOGIC AND DISCRETE MATHEMATICS A Computer Science Perspective WINFRIED KARL GRASSMANN Department of Computer Science University of Saskatchewan JEAN-PAUL TREMBLAY Department of Computer Science University
More informationPropositional Calculus. Math Foundations of Computer Science
Propositional Calculus Math Foundations of Computer Science Propositional Calculus Objective: To provide students with the concepts and techniques from propositional calculus so that they can use it to
More informationIntroduction to Computer Architecture
Boolean Operators The Boolean operators AND and OR are binary infix operators (that is, they take two arguments, and the operator appears between them.) A AND B D OR E We will form Boolean Functions of
More informationLecture Notes 15 Number systems and logic CSS Data Structures and Object-Oriented Programming Professor Clark F. Olson
Lecture Notes 15 Number systems and logic CSS 501 - Data Structures and Object-Oriented Programming Professor Clark F. Olson Number systems The use of alternative number systems is important in computer
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Final exam The final exam is Saturday March 18 8am-11am. Lecture A will take the exam in GH 242 Lecture B will take the exam
More informationMixed Integer Linear Programming
Mixed Integer Linear Programming Part I Prof. Davide M. Raimondo A linear program.. A linear program.. A linear program.. Does not take into account possible fixed costs related to the acquisition of new
More informationCS351, Mock Introduction Automata: The Methods and the Madness
CS351, Mock Introduction Automata: The Methods and the Madness What is this course about? Automata theory is the study of abstract computing devices, or machines. This topic goes back to the days before
More informationPropositional Calculus. CS 270: Mathematical Foundations of Computer Science Jeremy Johnson
Propositional Calculus CS 270: Mathematical Foundations of Computer Science Jeremy Johnson Propositional Calculus Objective: To provide students with the concepts and techniques from propositional calculus
More informationNote: For #10 I have written out the solutions in more detail than you would be required to give.
Math 218 Spring 2010 Homework 4 Solutions Section 1.5 Note: For #10 I have written out the solutions in more detail than you would be required to give. 10) For each of these sets of premises, what relevant
More informationHASTINGS HIGH SCHOOL
HASTINGS HIGH SCHOOL EXAMINATION GUIDE 2017-19 Subject Course code Website address Provisional examination dates Computer Science Computer Science (9-1) - J276 https://www.ocr.org.uk/qualifications/gcse/computerscience-j276-from-2016/
More informationAutomated Reasoning PROLOG and Automated Reasoning 13.4 Further Issues in Automated Reasoning 13.5 Epilogue and References 13.
13 Automated Reasoning 13.0 Introduction to Weak Methods in Theorem Proving 13.1 The General Problem Solver and Difference Tables 13.2 Resolution Theorem Proving 13.3 PROLOG and Automated Reasoning 13.4
More informationLogic and its Applications
Logic and its Applications Edmund Burke and Eric Foxley PRENTICE HALL London New York Toronto Sydney Tokyo Singapore Madrid Mexico City Munich Contents Preface xiii Propositional logic 1 1.1 Informal introduction
More informationKnowledge Representation Issues, Predicate Logic, Rules
Knowledge Representations : AI Course Lecture 15 22, notes, slides www.myreaders.info/, RC Chakraborty, e-mail rcchak@gmail.com, June 01, 2010 www.myreaders.info/html/artificial_intelligence.html www.myreaders.info
More informationChapter 9 Deductive Arguments II Truth-Functional Logic. Tutorial: Truth Tables
Chapter 9 Deductive Arguments II ruth-unctional Logic utorial: ruth ables ruth ables he aim of this tutorial is to help you learn to construct truth tables and use them to test the validity of arguments.
More informationFormal Methods of Software Design, Eric Hehner, segment 1 page 1 out of 5
Formal Methods of Software Design, Eric Hehner, segment 1 page 1 out of 5 [talking head] Formal Methods of Software Engineering means the use of mathematics as an aid to writing programs. Before we can
More information(d) If the moon shares nothing and the sun does not share our works, then the earth is alive with creeping men.
Math 15 - Spring 17 Chapters 1 and 2 Test Solutions 1. Consider the declaratives statements, P : The moon shares nothing. Q: It is the sun that shares our works. R: The earth is alive with creeping men.
More informationSTABILITY AND PARADOX IN ALGORITHMIC LOGIC
Journal of Philosophical Logic (2007) 36: 61 95 DOI: 10.1007/s10992-005-9024-5 # Springer 2006 WAYNE AITKEN and JEFFREY A. BARRETT STABILITY AND PARADOX IN ALGORITHMIC LOGIC Received on 25 May 2005 ABSTRACT.
More informationPropositional Logic. Application of Propositional logic
DISCRETE STRUCTURE Propositional Logic Application of Propositional logic Propositional logic is the study of propositions (true or false statements) and ways of combining them (logical operators) to
More informationCSC 501 Semantics of Programming Languages
CSC 501 Semantics of Programming Languages Subtitle: An Introduction to Formal Methods. Instructor: Dr. Lutz Hamel Email: hamel@cs.uri.edu Office: Tyler, Rm 251 Books There are no required books in this
More informationCS221 / Autumn 2017 / Liang & Ermon. Lecture 17: Logic II
CS221 / Autumn 2017 / Liang & Ermon Lecture 17: Logic II Review: ingredients of a logic Syntax: defines a set of valid formulas (Formulas) Example: Rain Wet Semantics: for each formula, specify a set of
More informationCS40-S13: Functional Completeness
CS40-S13: Functional Completeness Victor Amelkin victor@cs.ucsb.edu April 12, 2013 In class, we have briefly discussed what functional completeness means and how to prove that a certain system (a set)
More informationBOOLEAN ALGEBRA AND CIRCUITS
UNIT 3 Structure BOOLEAN ALGEBRA AND CIRCUITS Boolean Algebra and 3. Introduction 3. Objectives 3.2 Boolean Algebras 3.3 Logic 3.4 Boolean Functions 3.5 Summary 3.6 Solutions/ Answers 3. INTRODUCTION This
More informationCS Bootcamp Boolean Logic Autumn 2015 A B A B T T T T F F F T F F F F T T T T F T F T T F F F
1 Logical Operations 1.1 And The and operator is a binary operator, denoted as, &,, or sometimes by just concatenating symbols, is true only if both parameters are true. A B A B F T F F F F The expression
More information6.080 / Great Ideas in Theoretical Computer Science Spring 2008
MIT OpenCourseWare http://ocw.mit.edu 6.8 / 6.89 Great Ideas in Theoretical Computer Science Spring 28 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.
More informationOrder from Chaos. Nebraska Wesleyan University Mathematics Circle
Order from Chaos Nebraska Wesleyan University Mathematics Circle Austin Mohr Department of Mathematics Nebraska Wesleyan University February 2, 20 The (, )-Puzzle Start by drawing six dots at the corners
More informationCSE 215: Foundations of Computer Science Recitation Exercises Set #4 Stony Brook University. Name: ID#: Section #: Score: / 4
CSE 215: Foundations of Computer Science Recitation Exercises Set #4 Stony Brook University Name: ID#: Section #: Score: / 4 Unit 7: Direct Proof Introduction 1. The statement below is true. Rewrite the
More informationSoftware Engineering Lecture Notes
Software Engineering Lecture Notes Paul C. Attie August 30, 2013 c Paul C. Attie. All rights reserved. 2 Contents I Hoare Logic 11 1 Propositional Logic 13 1.1 Introduction and Overview..............................
More informationCPSC 121 Midterm 2 Friday November 13th, 2015
CPSC 121 Midterm 2 Friday November 13th, 2015 [10] 1. For each of the following statements: Rewrite the statement using predicate logic. Write down ALL of the proof strategies (from the list given below),
More informationlogic with quantifiers (informally)
EDAA40 Discrete Structures in Computer Science 8: Quantificational logic Jörn W. Janneck, Dept. of Computer Science, Lund University logic with quantifiers (informally) Given a logical formula that depends
More informationA Framework for Securing Databases from Intrusion Threats
A Framework for Securing Databases from Intrusion Threats R. Prince Jeyaseelan James Department of Computer Applications, Valliammai Engineering College Affiliated to Anna University, Chennai, India Email:
More informationMathematical Logic Part Two
Mathematical Logic Part Two Recap from Last Time Recap So Far A propositional variable a variable that either true or false. The propositional connectives are as follows: Negation: p Conjunction: p q Djunction:
More informationDeduction Rule System vs Production Rule System. Prof. Bob Berwick. Rules Rule
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.034 Artificial Intelligence, Fall 2003 Recitation 2, September 11/12 Rules Rule Prof. Bob Berwick Agenda
More informationA Survey of Mathematics with Applications 8 th Edition, 2009
A Correlation of A Survey of Mathematics with Applications 8 th Edition, 2009 South Carolina Discrete Mathematics Sample Course Outline including Alternate Topics and Related Objectives INTRODUCTION This
More informationThomas Jefferson High School for Science and Technology Program of Studies TJ Math 1
Course Description: This course is designed for students who have successfully completed the standards for Honors Algebra I. Students will study geometric topics in depth, with a focus on building critical
More informationSelf-reproducing programs. And Introduction to logic. COS 116: 3/6/2008 Sanjeev Arora
Self-reproducing programs. And Introduction to logic. COS 6: 3/6/28 Sanjeev Arora Discussion Time Did Theory of Everything article make you look at something in a new way? How does it connect to Tuesday
More informationMath Week in Review #5. A proposition, or statement, is a declarative sentence that can be classified as either true or false, but not both.
Math 166 Fall 2006 c Heather Ramsey Page 1 Math 166 - Week in Review #5 Sections A.1 and A.2 - Propositions, Connectives, and Truth Tables A proposition, or statement, is a declarative sentence that can
More informationNeural Networks Lesson 9 - Fuzzy Logic
Neural Networks Lesson 9 - Prof. Michele Scarpiniti INFOCOM Dpt. - Sapienza University of Rome http://ispac.ing.uniroma1.it/scarpiniti/index.htm michele.scarpiniti@uniroma1.it Rome, 26 November 2009 M.
More informationA Brief Introduction to Truth-Table Logic. Kent Slinker Pima Community College
` A Brief Introduction to ruth-able Logic Kent Slinker Pima Community College Earlier in this class, we learned that all arguments are either valid or invalid. Additionally, we learned that certain valid
More informationKnowledge Representation. CS 486/686: Introduction to Artificial Intelligence
Knowledge Representation CS 486/686: Introduction to Artificial Intelligence 1 Outline Knowledge-based agents Logics in general Propositional Logic& Reasoning First Order Logic 2 Introduction So far we
More information(More) Propositional Logic and an Intro to Predicate Logic. CSCI 3202, Fall 2010
(More) Propositional Logic and an Intro to Predicate Logic CSCI 3202, Fall 2010 Assignments Next week: Guest lectures (Jim Martin and Nikolaus Correll); Read Chapter 9 (but you can skip sections on logic
More informationDraft sample. Chapter 1 Data structures. Learning objectives
Chapter 1 Data structures Learning objectives Describe, interpret and manipulate data structures including arrays (up to three dimensions), records, stacks, queues, trees, linked lists and hash tables.
More informationGCSE Computer Science for OCR Overview Scheme of Work
GCSE Computer Science for OCR Overview Scheme of Work The following assumes a two-year model. During the course, the final challenges can be used for practice in computational thinking, algorithm design
More informationProofs are Programs. Prof. Clarkson Fall Today s music: Two Sides to Every Story by Dyan Cannon and Willie Nelson
Proofs are Programs Prof. Clarkson Fall 2016 Today s music: Two Sides to Every Story by Dyan Cannon and Willie Nelson Review Currently in 3110: Advanced topics Futures Monads Today: An idea that goes by
More informationModule 6. Knowledge Representation and Logic (First Order Logic) Version 2 CSE IIT, Kharagpur
Module 6 Knowledge Representation and Logic (First Order Logic) Lesson 15 Inference in FOL - I 6.2.8 Resolution We have introduced the inference rule Modus Ponens. Now we introduce another inference rule
More informationCOMP Intro to Logic for Computer Scientists. Lecture 2
COMP 1002 Intro to Logic for Computer Scientists Lecture 2 B 5 2 J Language of logic: building blocks Proposition: A sentence that can be true or false. A: It is raining in St. John s right now. B: 2+2=7
More information