What is Logic? Logic is the study of valid reasoning. Philosophy. Mathematics. Computer science
|
|
|
- Rosalyn Brenda Evans
- 7 years ago
- Views:
Transcription
1 What is Logic? Definition Logic is the study of valid reasoning. Philosophy Mathematics Computer science Definition Mathematical Logic is the mathematical study of the methods, structure, and validity of mathematical deduction and proof. [Wolfram Mathworld]
2 Propositions Definition A proposition is a declaritive sentence that is either true or false. Today is Tuesday. Today is Wednesday = > 18 The sky is blue. Why is the sky blue? Barack Obama. Two students in the class have a GPA of The current king of France is bald.
3 Conjunction Definition The conjunction of two propostions, p and q, is the proposition p and q. It is true when both p and q are true. Example s: The sky is blue. g: The grass is green. m: The moon is made of cheese. s g: The sky is blue and the grass is green. s m: The sky is blue and the moon is made of cheese.
4 Disjunction Definition The disjunction of two propostions, p and q, is the proposition p or q. It is true when either p or q is true. Example s: The sky is blue. g: The grass is red. m: The moon is made of cheese. s g: The sky is blue or the grass is red. g m: The grass is red or the moon is made of cheese.
5 Truth tables... The meaning of a logical operation can be expressed as its truth table. Construct the truth-table for conjunction. Construct the truth-table for disjunction. Construct the truth-table for negation. Do in class.
6 A worked example Example Let s be The sun is shining and t be It is raining. Join these into the compound statement: ( s t) t. Phrase the compound statement in English. Construct the truth table. Do in class.
7 Exclusive or The word or is often used to mean one or the other, but this is not the same meaning of or in logic! Definition The exclusive-or of two statements p and q (written p q), is true when either p is true or q is true, but not both. p q p q T T F T F T F T T F F F
8 Logical equivalences How do we know if two logical statements are equivalent?
9 Logical equivalences How do we know if two logical statements are equivalent? Construct truth tables for each. Check if final columns match.
10 Logical equivalences How do we know if two logical statements are equivalent? Construct truth tables for each. Check if final columns match. Theorem Let p and q be statement variables. Then (p q) (p q) p q and (p q) (q p) p q. Prove in class (using Truth Tables).
11 Conditional Statements Hypothesis Conclusion Example If it is raining, I will carry my umbrella. If you don t eat your dinner, you will not get dessert. p q p q T T T T F F F T T F F T
12 Expressing Conditionals Conditional can be expressed in many ways: if p then q p implies q q if p p only if q a sufficient condition for q is p a necessary condition for p is q
13 More on Conditional In logic the hypothesis and conclusion need not relate to each other. Example If Joe likes cats, then the sky is blue. If Joe likes cats, then the moon is made of cheese. In programming languages if-then is a command. Example If it rains today, then buy an umbrella. If x > y then z := x + y
14
15 Four important variations of implication Contrapositive Converse Inverse Negation
16 Contrapositive Definition The contrapositive of a conditional statement is obtained by transposing its conclusion with its premise and inverting. So, Contrapositive of p q is q p. Example Original statement: If I live in College Park, then I live in Maryland. Contrapositive: If I don t live in Maryland, then I don t live in College Park. Theorem The contrapositive of an implication is equivalent to the original statement. Prove in class.
17 Converse Definition The converse of a conditional statement is obtained by transposing its conclusion with its premise. Converse of p q is q p. Example Original statement: If I live in College Park, then I live in Maryland. Converse: If I live in Maryland, then I live in College Park.
18 Inverse Definition The inverse of a conditional statement is obtained by negating both its premise and its conclusion. Inverse of p q is ( p) ( q). (Parentheses added for emphasis.) Example Original statement: If I live in College Park, then I live in Maryland. Inverse: If I don t live in College Park, then I don t live in Maryland. The inverse of an implication is equivalent to the converse! Why?
19 Negation Definition The negation of a conditional statement is obtained by negating it. Negation of p q is (p q) (which is equivalent to p q). Example Original statement: If I live in College Park, then I live in Maryland. Negation: I live in College Park, and I don t live in Maryland. The negation of a conditional statement is not a conditional statement!
20 Biconditional Statements Example I will carry my umbrella, if and only if it is raining. You will get dessert, if and only if you eat your dinner. p q p q T T T T F F F T F F F T
21 Expressing Biconditionals Biconditional can be expressed in many ways: p iff q p is necessary and sufficient for q p is a necessary and sufficient condition for q
22 Experimenting with biconditionals Questions: What do the converse, inverse, and negations of a bi-conditional look like? What is the relationship between the exclusive-or (discussed above) and the bi-conditional?
23 Laws of Propositional Logic... We can do algebra in propositional logic. Commutative Laws: p q q p p q q p Associative Laws: (p q) r p (q r) (p q) r p (q r) Distributive Laws: p (q r) (p q) (p r) p (q r) (p q) (p r)
24 Laws of Propositional Logic... We can do algebra in propositional logic. Commutative Laws: p q q p p q q p Associative Laws: (p q) r p (q r) (p q) r p (q r) Distributive Laws: p (q r) (p q) (p r) p (q r) (p q) (p r) How do we know that these laws are valid?
25 Laws of Propositional Logic... We can do algebra in propositional logic. Commutative Laws: p q q p p q q p Associative Laws: (p q) r p (q r) (p q) r p (q r) Distributive Laws: p (q r) (p q) (p r) p (q r) (p q) (p r) How do we know that these laws are valid? Construct the truth-tables and verify!
26 Laws of Propositional Logic... We can do algebra in propositional logic. Commutative Laws: p q q p p q q p Associative Laws: (p q) r p (q r) (p q) r p (q r) Distributive Laws: p (q r) (p q) (p r) p (q r) (p q) (p r) How do we know that these laws are valid? Construct the truth-tables and verify! Prove a Distributive Law in class.
27 De Morgan s laws... Theorem (De Morgan s laws) Let p and q be statement variables. Then (p q) p q and (p q) p q. Examples in English Example It is not the case that Alice or Bob went to the store. Alice did not go to the store and Bob did not go to the store. It is not the case that Alice and Bob went to the store. Alice did not go to the store or Bob did not go to the store. Prove in class (using Truth Tables).
28 Laws of Logic Given any statement variables p, q, and r, a tautology t and a contradiction c, the following logical equivalences hold: 1. Commutative laws: p q q p p q q p 2. Associative laws: (p q) r p (q r) (p q) r p (q r) 3. Distributive laws: p (q r) (p q) (p r) p (q r) (p q) (p r) 4. Identity laws: p t p p c p 5. Negation laws: p p t p p c 6. Double Negative law: ( p) p 7. Idempotent laws: p p p p p p 8. DeMorgan s laws: (p q) p q (p q) p q 9. Universal bounds laws: p t t p c c 10. Absorption laws: p (p q) p p (p q) p 11. Negations of t and c: t c c t
29 Example of Boolean Algebra ( p q) (p q) p Prove in class (using Boolean algebra).
30 Logic and Bit Operations Do in class.
Handout #1: Mathematical Reasoning
Math 101 Rumbos Spring 2010 1 Handout #1: Mathematical Reasoning 1 Propositional Logic A proposition is a mathematical statement that it is either true or false; that is, a statement whose certainty or
CHAPTER 2. Logic. 1. Logic Definitions. Notation: Variables are used to represent propositions. The most common variables used are p, q, and r.
CHAPTER 2 Logic 1. Logic Definitions 1.1. Propositions. Definition 1.1.1. A proposition is a declarative sentence that is either true (denoted either T or 1) or false (denoted either F or 0). Notation:
CSL105: Discrete Mathematical Structures. Ragesh Jaiswal, CSE, IIT Delhi
Propositional Logic: logical operators Negation ( ) Conjunction ( ) Disjunction ( ). Exclusive or ( ) Conditional statement ( ) Bi-conditional statement ( ): Let p and q be propositions. The biconditional
Propositional Logic. A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not both.
irst Order Logic Propositional Logic A proposition is a declarative sentence (a sentence that declares a fact) that is either true or false, but not both. Are the following sentences propositions? oronto
p: I am elected q: I will lower the taxes
Implication Conditional Statement p q (p implies q) (if p then q) is the proposition that is false when p is true and q is false and true otherwise. Equivalent to not p or q Ex. If I am elected then I
Logic in general. Inference rules and theorem proving
Logical Agents Knowledge-based agents Logic in general Propositional logic Inference rules and theorem proving First order logic Knowledge-based agents Inference engine Knowledge base Domain-independent
Lecture Notes in Discrete Mathematics. Marcel B. Finan Arkansas Tech University c All Rights Reserved
Lecture Notes in Discrete Mathematics Marcel B. Finan Arkansas Tech University c All Rights Reserved 2 Preface This book is designed for a one semester course in discrete mathematics for sophomore or junior
def: An axiom is a statement that is assumed to be true, or in the case of a mathematical system, is used to specify the system.
Section 1.5 Methods of Proof 1.5.1 1.5 METHODS OF PROOF Some forms of argument ( valid ) never lead from correct statements to an incorrect. Some other forms of argument ( fallacies ) can lead from true
CHAPTER 3. Methods of Proofs. 1. Logical Arguments and Formal Proofs
CHAPTER 3 Methods of Proofs 1. Logical Arguments and Formal Proofs 1.1. Basic Terminology. An axiom is a statement that is given to be true. A rule of inference is a logical rule that is used to deduce
Logic Appendix. Section 1 Truth Tables CONJUNCTION EXAMPLE 1
Logic Appendix T F F T Section 1 Truth Tables Recall that a statement is a group of words or symbols that can be classified collectively as true or false. The claim 5 7 12 is a true statement, whereas
Likewise, we have contradictions: formulas that can only be false, e.g. (p p).
CHAPTER 4. STATEMENT LOGIC 59 The rightmost column of this truth table contains instances of T and instances of F. Notice that there are no degrees of contingency. If both values are possible, the formula
Boolean Algebra Part 1
Boolean Algebra Part 1 Page 1 Boolean Algebra Objectives Understand Basic Boolean Algebra Relate Boolean Algebra to Logic Networks Prove Laws using Truth Tables Understand and Use First Basic Theorems
Math 3000 Section 003 Intro to Abstract Math Homework 2
Math 3000 Section 003 Intro to Abstract Math Homework 2 Department of Mathematical and Statistical Sciences University of Colorado Denver, Spring 2012 Solutions (February 13, 2012) Please note that these
Predicate logic Proofs Artificial intelligence. Predicate logic. SET07106 Mathematics for Software Engineering
Predicate logic SET07106 Mathematics for Software Engineering School of Computing Edinburgh Napier University Module Leader: Uta Priss 2010 Copyright Edinburgh Napier University Predicate logic Slide 1/24
DISCRETE MATH: LECTURE 3
DISCRETE MATH: LECTURE 3 DR. DANIEL FREEMAN 1. Chapter 2.2 Conditional Statements If p and q are statement variables, the conditional of q by p is If p then q or p implies q and is denoted p q. It is false
Beyond Propositional Logic Lukasiewicz s System
Beyond Propositional Logic Lukasiewicz s System Consider the following set of truth tables: 1 0 0 1 # # 1 0 # 1 1 0 # 0 0 0 0 # # 0 # 1 0 # 1 1 1 1 0 1 0 # # 1 # # 1 0 # 1 1 0 # 0 1 1 1 # 1 # 1 Brandon
Vocabulary. Term Page Definition Clarifying Example. biconditional statement. conclusion. conditional statement. conjecture.
CHAPTER Vocabulary The table contains important vocabulary terms from Chapter. As you work through the chapter, fill in the page number, definition, and a clarifying example. biconditional statement conclusion
Mathematical Induction
Mathematical Induction In logic, we often want to prove that every member of an infinite set has some feature. E.g., we would like to show: N 1 : is a number 1 : has the feature Φ ( x)(n 1 x! 1 x) How
Resolution. Informatics 1 School of Informatics, University of Edinburgh
Resolution In this lecture you will see how to convert the natural proof system of previous lectures into one with fewer operators and only one proof rule. You will see how this proof system can be used
INTRODUCTORY SET THEORY
M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H-1088 Budapest, Múzeum krt. 6-8. CONTENTS 1. SETS Set, equal sets, subset,
3. Logical Reasoning in Mathematics
3. Logical Reasoning in Mathematics Many state standards emphasize the importance of reasoning. We agree disciplined mathematical reasoning is crucial to understanding and to properly using mathematics.
Basic Proof Techniques
Basic Proof Techniques David Ferry dsf43@truman.edu September 13, 010 1 Four Fundamental Proof Techniques When one wishes to prove the statement P Q there are four fundamental approaches. This document
Introduction to Logic: Argumentation and Interpretation. Vysoká škola mezinárodních a veřejných vztahů PhDr. Peter Jan Kosmály, Ph.D. 9. 3.
Introduction to Logic: Argumentation and Interpretation Vysoká škola mezinárodních a veřejných vztahů PhDr. Peter Jan Kosmály, Ph.D. 9. 3. 2016 tests. Introduction to Logic: Argumentation and Interpretation
Chapter 3. Cartesian Products and Relations. 3.1 Cartesian Products
Chapter 3 Cartesian Products and Relations The material in this chapter is the first real encounter with abstraction. Relations are very general thing they are a special type of subset. After introducing
WRITING PROOFS. Christopher Heil Georgia Institute of Technology
WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this
1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1.
File: chap04, Chapter 04 1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1. 2. True or False? A gate is a device that accepts a single input signal and produces one
3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
Introduction to formal semantics -
Introduction to formal semantics - Introduction to formal semantics 1 / 25 structure Motivation - Philosophy paradox antinomy division in object und Meta language Semiotics syntax semantics Pragmatics
A Few Basics of Probability
A Few Basics of Probability Philosophy 57 Spring, 2004 1 Introduction This handout distinguishes between inductive and deductive logic, and then introduces probability, a concept essential to the study
One natural response would be to cite evidence of past mornings, and give something like the following argument:
Hume on induction Suppose you were asked to give your reasons for believing that the sun will come up tomorrow, in the form of an argument for the claim that the sun will come up tomorrow. One natural
Switching Algebra and Logic Gates
Chapter 2 Switching Algebra and Logic Gates The word algebra in the title of this chapter should alert you that more mathematics is coming. No doubt, some of you are itching to get on with digital design
CHAPTER 7 GENERAL PROOF SYSTEMS
CHAPTER 7 GENERAL PROOF SYSTEMS 1 Introduction Proof systems are built to prove statements. They can be thought as an inference machine with special statements, called provable statements, or sometimes
Logic in Computer Science: Logic Gates
Logic in Computer Science: Logic Gates Lila Kari The University of Western Ontario Logic in Computer Science: Logic Gates CS2209, Applied Logic for Computer Science 1 / 49 Logic and bit operations Computers
CS510 Software Engineering
CS510 Software Engineering Propositional Logic Asst. Prof. Mathias Payer Department of Computer Science Purdue University TA: Scott A. Carr Slides inspired by Xiangyu Zhang http://nebelwelt.net/teaching/15-cs510-se
Mathematics Review for MS Finance Students
Mathematics Review for MS Finance Students Anthony M. Marino Department of Finance and Business Economics Marshall School of Business Lecture 1: Introductory Material Sets The Real Number System Functions,
Degrees of Truth: the formal logic of classical and quantum probabilities as well as fuzzy sets.
Degrees of Truth: the formal logic of classical and quantum probabilities as well as fuzzy sets. Logic is the study of reasoning. A language of propositions is fundamental to this study as well as true
Correspondence analysis for strong three-valued logic
Correspondence analysis for strong three-valued logic A. Tamminga abstract. I apply Kooi and Tamminga s (2012) idea of correspondence analysis for many-valued logics to strong three-valued logic (K 3 ).
Properties of Real Numbers
16 Chapter P Prerequisites P.2 Properties of Real Numbers What you should learn: Identify and use the basic properties of real numbers Develop and use additional properties of real numbers Why you should
Mathematics for Computer Science/Software Engineering. Notes for the course MSM1F3 Dr. R. A. Wilson
Mathematics for Computer Science/Software Engineering Notes for the course MSM1F3 Dr. R. A. Wilson October 1996 Chapter 1 Logic Lecture no. 1. We introduce the concept of a proposition, which is a statement
Solutions to Homework 6 Mathematics 503 Foundations of Mathematics Spring 2014
Solutions to Homework 6 Mathematics 503 Foundations of Mathematics Spring 2014 3.4: 1. If m is any integer, then m(m + 1) = m 2 + m is the product of m and its successor. That it to say, m 2 + m is the
A Correlation of Pearson Texas Geometry Digital, 2015
A Correlation of Pearson Texas Geometry Digital, 2015 To the Texas Essential Knowledge and Skills (TEKS) for Geometry, High School, and the Texas English Language Proficiency Standards (ELPS) Correlations
Basic Logic Gates Richard E. Haskell
BASIC LOGIC GATES 1 E Basic Logic Gates Richard E. Haskell All digital systems are made from a few basic digital circuits that we call logic gates. These circuits perform the basic logic functions that
Computational Logic and Cognitive Science: An Overview
Computational Logic and Cognitive Science: An Overview Session 1: Logical Foundations Technical University of Dresden 25th of August, 2008 University of Osnabrück Who we are Helmar Gust Interests: Analogical
6. BOOLEAN LOGIC DESIGN
6. OOLEN LOGI DESIGN 89 Topics: oolean algebra onverting between oolean algebra and logic gates and ladder logic Logic examples Objectives: e able to simplify designs with oolean algebra 6. INTRODUTION
BOOLEAN ALGEBRA & LOGIC GATES
BOOLEAN ALGEBRA & LOGIC GATES Logic gates are electronic circuits that can be used to implement the most elementary logic expressions, also known as Boolean expressions. The logic gate is the most basic
Understanding Logic Design
Understanding Logic Design ppendix of your Textbook does not have the needed background information. This document supplements it. When you write add DD R0, R1, R2, you imagine something like this: R1
The last three chapters introduced three major proof techniques: direct,
CHAPTER 7 Proving Non-Conditional Statements The last three chapters introduced three major proof techniques: direct, contrapositive and contradiction. These three techniques are used to prove statements
Reasoning and Proof Review Questions
www.ck12.org 1 Reasoning and Proof Review Questions Inductive Reasoning from Patterns 1. What is the next term in the pattern: 1, 4, 9, 16, 25, 36, 49...? (a) 81 (b) 64 (c) 121 (d) 56 2. What is the next
Logic is a systematic way of thinking that allows us to deduce new information
CHAPTER 2 Logic Logic is a systematic way of thinking that allows us to deduce new information from old information and to parse the meanings of sentences. You use logic informally in everyday life and
MATHEMATICS PLACEMENT
MATHEMATICS PLACEMENT Am I required to take the Math Placement Exam? Students are not required to take the placement exam. Your mathematics placement is determined by your Math subscore on the ACT or SAT
The Mathematics of GIS. Wolfgang Kainz
The Mathematics of GIS Wolfgang Kainz Wolfgang Kainz Department of Geography and Regional Research University of Vienna Universitätsstraße 7, A-00 Vienna, Austria E-Mail: wolfgang.kainz@univie.ac.at Version.
alternate interior angles
alternate interior angles two non-adjacent angles that lie on the opposite sides of a transversal between two lines that the transversal intersects (a description of the location of the angles); alternate
Indiana State Core Curriculum Standards updated 2009 Algebra I
Indiana State Core Curriculum Standards updated 2009 Algebra I Strand Description Boardworks High School Algebra presentations Operations With Real Numbers Linear Equations and A1.1 Students simplify and
Predicate Logic. Example: All men are mortal. Socrates is a man. Socrates is mortal.
Predicate Logic Example: All men are mortal. Socrates is a man. Socrates is mortal. Note: We need logic laws that work for statements involving quantities like some and all. In English, the predicate is
Predicate Logic Review
Predicate Logic Review UC Berkeley, Philosophy 142, Spring 2016 John MacFarlane 1 Grammar A term is an individual constant or a variable. An individual constant is a lowercase letter from the beginning
Geometry Chapter 2 Study Guide
Geometry Chapter 2 Study Guide Short Answer ( 2 Points Each) 1. (1 point) Name the Property of Equality that justifies the statement: If g = h, then. 2. (1 point) Name the Property of Congruence that justifies
Matrix Algebra. Some Basic Matrix Laws. Before reading the text or the following notes glance at the following list of basic matrix algebra laws.
Matrix Algebra A. Doerr Before reading the text or the following notes glance at the following list of basic matrix algebra laws. Some Basic Matrix Laws Assume the orders of the matrices are such that
So let us begin our quest to find the holy grail of real analysis.
1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers
Logical Agents. Explorations in Artificial Intelligence. Knowledge-based Agents. Knowledge-base Agents. Outline. Knowledge bases
Logical Agents Explorations in Artificial Intelligence rof. Carla. Gomes gomes@cs.cornell.edu Agents that are able to: Form representations of the world Use a process to derive new representations of the
Cartesian Products and Relations
Cartesian Products and Relations Definition (Cartesian product) If A and B are sets, the Cartesian product of A and B is the set A B = {(a, b) :(a A) and (b B)}. The following points are worth special
Solutions for Practice problems on proofs
Solutions for Practice problems on proofs Definition: (even) An integer n Z is even if and only if n = 2m for some number m Z. Definition: (odd) An integer n Z is odd if and only if n = 2m + 1 for some
Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics
Undergraduate Notes in Mathematics Arkansas Tech University Department of Mathematics An Introductory Single Variable Real Analysis: A Learning Approach through Problem Solving Marcel B. Finan c All Rights
196 Chapter 7. Logical Agents
7 LOGICAL AGENTS In which we design agents that can form representations of the world, use a process of inference to derive new representations about the world, and use these new representations to deduce
Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2
CS 70 Discrete Mathematics and Probability Theory Fall 2009 Satish Rao, David Tse Note 2 Proofs Intuitively, the concept of proof should already be familiar We all like to assert things, and few of us
MATHEMATICAL INDUCTION. Mathematical Induction. This is a powerful method to prove properties of positive integers.
MATHEMATICAL INDUCTION MIGUEL A LERMA (Last updated: February 8, 003) Mathematical Induction This is a powerful method to prove properties of positive integers Principle of Mathematical Induction Let P
Full and Complete Binary Trees
Full and Complete Binary Trees Binary Tree Theorems 1 Here are two important types of binary trees. Note that the definitions, while similar, are logically independent. Definition: a binary tree T is full
26 Integers: Multiplication, Division, and Order
26 Integers: Multiplication, Division, and Order Integer multiplication and division are extensions of whole number multiplication and division. In multiplying and dividing integers, the one new issue
Simple Present Tense. Simple Present Tense in the Negative. Grammar Practice Worksheets
Simple Present Tense Choose the correct verb from the list below to complete the following sentences. Use the correct form of the simple present tense. fix stand speak drink eat do wear have wash make
1 Propositions. mcs-ftl 2010/9/8 0:40 page 5 #11. Definition. A proposition is a statement that is either true or false.
mcs-ftl 2010/9/8 0:40 page 5 #11 1 Propositions Definition. A proposition is a statement that is either true or false. For example, both of the following statements are propositions. The first is true
Formal Software Development
Formal Software Development From VDM to Java Quentin Charatan and Aaron Kans Formal Software Development FORMAL SOFTWARE DEVELOPMENT From VDM to Java Quentin Charatan and Aaron Kans Quentin Charatan and
Solutions Q1, Q3, Q4.(a), Q5, Q6 to INTLOGS16 Test 1
Solutions Q1, Q3, Q4.(a), Q5, Q6 to INTLOGS16 Test 1 Prof S Bringsjord 0317161200NY Contents I Problems 1 II Solutions 3 Solution to Q1 3 Solutions to Q3 4 Solutions to Q4.(a) (i) 4 Solution to Q4.(a)........................................
CAPS. Mathematics. Grade 2. Practice Book. Practice Book. Practice. Book. Book. Book. Book. Book. Book. Book. Book. Book. Book. Book. Book.
Mathematics Grade 2 Name: CAPS Worksheet 1: Puzzle problems 1. Work out these puzzles with a partner. Make sure that each line for each puzzle adds up to the same number. a. b. 2 3 Each line must add up
Introduction. Appendix D Mathematical Induction D1
Appendix D Mathematical Induction D D Mathematical Induction Use mathematical induction to prove a formula. Find a sum of powers of integers. Find a formula for a finite sum. Use finite differences to
MAT-71506 Program Verication: Exercises
MAT-71506 Program Verication: Exercises Antero Kangas Tampere University of Technology Department of Mathematics September 11, 2014 Accomplishment Exercises are obligatory and probably the grades will
Chapter 2: Boolean Algebra and Logic Gates. Boolean Algebra
The Universit Of Alabama in Huntsville Computer Science Chapter 2: Boolean Algebra and Logic Gates The Universit Of Alabama in Huntsville Computer Science Boolean Algebra The algebraic sstem usuall used
Conjunction is true when both parts of the statement are true. (p is true, q is true. p^q is true)
Mathematical Sentence - a sentence that states a fact or complete idea Open sentence contains a variable Closed sentence can be judged either true or false Truth value true/false Negation not (~) * Statement
6.2 Permutations continued
6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of
WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT?
WHAT ARE MATHEMATICAL PROOFS AND WHY THEY ARE IMPORTANT? introduction Many students seem to have trouble with the notion of a mathematical proof. People that come to a course like Math 216, who certainly
Geometry Course Summary Department: Math. Semester 1
Geometry Course Summary Department: Math Semester 1 Learning Objective #1 Geometry Basics Targets to Meet Learning Objective #1 Use inductive reasoning to make conclusions about mathematical patterns Give
Workforce scheduling with logical constraints: theory and applications in call centers
Workforce scheduling with logical constraints: theory and applications in call centers Gábor Danó This thesis was supervised by Sandjai Bhulai and Ger Koole Department of Mathematics Vrije Universiteit
We would like to state the following system of natural deduction rules preserving falsity:
A Natural Deduction System Preserving Falsity 1 Wagner de Campos Sanz Dept. of Philosophy/UFG/Brazil sanz@fchf.ufg.br Abstract This paper presents a natural deduction system preserving falsity. This new
Show all work for credit. Attach paper as needed to keep work neat & organized.
Geometry Semester 1 Review Part 2 Name Show all work for credit. Attach paper as needed to keep work neat & organized. Determine the reflectional (# of lines and draw them in) and rotational symmetry (order
Introduction to Automata Theory. Reading: Chapter 1
Introduction to Automata Theory Reading: Chapter 1 1 What is Automata Theory? Study of abstract computing devices, or machines Automaton = an abstract computing device Note: A device need not even be a
Practice with Proofs
Practice with Proofs October 6, 2014 Recall the following Definition 0.1. A function f is increasing if for every x, y in the domain of f, x < y = f(x) < f(y) 1. Prove that h(x) = x 3 is increasing, using
Operations with positive and negative numbers - see first chapter below. Rules related to working with fractions - see second chapter below
INTRODUCTION If you are uncomfortable with the math required to solve the word problems in this class, we strongly encourage you to take a day to look through the following links and notes. Some of them
Probability Using Dice
Using Dice One Page Overview By Robert B. Brown, The Ohio State University Topics: Levels:, Statistics Grades 5 8 Problem: What are the probabilities of rolling various sums with two dice? How can you
EQUATIONAL LOGIC AND ABSTRACT ALGEBRA * ABSTRACT
EQUATIONAL LOGIC AND ABSTRACT ALGEBRA * Taje I. Ramsamujh Florida International University Mathematics Department ABSTRACT Equational logic is a formalization of the deductive methods encountered in studying
Elementary Number Theory and Methods of Proof. CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.
Elementary Number Theory and Methods of Proof CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 1 Number theory Properties: 2 Properties of integers (whole
6.080/6.089 GITCS Feb 12, 2008. Lecture 3
6.8/6.89 GITCS Feb 2, 28 Lecturer: Scott Aaronson Lecture 3 Scribe: Adam Rogal Administrivia. Scribe notes The purpose of scribe notes is to transcribe our lectures. Although I have formal notes of my
WOLLONGONG COLLEGE AUSTRALIA. Diploma in Information Technology
First Name: Family Name: Student Number: Class/Tutorial: WOLLONGONG COLLEGE AUSTRALIA A College of the University of Wollongong Diploma in Information Technology Mid-Session Test Summer Session 008-00
Math 166 - Week in Review #4. A proposition, or statement, is a declarative sentence that can be classified as either true or false, but not both.
Math 166 Spring 2007 c Heather Ramsey Page 1 Math 166 - Week in Review #4 Sections A.1 and A.2 - Propositions, Connectives, and Truth Tables A proposition, or statement, is a declarative sentence that
Incenter Circumcenter
TRIANGLE: Centers: Incenter Incenter is the center of the inscribed circle (incircle) of the triangle, it is the point of intersection of the angle bisectors of the triangle. The radius of incircle is
Rigorous Software Development CSCI-GA 3033-009
Rigorous Software Development CSCI-GA 3033-009 Instructor: Thomas Wies Spring 2013 Lecture 11 Semantics of Programming Languages Denotational Semantics Meaning of a program is defined as the mathematical
Applied Liberal Arts Mathematics MAT-105-TE
Applied Liberal Arts Mathematics MAT-105-TE This TECEP tests a broad-based overview of mathematics intended for non-math majors and emphasizes problem-solving modeled on real-life applications. Topics
Think about things that are green. List five different things that are green and use each of these words in a sentence.
Think about things that are green. List five different things that are green and use each of these words in a sentence. Money is a tool that can be used to buy things that we need to survive. What are
Structurally ambiguous sentences
Language and Mind HONR 218L Recap: entences have structure In speaking and writing we string words together linearly (we have no choice) But in our minds, we represent sentences as hierarchical structures
Cosmological Arguments for the Existence of God S. Clarke
Cosmological Arguments for the Existence of God S. Clarke [Modified Fall 2009] 1. Large class of arguments. Sometimes they get very complex, as in Clarke s argument, but the basic idea is simple. Lets
Guide to Leaving Certificate Mathematics Ordinary Level
Guide to Leaving Certificate Mathematics Ordinary Level Dr. Aoife Jones Paper 1 For the Leaving Cert 013, Paper 1 is divided into three sections. Section A is entitled Concepts and Skills and contains
7.5 Emphatic Verb Tense
Chapter 7 Verb Usage 211 7.5 Emphatic Verb Tense The emphatic tenses of a verb are used to add emphasis. In addition, the emphatic tense can be used with the word not in negative sentences and to form
An Innocent Investigation
An Innocent Investigation D. Joyce, Clark University January 2006 The beginning. Have you ever wondered why every number is either even or odd? I don t mean to ask if you ever wondered whether every number