CS 173 Lecture 2: Propositional Logic
|
|
- Ernest Duane George
- 5 years ago
- Views:
Transcription
1 CS 173 Lecture 2: Propositional Logic José Meseguer University of Illinois at Urbana-Champaign 1 Propositional Formulas A proposition is a statement that is either true, T or false, F. A proposition usually combines simpler propositions by means of connectives such as AND (^), OR (_), exclusive-or, XOR ( ), NOT ( ), and IMPLIES (ñ). Aristotle ( BC) invented Formal Logic thanks to his insight that the truth value of any proposition only depends on the truth value of its most basic ones and on the form in which they are combined by various connectives, i.e., on its logical form, which is obtained by replacing the basic propositions by propositional variables. For example, the logical form of: is: (pigs fly AND smoke) IMPLIES (fire OR smoke) pp ^ Sq ñ pf _ Sq A proposition so abstracted is called a propositional formula, denoted ϕ, φ, ψ, ϕ 1..., ϕ n,..., which can be precisely defined as follows: Propositional variables, P, Q, X, Y, X 1,..., X n,... are (the most basic) propositional formulas. If ϕ, ϕ 1 are propositional formulas, then: ϕ, ϕ ^ ϕ 1, ϕ _ ϕ 1, ϕ ϕ 1, and ϕ ñ ϕ 1 are propositional formulas. Nothing else is a propositional formula. Using digital electronics we can implement ϕpx 1,..., X n q as a circuit viewing the X 1,..., X n as its input wires and producing then the output ϕpx 1,..., X n q in its output wire. The shape of the circuit ϕpx 1,..., X n q is exactly the logical form of ϕpx 1,..., X n q pictured as a tree, with each connective, ^, _,, and ñ implemented as a gate (or as a small circuit using other gates). This is the way microprocessors having millions of gates are built in hardware to implement a general-purpose computer as, e.g., an Intel chip. 2 Truth Tables and Evaluation of Propositional Formulas Given a propositional formula ϕpx 1,..., X n q and truth values b 1,..., b n, i.e., b i P tt, Fu for i 1,..., n, for its variables X 1,..., X n, then ϕpx 1,..., X n q will evaluate to exactly one truth value. This is Aristotle s insight about logical form.
2 2 J. Meseguer The truth value of ϕpx 1,..., X n q for any b 1,..., b n can be determined as follows: Variables. For variables X 1,..., X n and truth values b 1,..., b n, then X i evaluates to b i for i 1,..., n, Connectives are evaluated according to the following truth tables (similar to addition and multiplication tables for numbers): AND : X 1 X 2 X 1 ^ X 2 T F F F T F OR : X 1 X 2 X 1 _ X 2 T F T XOR : X 1 X 2 X 1 X 2 T T F T F T NOT : X X T F F T IMPLIES : X 1 X 2 X 1 ñ X 2 T F F F F T Complex Propositions. Evaluate as follows. If for truth values b 1,..., b n for the variables X 1,..., X n, ϕpx 1,..., X n q evaluates to b and ϕ 1 px 1,..., X n q evaluates to b 1, then: ϕ evaluates to b ϕ ^ ϕ 1 evaluates to b ^ b 1 ϕ _ ϕ 1 evaluates to b _ b 1 ϕ ϕ 1 evaluates to b b 1 ϕ ñ ϕ 1 evaluates to b ñ b 1
3 Propositional Logic 3 according to the above truth tables, where not all variables X 1,..., X n need to appear in both ϕ and ϕ 1. Truth Tables for Complex Propositions. We can build a truth table for any complex proposition by applying above s idea to incrementally build truth tables for its subexpressions. For example, we can define a new connective for if and only if IFF (ô), where, by definition, X 1 ô X 2 is the complex proposition X 1 ô X 2 def px 1 ñ X 2 q ^ px 2 ñ X 1 q as follows: X 1 X 2 X 1 ñ X 2 X 2 ñ X 1 X 1 ô X 2 T T T F F T F F F F T Note that the truth table for X 1 ô X 2 is exactly the identity predicate on truth values, that is, b ô b 1 T if b b 1, and b ô b 1 F if b b 1. Therefore, if for truth values b 1,..., b n, ϕpx 1,..., X n q evaluates to b and ϕpx 1,..., X n q evaluates to b 1, then ϕ ô ϕ 1 evaluates to b b 1. Viewed as an electronic circuit, X 1 ô X 2 is a circuit that can be used to check whether the circuits for ϕ and ϕ 1 produce the same output value for all inputs. This will happen exactly when ϕ ô ϕ 1 produces the value T for all inputs. We then say that ϕ and ϕ 1 are equivalent as formulas, and therefore as circuits, so that we can replace one by the other as equivalent components in a hardware design. This is further explained in what follows. 3 Tautologies, Falsities, and Equivalences Tautologies and Falsities. A formula ϕ is called a tautology if it is true for all inputs, that is, if for all truth values b 1,..., b n, ϕpx 1,..., X n q evaluates to T. Equivalently, ϕpx 1,..., X n q is a tautology if its truth table is true for all inputs. Tautologies are exactly the formulas that are logically true in all circumstances. A formula ϕ is called a falsity if it is false for all inputs, that is, if for all truth values b 1,..., b n, ϕpx 1,..., X n q evaluates to F. Equivalently, ϕpx 1,..., X n q is a falsity if its truth table is false for all inputs. Falsities are exactly the formulas that are logically false in all circumstances. Note the important facts that: ϕ is a tautology iff ϕ is a falsity, and ϕ is a falsity iff ϕ is a tautology. Equivalences. An equivalence is a tautology of the form ϕ ô ψ. But recall that the truth table of ô is the identity function. Therefore, ϕ ô ψ is a tautology if and only if for truth values b 1,..., b n of their input variables 1 X 1,..., X n ϕpx 1,..., X n q and ϕ 1 px 1,..., X n q evaluate to the same truth value b P tt, Fu. If ϕ ô ψ is a tautology then we write: ϕ ψ and call it an equivalence. 1 Some of those variables may not appear in either ϕ or ψ. The X 1,..., X n are the variables appearing in either ϕ or ψ (or both).
4 4 J. Meseguer If we view ϕ and ψ as digital circuits, then ϕ ψ exactly means that we can replace the circuit ϕ by the circuit ψ, or viceversa (perhaps inside any bigger circuit) without changing the behavior of the circuit. Also, if we view ô as a circuit, we can use it to check that ϕ and ψ are equivalent circuits by connecting the output wires of ϕ, and ψ into the inputs of ô and then checking that the output of the combined circuit ϕ ô ψ is T for all inputs. Tautologies and Falsities as Equivalences. We have three related notions: tautology, falsity, and equivalence as a special kind of tautology. Can we reduce these three notions to just one? Yes! Just to the notion of equivalence, as follows: ϕ is a tautology if and only if ϕ T ϕ is a falsity if and only if ϕ F The Algebra of Equivalences. Recall that the meaning of ô is just equality. Therefore, we should think of an equivalence ϕ ô ψ an algebraic law ϕ ψ that holds for Propositional Algebra (also called Boolean Algebra after its inventor George Boole in the 19 th Century), the same way the arithmetic laws hold for ordinary algebra. In fact, if we think of _ as `, ^ as, T as 1, and F as 0, we see that many laws (though not all) are the same. For example distributivity: X py ` Xq px Y q ` px Zq versus X ^ py _ Xq px ^ Y q _ px ^ Zq. Boolean Algebra Laws. The following are very useful equivalences in Boolean Algebra, which can be proved by checking that they are tautologies building their truth table (do it for a couple of them to convince yourself): 1. Commutativity of _ and ^: X _ Y Y _ X and X ^ Y Y ^ X. 2. Associativity of _ and ^: px _ Y q _ Z X _ py _ Zq and X ^ py ^ Zq X ^ py ^ Zq. 3. Identity Laws for _ and ^: X _ F X and X ^ T X. 4. Collapse Laws for _ and ^: X _ T T and X ^ F F. 5. Idempotency Laws for _ and ^: X _ X X and X ^ X X. 6. Distributivity of ^ over _: X ^ py _ Zq px ^ Y q _ px ^ Zq. 7. Distributivity of _ over ^: X _ py ^ Zq px _ Y q ^ px _ Zq. 8. Absorption Laws for _ and ^: X _ px ^ Y q X and X ^ px _ Y q X. 9. Double Negation: X X. 10. Principle of Contradiction: X ^ X F. 11. Law of Excluded Middle: X _ X T.
5 Propositional Logic De Morgan s Laws for _ and ^: px _ Y q p Xq ^ p Y q and px ^ Y q p Xq _ p Y q. Expressing All Connectives in Terms of _ and ^. We can express all other connectives in terms of _ and ^ by means of the following very useful equivalences, which can be checked by building the associated truth tables: X Y px _ Y q ^ px ^ Y q X ñ Y p Xq _ Y X ô Y pp Xq _ Y q ^ p py q _ Xq. Proving Equivalences vs. Building Truth Tables. How can we convince ourselves that a formula ϕ ô ψ is in fact an equivalence ϕ ψ? We have two ways: (1) We can settle the matter by checking that ϕ and ψ have the same truth table. But this is tedious for humans, although easy to write a program to check it, so that we can automatically decide whether any equivalence holds or not. 2 (2) Alternatively, an often easier way is to use the above equivalences (1) (12) as algebraic laws as we do in ordinary algebra by replacing equals for equals. In this way, it is often much easier to obtain new equivalences. In fact, the above laws (1) (12) are enough to prove all equivalences algebraically. Of course, as in ordinary algebra, we can also use equivalences that we have already proved as lemmas when proving other equivalences. Here is a simple example on deriving the so-called Law of Contrapositive, X ñ Y p Y q ñ p Xq, which we will use in writing proofs by contrapositive: X ñ Y p Xq _ Y p Xq _ p Y q p Y q _ p Xq p Y q ñ p Xq. where we have used Double Negation for the second step, and Commutativity of _ for the third, together with the equivalence X ñ Y p Xq _ Y (twice) as a lemma. 2 A naive program will be very inefficient, because the problem of checking equivalence is a so-called NP-Complete problem that has an exponential blowup on the size of the formula. This means that for formulas with many propositional variables the program will easily get bogged down and take forever. Even though NP-completeness is an intrinsic difficulty of the problem, much more efficient programs called SATsolvers that can often efficiently handle formulas with thousands of variables are now routinely used for this purpose in many applications (e.g., hardware design).
Lecture 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 informationBoolean algebra. Examples of these individual laws of Boolean, rules and theorems for Boolean algebra are given in the following table.
The Laws of Boolean Boolean algebra As well as the logic symbols 0 and 1 being used to represent a digital input or output, we can also use them as constants for a permanently Open or Closed circuit or
More informationCOS 140: Foundations of Computer Science
COS 140: Foundations of Computer Science Boolean Algebra Fall 2018 Introduction 3 Problem................................................................. 3 Boolean algebra...........................................................
More informationPart I: Propositional Calculus
Logic Part I: Propositional Calculus Statements Undefined Terms True, T, #t, 1 False, F, #f, 0 Statement, Proposition Statement/Proposition -- Informal Definition Statement = anything that can meaningfully
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 informationTruth-Functional Logic
Truth-Functional Logic Syntax Every atomic sentence (A, B, C, ) is a sentence and are sentences With ϕ a sentence, the negation ϕ is a sentence With ϕ and ψ sentences, the conjunction ϕ ψ is a sentence
More informationComputer Organization: Boolean Logic
Computer Organization: Boolean Logic Representing and Manipulating Data Last Unit How to represent data as a sequence of bits How to interpret bit representations Use of levels of abstraction in representing
More informationCompound Propositions
Discrete Structures Compound Propositions Producing new propositions from existing propositions. Logical Operators or Connectives 1. Not 2. And 3. Or 4. Exclusive or 5. Implication 6. Biconditional Truth
More informationCITS2211 Discrete Structures. Propositional Logic
CITS2211 Discrete Structures Propositional Logic Unit coordinator: Rachel Cardell-Oliver July 31, 2017 Highlights This lecture will address the following questions: 1 What is a proposition? 2 How are propositions
More informationTopic 1: Propositional logic
Topic 1: Propositional logic Guy McCusker 1 1 University of Bath Logic! This lecture is about the simplest kind of mathematical logic: propositional calculus. We discuss propositions, which are statements
More information2.2: Logical Equivalence: The Laws of Logic
Example (2.7) For primitive statement p and q, construct a truth table for each of the following compound statements. a) p q b) p q Here we see that the corresponding truth tables for two statement p q
More informationPropositional and Predicate Logic
Propositional and Predicate Logic CS 536-05: Science of Programming This is for Section 5 Only: See Prof. Ren for Sections 1 4 A. Why Reviewing/overviewing logic is necessary because we ll be using it
More informationCSE 311: Foundations of Computing. Lecture 3: Digital Circuits & Equivalence
CSE 311: Foundations of Computing Lecture 3: Digital Circuits & Equivalence Homework #1 You should have received An e-mail from [cse311a/cse311b] with information pointing you to look at Canvas to submit
More informationPropositional Logic: Equivalence
Propositional Logic: Equivalence Alice Gao Lecture 5 Based on work by J. Buss, L. Kari, A. Lubiw, B. Bonakdarpour, D. Maftuleac, C. Roberts, R. Trefler, and P. Van Beek 1/42 Outline Propositional Logic:
More informationFormal Verification Methods 1: Propositional Logic
Formal Verification Methods 1: Propositional Logic John Harrison Intel Corporation Course overview Propositional logic A resurgence of interest Logic and circuits Normal forms The Davis-Putnam procedure
More informationPropositional and Predicate Logic
8/24: pp. 2, 3, 5, solved Propositional and Predicate Logic CS 536: Science of Programming, Spring 2018 A. Why Reviewing/overviewing logic is necessary because we ll be using it in the course. We ll be
More informationPropositional Equivalence
Propositional Equivalence Tautologies and contradictions A compound proposition that is always true, regardless of the truth values of the individual propositions involved, is called a tautology. Example:
More informationCISC-102 Winter 2016 Lecture 17
CISC-102 Winter 2016 Lecture 17 Logic and Propositional Calculus Propositional logic was eventually refined using symbolic logic. The 17th/18th century philosopher Gottfried Leibniz (an inventor of calculus)
More informationDiscrete Structures & Algorithms. Propositional Logic EECE 320 // UBC
Discrete Structures & Algorithms Propositional Logic EECE 320 // UBC 1 Review of last lecture Pancake sorting A problem with many applications Bracketing (bounding a function) Proving bounds for pancake
More informationPropositional Logic. Spring Propositional Logic Spring / 32
Propositional Logic Spring 2016 Propositional Logic Spring 2016 1 / 32 Introduction Learning Outcomes for this Presentation Learning Outcomes... At the conclusion of this session, we will Define the elements
More informationHW1 graded review form? HW2 released CSE 20 DISCRETE MATH. Fall
CSE 20 HW1 graded review form? HW2 released DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Translate sentences from English to propositional logic using appropriate
More informationAnnouncements. CS311H: Discrete Mathematics. Propositional Logic II. Inverse of an Implication. Converse of a Implication
Announcements CS311H: Discrete Mathematics Propositional Logic II Instructor: Işıl Dillig First homework assignment out today! Due in one week, i.e., before lecture next Wed 09/13 Remember: Due before
More informationReview. Propositional Logic. Propositions atomic and compound. Operators: negation, and, or, xor, implies, biconditional.
Review Propositional Logic Propositions atomic and compound Operators: negation, and, or, xor, implies, biconditional Truth tables A closer look at implies Translating from/ to English Converse, inverse,
More informationTools for reasoning: Logic. Ch. 1: Introduction to Propositional Logic Truth values, truth tables Boolean logic: Implications:
Tools for reasoning: Logic Ch. 1: Introduction to Propositional Logic Truth values, truth tables Boolean logic: Implications: 1 Why study propositional logic? A formal mathematical language for precise
More informationConjunction: p q is true if both p, q are true, and false if at least one of p, q is false. The truth table for conjunction is as follows.
Chapter 1 Logic 1.1 Introduction and Definitions Definitions. A sentence (statement, proposition) is an utterance (that is, a string of characters) which is either true (T) or false (F). A predicate is
More informationUnit 8A Computer Organization. Boolean Logic and Gates
Unit 8A Computer Organization Boolean Logic and Gates Announcements Bring ear buds or headphones to lab! 15110 Principles of Computing, Carnegie Mellon University - CORTINA 2 Representing and Manipulating
More informationTHE LOGIC OF COMPOUND STATEMENTS
THE LOGIC OF COMPOUND STATEMENTS All dogs have four legs. All tables have four legs. Therefore, all dogs are tables LOGIC Logic is a science of the necessary laws of thought, without which no employment
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 informationCSE 311: Foundations of Computing. Lecture 2: More Logic, Equivalence & Digital Circuits
CSE 311: Foundations of Computing Lecture 2: More Logic, Equivalence & Digital Circuits Last class: Some Connectives & Truth Tables Negation (not) p p T F F T Disjunction (or) p q p q T T T T F T F T T
More informationA Primer on Boole s Algebra of Logic for Classes
Outline The Paradigm Early Insights Boole s Algebra of Classes (Quick Overview) Defining Multiplication Numbers as Classes Schröder s Translations Two Cautions Boole s Equational System Def A B Def A B
More informationLogic Propositional logic; First order/predicate logic
Logic Propositional logic; First order/predicate logic School of Athens Fresco by Raphael Wikimedia Commons Discrete Structures (CS 173) Madhusudan Parthasarathy, University of Illinois Mathematical logic
More informationCOSC 243. Introduction to Logic And Combinatorial Logic. Lecture 4 - Introduction to Logic and Combinatorial Logic. COSC 243 (Computer Architecture)
COSC 243 Introduction to Logic And Combinatorial Logic 1 Overview This Lecture Introduction to Digital Logic Gates Boolean algebra Combinatorial Logic Source: Chapter 11 (10 th edition) Source: J.R. Gregg,
More informationDigital Logic (2) Boolean Algebra
Digital Logic (2) Boolean Algebra Boolean algebra is the mathematics of digital systems. It was developed in 1850 s by George Boole. We will use Boolean algebra to minimize logic expressions. Karnaugh
More informationDiscrete Mathematics and Applications COT3100
Discrete Mathematics and Applications CO3100 Dr. Ungor Sources: Slides are based on Dr. G. Bebis material. uesday, January 7, 2014 oundations of Logic: Overview Propositional logic: (Sections 1.1-1.3)
More informationPropositional logic ( ): Review from Mat 1348
CSI 2101 / Winter 2008: Discrete Structures. Propositional logic ( 1.1-1.2): Review from Mat 1348 Dr. Nejib Zaguia - Winter 2008 1 Propositional logic: Review Mathematical Logic is a tool for working with
More informationExample. Logic. Logical Statements. Outline of logic topics. Logical Connectives. Logical Connectives
Logic Logic is study of abstract reasoning, specifically, concerned with whether reasoning is correct. Logic focuses on relationship among statements as opposed to the content of any particular statement.
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 informationUC Berkeley College of Engineering, EECS Department CS61C: Representations of Combinational Logic Circuits
2 Wawrzynek, Garcia 2004 c UCB UC Berkeley College of Engineering, EECS Department CS61C: Representations of Combinational Logic Circuits 1 Introduction Original document by J. Wawrzynek (2003-11-15) Revised
More informationXOR - XNOR Gates. The graphic symbol and truth table of XOR gate is shown in the figure.
XOR - XNOR Gates Lesson Objectives: In addition to AND, OR, NOT, NAND and NOR gates, exclusive-or (XOR) and exclusive-nor (XNOR) gates are also used in the design of digital circuits. These have special
More informationPropositional Logic. Fall () Propositional Logic Fall / 30
Propositional Logic Fall 2013 () Propositional Logic Fall 2013 1 / 30 1 Introduction Learning Outcomes for this Presentation 2 Definitions Statements Logical connectives Interpretations, contexts,... Logically
More informationBOOLEAN ALGEBRA INTRODUCTION SUBSETS
BOOLEAN ALGEBRA M. Ragheb 1/294/2018 INTRODUCTION Modern algebra is centered around the concept of an algebraic system: A, consisting of a set of elements: ai, i=1, 2,, which are combined by a set of operations
More informationEECS 1028 M: Discrete Mathematics for Engineers
EECS 1028 M: Discrete Mathematics for Engineers Suprakash Datta Office: LAS 3043 Course page: http://www.eecs.yorku.ca/course/1028 Also on Moodle S. Datta (York Univ.) EECS 1028 W 18 1 / 12 Using the laws
More informationICS141: Discrete Mathematics for Computer Science I
ICS141: Discrete Mathematics for Computer Science I Dept. Information & Computer Sci., Originals slides by Dr. Baek and Dr. Still, adapted by J. Stelovsky Based on slides Dr. M. P. Frank and Dr. J.L. Gross
More informationUC Berkeley CS 170: Efficient Algorithms and Intractable Problems Handout 22 Lecturer: David Wagner April 24, Notes 22 for CS 170
UC Berkeley CS 170: Efficient Algorithms and Intractable Problems Handout 22 Lecturer: David Wagner April 24, 2003 Notes 22 for CS 170 1 NP-completeness of Circuit-SAT We will prove that the circuit satisfiability
More informationEECS 1028 M: Discrete Mathematics for Engineers
EECS 1028 M: Discrete Mathematics for Engineers Suprakash Datta Office: LAS 3043 Course page: http://www.eecs.yorku.ca/course/1028 Also on Moodle S. Datta (York Univ.) EECS 1028 W 18 1 / 26 Why Study Logic?
More informationCSE 20 Discrete Math. Algebraic Rules for Propositional Formulas. Summer, July 11 (Day 2) Number Systems/Computer Arithmetic Predicate Logic
CSE 20 Discrete Math Algebraic Rules for Propositional Formulas Equivalences between propositional formulas (similar to algebraic equivalences): Associative Summer, 2006 July 11 (Day 2) Number Systems/Computer
More information1 Propositional Logic
1 Propositional Logic Required reading: Foundations of Computation. Sections 1.1 and 1.2. 1. Introduction to Logic a. Logical consequences. If you know all humans are mortal, and you know that you are
More informationAnnouncements. CS243: Discrete Structures. Propositional Logic II. Review. Operator Precedence. Operator Precedence, cont. Operator Precedence Example
Announcements CS243: Discrete Structures Propositional Logic II Işıl Dillig First homework assignment out today! Due in one week, i.e., before lecture next Tuesday 09/11 Weilin s Tuesday office hours are
More information1.3 Propositional Equivalences
1 1.3 Propositional Equivalences The replacement of a statement with another statement with the same truth is an important step often used in Mathematical arguments. Due to this methods that produce propositions
More informationCHAPTER 10. Gentzen Style Proof Systems for Classical Logic
CHAPTER 10 Gentzen Style Proof Systems for Classical Logic Hilbert style systems are easy to define and admit a simple proof of the Completeness Theorem but they are difficult to use. By humans, not mentioning
More informationChapter 2: Switching Algebra and Logic Circuits
Chapter 2: Switching Algebra and Logic Circuits Formal Foundation of Digital Design In 1854 George Boole published An investigation into the Laws of Thoughts Algebraic system with two values 0 and 1 Used
More informationUnit 4: Computer as a logic machine
Unit 4: Computer as a logic machine Propositional logic Boolean algebra Logic gates Computer as a logic machine: symbol processor Development of computer The credo of early AI Reference copyright c 2013
More informationLogic As Algebra COMP1600 / COMP6260. Dirk Pattinson Australian National University. Semester 2, 2017
Logic As Algebra COMP1600 / COMP6260 Dirk Pattinson Australian National University Semester 2, 2017 Recap: And, Or, and Not x AND y x y x y 0 0 0 0 1 0 1 0 0 1 1 1 x OR y x y x y 0 0 0 0 1 1 1 0 1 1 1
More informationSolutions to Homework I (1.1)
Solutions to Homework I (1.1) Problem 1 Determine whether each of these compound propositions is satisable. a) (p q) ( p q) ( p q) b) (p q) (p q) ( p q) ( p q) c) (p q) ( p q) (a) p q p q p q p q p q (p
More informationCSCI3390-Lecture 18: Why is the P =?NP Problem Such a Big Deal?
CSCI3390-Lecture 18: Why is the P =?NP Problem Such a Big Deal? The conjecture that P is different from NP made its way on to several lists of the most important unsolved problems in Mathematics (never
More informationPropositional Logic: Methods of Proof (Part II)
Propositional Logic: Methods of Proof (Part II) You will be expected to know Basic definitions Inference, derive, sound, complete Conjunctive Normal Form (CNF) Convert a Boolean formula to CNF Do a short
More information2. The Logic of Compound Statements Summary. Aaron Tan August 2017
2. The Logic of Compound Statements Summary Aaron Tan 21 25 August 2017 1 2. The Logic of Compound Statements 2.1 Logical Form and Logical Equivalence Statements; Compound Statements; Statement Form (Propositional
More informationPropositional Calculus: Formula Simplification, Essential Laws, Normal Forms
P Formula Simplification, Essential Laws, Normal Forms Lila Kari University of Waterloo P Formula Simplification, Essential Laws, Normal CS245, Forms Logic and Computation 1 / 26 Propositional calculus
More informationBuilding a Computer Adder
Logic Gates are used to translate Boolean logic into circuits. In the abstract it is clear that we can build AND gates that perform the AND function and OR gates that perform the OR function and so on.
More informationLogic, Sets, and Proofs
Logic, Sets, and Proofs David A. Cox and Catherine C. McGeoch Amherst College 1 Logic Logical Operators. A logical statement is a mathematical statement that can be assigned a value either true or false.
More informationBoolean algebra. Values
Boolean algebra 1854 by George Boole in his book An Investigation of the Laws of Thought, is a variant of ordinary elementary algebra differing in its values, operations, and laws. Instead of the usual
More informationPacket #1: Logic & Proofs. Applied Discrete Mathematics
Packet #1: Logic & Proofs Applied Discrete Mathematics Table of Contents Course Objectives Page 2 Propositional Calculus Information Pages 3-13 Course Objectives At the conclusion of this course, you should
More informationImplementation of Boolean Logic by Digital Circuits
Implementation of Boolean Logic by Digital Circuits We now consider the use of electronic circuits to implement Boolean functions and arithmetic functions that can be derived from these Boolean functions.
More informationCOMP 182 Algorithmic Thinking. Proofs. Luay Nakhleh Computer Science Rice University
COMP 182 Algorithmic Thinking Proofs Luay Nakhleh Computer Science Rice University 1 Reading Material Chapter 1, Section 3, 6, 7, 8 Propositional Equivalences The compound propositions p and q are called
More informationMODULE- 07 : FLUIDICS AND FLUID LOGIC
MODULE- 07 : FLUIDICS AND FLUID LOGIC LECTURE- 26 : INTRODUCTION TO FLUID LOGIC INTRODUCTION Fluidics (also known as Fluidic logic) is the use of a fluid or compressible medium to perform analog or digital
More informationDepartment of Computer Science & Software Engineering Comp232 Mathematics for Computer Science
Department of Computer Science & Software Engineering Comp232 Mathematics for Computer Science Fall 2018 Assignment 1. Solutions 1. For each of the following statements use a truth table to determine whether
More informationChapter 1, Part I: Propositional Logic. With Question/Answer Animations
Chapter 1, Part I: Propositional Logic With Question/Answer Animations Chapter Summary Propositional Logic The Language of Propositions Applications Logical Equivalences Predicate Logic The Language of
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 informationSection 1.2 Propositional Equivalences. A tautology is a proposition which is always true. A contradiction is a proposition which is always false.
Section 1.2 Propositional Equivalences A tautology is a proposition which is always true. Classic Example: P P A contradiction is a proposition which is always false. Classic Example: P P A contingency
More informationCS61c: Representations of Combinational Logic Circuits
CS61c: Representations of Combinational Logic Circuits J. Wawrzynek March 5, 2003 1 Introduction Recall that synchronous systems are composed of two basic types of circuits, combination logic circuits,
More informationCS1021. Why logic? Logic about inference or argument. Start from assumptions or axioms. Make deductions according to rules of reasoning.
3: Logic Why logic? Logic about inference or argument Start from assumptions or axioms Make deductions according to rules of reasoning Logic 3-1 Why logic? (continued) If I don t buy a lottery ticket on
More information1 Propositional Logic
CS 2800, Logic and Computation Propositional Logic Lectures Pete Manolios Version: 384 Spring 2011 1 Propositional Logic The study of logic was initiated by the ancient Greeks, who were concerned with
More informationAdequate set of connectives, logic gates and circuits
Adequate set of connectives, logic gates and circuits Lila Kari University of Waterloo Adequate set of connectives, logic gates and circuits CS245, Logic and Computation 1 / 59 Connectives We have mentioned
More informationDiscrete Mathematics and Its Applications
Discrete Mathematics and Its Applications Lecture 1: Proposition logic MING GAO DASE @ ECNU (for course related communications) mgao@dase.ecnu.edu.cn Sep. 12, 2017 Outline 1 Propositions 2 Connectives
More informationSample Problems for all sections of CMSC250, Midterm 1 Fall 2014
Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014 1. Translate each of the following English sentences into formal statements using the logical operators (,,,,, and ). You may also use mathematical
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 informationCprE 281: Digital Logic
CprE 281: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Boolean Algebra CprE 281: Digital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev
More informationCS70 is a course about on Discrete Mathematics for Computer Scientists. The purpose of the course is to teach you about:
CS 70 Discrete Mathematics for CS Fall 2006 Papadimitriou & Vazirani Lecture 1 Course Outline CS70 is a course about on Discrete Mathematics for Computer Scientists. The purpose of the course is to teach
More informationSwitches: basic element of physical implementations
Combinational logic Switches Basic logic and truth tables Logic functions Boolean algebra Proofs by re-writing and by perfect induction Winter 200 CSE370 - II - Boolean Algebra Switches: basic element
More informationPropositional Logic: Semantics
Propositional Logic: Semantics Alice Gao Lecture 4, September 19, 2017 Semantics 1/56 Announcements Semantics 2/56 The roadmap of propositional logic Semantics 3/56 FCC spectrum auction an application
More informationDefinition 2. Conjunction of p and q
Proposition Propositional Logic CPSC 2070 Discrete Structures Rosen (6 th Ed.) 1.1, 1.2 A proposition is a statement that is either true or false, but not both. Clemson will defeat Georgia in football
More informationMathematical Logic Part One
Mathematical Logic Part One Question: How do we formalize the definitions and reasoning we use in our proofs? Where We're Going Propositional Logic (oday) Basic logical connectives. ruth tables. Logical
More informationSet Theory Basics of Set Theory. mjarrar Watch this lecture and download the slides
9/6/17 Birzeit University Palestine 2015 6.1. Basics of 6.2 Properties of Sets and Element Argument 6.3 Algebraic Proofs mjarrar 2015 1 Watch this lecture and download the slides Course Page: http://www.jarrar.info/courses/dmath/
More informationCS 226: Digital Logic Design
CS 226: Digital Logic Design 0 1 1 I S 0 1 0 S Department of Computer Science and Engineering, Indian Institute of Technology Bombay. 1 of 29 Objectives In this lecture we will introduce: 1. Logic functions
More informationCISC-102 Fall 2018 Week 11
page! 1 of! 26 CISC-102 Fall 2018 Pascal s Triangle ( ) ( ) An easy ( ) ( way ) to calculate ( ) a table of binomial coefficients was recognized centuries ago by mathematicians in India, ) ( ) China, Iran
More informationProposition/Statement. Boolean Logic. Boolean variables. Logical operators: And. Logical operators: Not 9/3/13. Introduction to Logical Operators
Proposition/Statement Boolean Logic CS 231 Dianna Xu A proposition is either true or false but not both he sky is blue Lisa is a Math major x == y Not propositions: Are you Bob? x := 7 1 2 Boolean variables
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 informationChapter 4, Logic using Propositional Calculus Handout
ECS 20 Chapter 4, Logic using Propositional Calculus Handout 0. Introduction to Discrete Mathematics. 0.1. Discrete = Individually separate and distinct as opposed to continuous and capable of infinitesimal
More informationMore Propositional Logic Algebra: Expressive Completeness and Completeness of Equivalences. Computability and Logic
More Propositional Logic Algebra: Expressive Completeness and Completeness of Equivalences Computability and Logic Equivalences Involving Conditionals Some Important Equivalences Involving Conditionals
More informationChapter 2. Reductions and NP. 2.1 Reductions Continued The Satisfiability Problem (SAT) SAT 3SAT. CS 573: Algorithms, Fall 2013 August 29, 2013
Chapter 2 Reductions and NP CS 573: Algorithms, Fall 2013 August 29, 2013 2.1 Reductions Continued 2.1.1 The Satisfiability Problem SAT 2.1.1.1 Propositional Formulas Definition 2.1.1. Consider a set of
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 informationTecniche di Verifica. Introduction to Propositional Logic
Tecniche di Verifica Introduction to Propositional Logic 1 Logic A formal logic is defined by its syntax and semantics. Syntax An alphabet is a set of symbols. A finite sequence of these symbols is called
More informationMathematical Logic Part Three
Mathematical Logic Part hree riday our Square! oday at 4:15PM, Outside Gates Announcements Problem Set 3 due right now. Problem Set 4 goes out today. Checkpoint due Monday, October 22. Remainder due riday,
More informationCHAPTER 1. MATHEMATICAL LOGIC 1.1 Fundamentals of Mathematical Logic
CHAPER 1 MAHEMAICAL LOGIC 1.1 undamentals of Mathematical Logic Logic is commonly known as the science of reasoning. Some of the reasons to study logic are the following: At the hardware level the design
More informationLogic: Propositional Logic (Part I)
Logic: Propositional Logic (Part I) Alessandro Artale Free University of Bozen-Bolzano Faculty of Computer Science http://www.inf.unibz.it/ artale Descrete Mathematics and Logic BSc course Thanks to Prof.
More informationFor all For every For each For any There exists at least one There exists There is Some
Section 1.3 Predicates and Quantifiers Assume universe of discourse is all the people who are participating in this course. Also let us assume that we know each person in the course. Consider the following
More information1.1 Statements and Compound Statements
Chapter 1 Propositional Logic 1.1 Statements and Compound Statements A statement or proposition is an assertion which is either true or false, though you may not know which. That is, a statement is something
More informationEECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits)
EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) September 5, 2002 John Wawrzynek Fall 2002 EECS150 Lec4-bool1 Page 1, 9/5 9am Outline Review of
More informationDescription Logics. Foundations of Propositional Logic. franconi. Enrico Franconi
(1/27) Description Logics Foundations of Propositional Logic Enrico Franconi franconi@cs.man.ac.uk http://www.cs.man.ac.uk/ franconi Department of Computer Science, University of Manchester (2/27) Knowledge
More informationDiscrete Mathematics and Probability Theory Fall 2012 Vazirani Note 1
CS 70 Discrete Mathematics and Probability Theory Fall 2012 Vazirani Note 1 Course Outline CS70 is a course on "Discrete Mathematics and Probability for Computer Scientists." The purpose of the course
More information