1 Propositional Logic  Axioms and Inference Rules


 Collin Eustace Fisher
 2 years ago
 Views:
Transcription
1 1 Propositional Logic  Axioms and Inference Rules Axioms Axiom 1.1 [Commutativity] (p q) (q p) (p q) (q p) (p q) (q p) Axiom 1.2 [Associativity] p (q r) (p q) r p (q r) (p q) r Axiom 1.3 [Distributivity] p (q r) (p q) (p r) p (q r) (p q) (p r) Axiom 1.4 [De Morgan] (p q) p q (p q) p q Axiom 1.5 [Negation] p p Axiom 1.6 [Excluded Middle] p p T 1
2 Axiom 1.7 [Contradiction] p p F Axiom 1.8 [Implication] p q p q Axiom 1.9 [Equality] (p q) (p q) (q p) Axiom 1.10 [orsimplification] p p p p T T p F p p (p q) p Axiom 1.11 [andsimplification] p p p p T p p F F p (p q) p Axiom 1.12 [Identity] p p 2
3 Inference Rules p 1 p 2, p 2 p 3 p 1 p 3 Transitivity p 1 p 2 E(p 1 ) E(p 2 ), E(p 2 ) E(p 1 ) Substitution q 1, q 2,..., q n, q 1 q 2... q n (p 1 p 2 ) E(p 1 ) E(p 2 ), E(p 2 ) E(p 1 ) Conditional Substitution 3
4 2 Propositional Logic  Derived Theorems Equivalence and Truth Theorem 2.1 [Associativity of ] ((p q) r) (p (q r)) Theorem 2.2 [Identity of ] (T p) p Theorem 2.3 [Truth] T Negation, Inequivalence, and False Theorem 2.4 [Definition of F] F T Theorem 2.5 [Distributivity of over ] (p q) ( p q) ( p q) (p q) Theorem 2.6 [Negation of F] F T 4
5 Theorem 2.7 [Definition of ] ( p p) F p (p F) Disjunction Theorem 2.8 [Distributivity of over ] (p (q r)) ((p q) (p r)) ((p (q r)) (p q)) (p r) Theorem 2.9 [Distributivity of over ] p (q r) (p q) (p r) Conjunction Theorem 2.10 [Mutual definition of and ] (p q) (p (q (p q))) (p q) ((p q) (p q)) ((p q) p) (q (p q)) ((p q) (p q)) (p q) (((p q) p) q) (p q) Theorem 2.11 [Distributivity of over ] p (q r) (p q) (p r) 5
6 Theorem 2.12 [Absorption] p ( p q) p q p ( p q) p q Theorem 2.13 [Distributivity of over ] (p q) ((p q) p) ((p q) (p q)) p p (q p) (p q) Theorem 2.14 [Replacement] (p q) (r p) (p q) (r q) Theorem 2.15 [Definition of ] (p q) (p q) ( p q) Theorem 2.16 [Exclusive or] (p q) ( p q) (p q) Implication Theorem 2.17 [Definition of Implication] (p q) ((p q) q) ((p q) (p q)) q (p q) ((p q) p) ((p q) (p q)) p 6
7 Theorem 2.18 [Contrapositive] (p q) ( q p) Theorem 2.19 [Distributivity of over ] p (q r) ((p q) (p r)) Theorem 2.20 [Shunting] p q r p (q r) Theorem 2.21 [Elimination/Introduction of ] p (p q) p q p (q p) p p (p q) T p (q p) q p (p q) (p q) (p q) p F p F p T Theorem 2.22 [Right Zero of ] (p T) T Theorem 2.23 [Left Identity of ] (T p) p 7
8 Theorem 2.24 [Weakening/Strengthening] p p q p q p p q p q p (q r) p q p q p (q r) Theorem 2.25 [Modus Ponens] p (p q) q Theorem 2.26 [Proof by Cases] (p r) (q r) (p q r) (p r) ( p r) r Theorem 2.27 [Mutual Implication] (p q) (q p) (p q) Theorem 2.28 [Antisymmetry] (p q) (q p) (p q) Theorem 2.29 [Transitivity] (p q) (q r) (p r) (p q) (q r) (p r) (p q) (q r) (p r) Theorem 2.30 [Monotonicity of ] (p q) (p r q r) 8
9 Theorem 2.31 [Monotonicity of ] (p q) (p r q r) Substitution Theorem 2.32 [Leibniz] (e f) (E(e) E(f)) Theorem 2.33 [Substitution] (e f) E(e) (e f) E(f) (e f) E(e) (e f) E(f) q (e f) E(e) q (e f) E(f) Theorem 2.34 [Replace by T] p E(p) p E(T) p E(p) p E(T) q p E(p) q p E(T) Theorem 2.35 [Replace by F] p E(p) p E(F) E(p) p E(F) p E(p) p q E(F) p q Theorem 2.36 [Shannon] E(p) (p E(T)) ( p E(F)) 9
10 3 Propositional Logic  Examples and Exercises 10
11 4 Predicate Logic  Axioms Axiom 4.1 [Definition of ] i : m i < n : p i (m n) F (m < n) i : m i < n : p i i : m i < n 1 : p i p n 1 Axiom 4.2 [Definition of ] i : m i < n : p i (m n) T (m < n) i : m i < n : p i i : m i < n 1 : p i p n 1 11
12 Axiom 4.3 [Range Split] (m 1 m 2 m 3 ) i : m 1 i < m 2 : p i i : m 2 i < m 3 : p i i : m 1 i < m 3 : p i (m 1 m 2 ) (n 1 n 2 ) i : m 1 i < n 1 : p i i : m 2 i < n 2 : p i i : m 1 i < n 1 : p i (m 1 m 2 m 3 ) i : m 1 i < m 2 : p i i : m 2 i < m 3 : p i i : m 1 i < m 3 : p i (m 1 m 2 ) (n 1 n 2 ) i : m 1 i < n 1 : p i i : m 2 i < n 2 : p i i : m 1 i < n 1 : p i Axiom 4.4 [Interchange of Dummies] i : m 1 i < n 1 : ( j : m 2 j < n 2 : p i,j ) j : m 2 j < n 2 : ( i : m 1 i < n 1 : p i,j ) i : m 1 i < n 1 : ( j : m 2 j < n 2 : p i,j ) j : m 2 j < n 2 : ( i : m 1 i < n 1 : p i,j ) 12
13 Axiom 4.5 [Dummy Renaming] i : m i < n : p i j : m j < n : p j Axiom 4.6 [Distributivity of over ] (p ( i : m i < n : q i )) i : m i < n : (p q i ) Axiom 4.7 [Distributivity of over ] p ( i : m i < n : q i ) (m < n) i : m i < n : p q i i : m i < n : p i i : m i < n : q i i : m i < n : (p i q i ) Axiom 4.8 [Distributivity of over ] (p ( i : m i < n : q i )) i : m i < n : (p q i ) Axiom 4.9 [Distributivity of over ] p ( i : m i < n : q i ) (m < n) i : m i < n : (p q i ) i : m i < n : p i i : m i < n : q i i : m i < n : (p i q i ) Axiom 4.10 [Universality of T] i : m i < n : T T 13
14 Axiom 4.11 [Existence of F] i : m i < n : F F Axiom 4.12 [Generalized De Morgan] ( i : m i < n : p i ) i : m i < n : p i ( i : m i < n : p i ) i : m i < n : p i Axiom 4.13 [Trading] (m i < n) p i i : m i < n : p i (m i < n) p i i : m i < n : p i Axiom 4.14 [Definition of Numerical Quantification] Ni : m i < n : p i (m n) 0 (m < n) p n 1 (m < n) p n 1 Ni : m i < n : p i Ni : m i < n 1 : p i Ni : m i < n : p i Ni : m i < n 1 : p i
15 Axiom 4.15 [Definition of Σ] Σi : m i < n : e i (m n) 0 (m < n) Σi : m i < n : e i Σi : m i < n 1 : e i + e n 1 Axiom 4.16 [Definition of Π] Πi : m i < n : e i (m n) 1 (m < n) Πi : m i < n : e i Πi : m i < n 1 : e i e n 1 15
16 5 Predicate Logic  Derived Theorems Theorem 5.1 [Definition of ] i : m < i n : p i (m n) F (m < n) i : m < i n : p i i : m+1 < i n : p i p m+1 Theorem 5.2 [Definition of ] (m n) i : m < i n : p i T (m < n) i : m < i n : p i i : m+1 < i n : p i p m+1 16
17 Theorem 5.3 [Definition of Σ] Σi : m < i n : e i (m n) 0 (m < n) Σi : m < i n : e i Σi : m+1 < i n : e i + e m+1 Theorem 5.4 [Definition of Π] (m n) Πi : m < i n : e i 1 (m < n) Πi : m < i n : e i Πi : m+1 < i n : e i e m+1 17
18 6 Some Simple Laws of Arithmetic Throughout this compendium, we assume the validity of all simple arithmetic rules. Examples of such rules are all simplification rules, e.g x+x 2 x x+y y x (x/3) 3 x 0 x 0 1 x x x x x 2 0 x 0 1 x 1 (2 x+10 20) (x 5) (x+y < 2 y) (x < y) (x+y x+z) (y z) x (y +1) (x+z) (x y z) Following is a collection of theorems that might be used. The list is not exhaustive but intend to show the level of complexity that you can specify theorems on. 18
19 Theorems on < and (x < y) (y > x) (x < y) (y x) (y < x) (x < y) (x y) (x < y) (x y) (x y) (x < y) (y z) (x < z) (x y) (x > y) (x x) T (x y) (y z) (x z) (x y) (y < z) (x < z) (x y) (x < y) (x < y) (x y 1) (x < y) (x y) (y x) T (x y) (y < x) T (x y) (x < y) (x y) Theorems on properties about + and (x < y) (x < y +1) (x < y +1) (x y) (x < y) (z y < z x) (0 < x) ( x < 0) (x 1 < x) T (x y 1) (x < y) (x y) (x 1 < y) (x 1 < y 1 ) (x 2 < y 2 ) (x 1 +x 2 < y 1 +y 2 ) (x 1 y 1 ) (x 2 y 2 ) (x 1 +x 2 y 1 +y 2 ) 19
20 Theorems on properties about and / (0 < x) (0 < 2 x) (0 < x) (x < 2 x) (0 < x) (x 2 < x) (0 x/2) (0 x) (x 0) (x y 0) 2 (x/2) x Theorems on equivalence relation (x x) T (x y) (x y) (y x) Theorems about odd(n) and even(n) odd(x) ((x 1) 2 (x 1)/2) even(x) (x 2 x/2) odd(x+2 y) odd(x) even(x+2 y) even(x) odd(x) even(x) odd(x) ((x 1) (x 0)) odd(x) (x 0) F 20
21 7 Predicate Logic  Examples and Exercises 21
22 8 Arrays  Axioms 8.1 Axioms Axiom 8.1 [Assignment to Array Element] (i j) (e f) ((b; i : e)[j] f) (i j) (b[j] f) Axiom 8.2 [Definition of Arithmetic Relations] (b[i : j] x) ( k : i k < j +1 : b[k] x) (b[i : j] < x) ( k : i k < j +1 : b[k] < x) (b[i : j] > x) ( k : i k < j +1 : b[k] > x) (b[i : j] x) ( k : i k < j +1 : b[k] x) (b[i : j] x) ( k : i k < j +1 : b[k] x) (b[i : j] x) ( k : i k < j +1 : b[k] x) x b[i : j] ( k : i k < j +1 : x b[k]) 22
CS 441 Discrete Mathematics for CS Lecture 5. Predicate logic. CS 441 Discrete mathematics for CS. Negation of quantifiers
CS 441 Discrete Mathematics for CS Lecture 5 Predicate logic Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Negation of quantifiers English statement: Nothing is perfect. Translation: x Perfect(x)
More informationCHAPTER 1. Logic, Proofs Propositions
CHAPTER 1 Logic, Proofs 1.1. Propositions A proposition is a declarative sentence that is either true or false (but not both). For instance, the following are propositions: Paris is in France (true), London
More informationdef: 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
More informationLogic in general. Inference rules and theorem proving
Logical Agents Knowledgebased agents Logic in general Propositional logic Inference rules and theorem proving First order logic Knowledgebased agents Inference engine Knowledge base Domainindependent
More informationThe Foundations: Logic and Proofs. Chapter 1, Part III: Proofs
The Foundations: Logic and Proofs Chapter 1, Part III: Proofs Rules of Inference Section 1.6 Section Summary Valid Arguments Inference Rules for Propositional Logic Using Rules of Inference to Build Arguments
More informationResolution. 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
More information2. Methods of Proof Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try.
2. METHODS OF PROOF 69 2. Methods of Proof 2.1. Types of Proofs. Suppose we wish to prove an implication p q. Here are some strategies we have available to try. Trivial Proof: If we know q is true then
More informationHandout #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
More informationPredicate 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
More informationGeneralized Modus Ponens
Generalized Modus Ponens This rule allows us to derive an implication... True p 1 and... p i and... p n p 1... p i1 and p i+1... p n implies p i implies q implies q allows: a 1 and... a i and... a n implies
More informationDISCRETE 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
More informationLikewise, 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
More informationCHAPTER 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
More informationProblems on Discrete Mathematics 1
Problems on Discrete Mathematics 1 ChungChih Li 2 Kishan Mehrotra 3 Syracuse University, New York L A TEX at January 11, 2007 (Part I) 1 No part of this book can be reproduced without permission from
More informationUnit 3 Boolean Algebra (Continued)
Unit 3 Boolean Algebra (Continued) 1. ExclusiveOR Operation 2. Consensus Theorem Department of Communication Engineering, NCTU 1 3.1 Multiplying Out and Factoring Expressions Department of Communication
More informationPredicate 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
More informationINTRODUCTORY SET THEORY
M.Sc. program in mathematics INTRODUCTORY SET THEORY Katalin Károlyi Department of Applied Analysis, Eötvös Loránd University H1088 Budapest, Múzeum krt. 68. CONTENTS 1. SETS Set, equal sets, subset,
More informationLecture 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
More informationBoolean 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
More informationWOLLONGONG 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 MidSession Test Summer Session 00800
More informationCorrespondence analysis for strong threevalued logic
Correspondence analysis for strong threevalued logic A. Tamminga abstract. I apply Kooi and Tamminga s (2012) idea of correspondence analysis for manyvalued logics to strong threevalued logic (K 3 ).
More informationFormal Engineering for Industrial Software Development
Shaoying Liu Formal Engineering for Industrial Software Development Using the SOFL Method With 90 Figures and 30 Tables Springer Contents Introduction 1 1.1 Software Life Cycle... 2 1.2 The Problem 4 1.3
More informationCHAPTER 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
More informationPropositional 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
More informationMath 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
More informationIAEA Training Course on Safety Assessment of NPPs to Assist Decision Making. System Analysis. Lecturer. Workshop Information IAEA Workshop
IAEA Training Course on Safety Assessment of NPPs to Assist Decision Making System Analysis Lecturer Lesson Lesson IV IV 3_2.3 3_2.3 Workshop Information IAEA Workshop City, XX XX  City XX, Country Month,
More informationSwitching 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
More informationPART I. THE REAL NUMBERS
PART I. THE REAL NUMBERS This material assumes that you are already familiar with the real number system and the representation of the real numbers as points on the real line. I.1. THE NATURAL NUMBERS
More informationRules of Inference Friday, January 18, 2013 Chittu Tripathy Lecture 05
Rules of Inference Today s Menu Rules of Inference Quantifiers: Universal and Existential Nesting of Quantifiers Applications Old Example ReRevisited Our Old Example: Suppose we have: All human beings
More informationCSL105: Discrete Mathematical Structures. Ragesh Jaiswal, CSE, IIT Delhi
Propositional Logic: logical operators Negation ( ) Conjunction ( ) Disjunction ( ). Exclusive or ( ) Conditional statement ( ) Biconditional statement ( ): Let p and q be propositions. The biconditional
More informationA Guide to ProofWriting
by Ron Morash, University of Michigan Dearborn PW1 At the end of Section 1.7, the text states, We have not given a procedure that can be used for proving theorems in mathematics. It is a deep theorem
More informationDay 2: Logic and Proof
Day 2: Logic and Proof George E. Hrabovsky MAST Introduction This is the second installment of the series. Here I intend to present the ideas and methods of proof. Logic and proof To begin with, I will
More informationPropositional Logic. Definition: A proposition or statement is a sentence which is either true or false.
Propositional Logic Definition: A proposition or statement is a sentence which is either true or false. Definition:If a proposition is true, then we say its truth value is true, and if a proposition is
More informationElementary 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
More information3. 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)
More informationConsistency, completeness of undecidable preposition of Principia Mathematica. Tanmay Jaipurkar
Consistency, completeness of undecidable preposition of Principia Mathematica Tanmay Jaipurkar October 21, 2013 Abstract The fallowing paper discusses the inconsistency and undecidable preposition of Principia
More informationComputational 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
More informationThe 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, A00 Vienna, Austria EMail: wolfgang.kainz@univie.ac.at Version.
More informationfacultad de informática universidad politécnica de madrid
facultad de informática universidad politécnica de madrid On the Confluence of CHR Analytical Semantics Rémy Haemmerlé Universidad olitécnica de Madrid & IMDEA Software Institute, Spain TR Number CLI2/2014.0
More information(LMCS, p. 317) V.1. First Order Logic. This is the most powerful, most expressive logic that we will examine.
(LMCS, p. 317) V.1 First Order Logic This is the most powerful, most expressive logic that we will examine. Our version of firstorder logic will use the following symbols: variables connectives (,,,,
More informationGödel s Ontological Proof of the Existence of God
Prof. Dr. Elke Brendel Institut für Philosophie Lehrstuhl für Logik und Grundlagenforschung g Rheinische FriedrichWilhelmsUniversität Bonn ebrendel@unibonn.de Gödel s Ontological Proof of the Existence
More informationPredicate Logic. For example, consider the following argument:
Predicate Logic The analysis of compound statements covers key aspects of human reasoning but does not capture many important, and common, instances of reasoning that are also logically valid. For example,
More informationDiscrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof. Harper Langston New York University
Discrete Mathematics Lecture 3 Elementary Number Theory and Methods of Proof Harper Langston New York University Proof and Counterexample Discovery and proof Even and odd numbers number n from Z is called
More informationLogic 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
More information196 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
More informationBeyond 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
More informationFoundations of Logic and Mathematics
Yves Nievergelt Foundations of Logic and Mathematics Applications to Computer Science and Cryptography Birkhäuser Boston Basel Berlin Contents Preface Outline xiii xv A Theory 1 0 Boolean Algebraic Logic
More informationHigh School Geometry Test Sampler Math Common Core Sampler Test
High School Geometry Test Sampler Math Common Core Sampler Test Our High School Geometry sampler covers the twenty most common questions that we see targeted for this level. For complete tests and break
More informationIntroduction 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
More information1 Propositional Logic
1 Propositional Logic Propositions 1.1 Definition A declarative sentence is a sentence that declares a fact or facts. Example 1 The earth is spherical. 7 + 1 = 6 + 2 x 2 > 0 for all real numbers x. 1 =
More informationLecture 13 of 41. More Propositional and Predicate Logic
Lecture 13 of 41 More Propositional and Predicate Logic Monday, 20 September 2004 William H. Hsu, KSU http://www.kddresearch.org http://www.cis.ksu.edu/~bhsu Reading: Sections 8.18.3, Russell and Norvig
More informationSoftware Testing & Verification 2013/2014 Universiteit Utrecht
Software Testing & Verification 2013/2014 Universiteit Utrecht 2nd Jul. 2014, 13:3016:30, BBL 001 Lecturer: Wishnu Prasetya You are allowed to bring along the Appendix of the LN. Part I [3pt (6 0.5)]
More informationSJÄLVSTÄNDIGA ARBETEN I MATEMATIK
SJÄLVSTÄNDIGA ARBETEN I MATEMATIK MATEMATISKA INSTITUTIONEN, STOCKHOLMS UNIVERSITET Automated Theorem Proving av Tom Everitt 2010  No 8 MATEMATISKA INSTITUTIONEN, STOCKHOLMS UNIVERSITET, 106 91 STOCKHOLM
More informationFuzzy Implication Rules. Adnan Yazıcı Dept. of Computer Engineering, Middle East Technical University Ankara/Turkey
Fuzzy Implication Rules Adnan Yazıcı Dept. of Computer Engineering, Middle East Technical University Ankara/Turkey Fuzzy IfThen Rules Remember: The difference between the semantics of fuzzy mapping rules
More informationBasic 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
More informationUndergraduate 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
More informationThe History of Logic. Aristotle (384 322 BC) invented logic.
The History of Logic Aristotle (384 322 BC) invented logic. Predecessors: Fred Flintstone, geometry, sophists, presocratic philosophers, Socrates & Plato. Syllogistic logic, laws of noncontradiction
More informationCH3 Boolean Algebra (cont d)
CH3 Boolean Algebra (cont d) Lecturer: 吳 安 宇 Date:2005/10/7 ACCESS IC LAB v Today, you ll know: Introduction 1. Guidelines for multiplying out/factoring expressions 2. ExclusiveOR and Equivalence operations
More informationDiscrete Mathematics For Computer Science
Notes for Part IA CST 2013/14 Discrete Mathematics For Computer Science Lecture plan 1. Preliminaries (pages 4 10) and introduction (pages 11 37). 2. On implication
More informationChapter 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
More informationProperties 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
More informationWHAT 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
More informationRelations and Functions
Section 5. Relations and Functions 5.1. Cartesian Product 5.1.1. Definition: Ordered Pair Let A and B be sets and let a A and b B. An ordered pair ( a, b) is a pair of elements with the property that:
More informationGeometry Chapter 2: Geometric Reasoning Lesson 1: Using Inductive Reasoning to Make Conjectures Inductive Reasoning:
Geometry Chapter 2: Geometric Reasoning Lesson 1: Using Inductive Reasoning to Make Conjectures Inductive Reasoning: Conjecture: Advantages: can draw conclusions from limited information helps us to organize
More informationRemarks on NonFregean Logic
STUDIES IN LOGIC, GRAMMAR AND RHETORIC 10 (23) 2007 Remarks on NonFregean Logic Mieczys law Omy la Institute of Philosophy University of Warsaw Poland m.omyla@uw.edu.pl 1 Introduction In 1966 famous Polish
More informationLogical Agents. Explorations in Artificial Intelligence. Knowledgebased Agents. Knowledgebase 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
More informationEQUATIONAL 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
More informationSymbolic Logic on the TI92
Symbolic Logic on the TI92 Presented by Lin McMullin The Sixth Conference on the Teaching of Mathematics June 20 & 21, 1997 Milwaukee, Wisconsin 1 Lin McMullin Mathematics Department Representative, Burnt
More informationDiscrete 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
More informationBoolean Design of Patterns
123 Boolean Design of Patterns Basic weave structures interlacement patterns can be described in many ways, but they all come down to representing the crossings of warp and weft threads. One or the other
More informationToday s Topics. Primes & Greatest Common Divisors
Today s Topics Primes & Greatest Common Divisors Prime representations Important theorems about primality Greatest Common Divisors Least Common Multiples Euclid s algorithm Once and for all, what are prime
More information1.1 Logical Form and Logical Equivalence 1
Contents Chapter I The Logic of Compound Statements 1.1 Logical Form and Logical Equivalence 1 Identifying logical form; Statements; Logical connectives: not, and, and or; Translation to and from symbolic
More informationCourse Outline Department of Computing Science Faculty of Science. COMP 37103 Applied Artificial Intelligence (3,1,0) Fall 2015
Course Outline Department of Computing Science Faculty of Science COMP 710  Applied Artificial Intelligence (,1,0) Fall 2015 Instructor: Office: Phone/Voice Mail: EMail: Course Description : Students
More informationFlorida State University Course Notes MAD 2104 Discrete Mathematics I
Florida State University Course Notes MAD 2104 Discrete Mathematics I Florida State University Tallahassee, Florida 323064510 Copyright c 2011 Florida State University Written by Dr. John Bryant and Dr.
More informationSchedule. Logic (master program) Literature & Online Material. gic. Time and Place. Literature. Exercises & Exam. Online Material
OLC mputational gic Schedule Time and Place Thursday, 8:15 9:45, HS E Logic (master program) Georg Moser Institute of Computer Science @ UIBK week 1 October 2 week 8 November 20 week 2 October 9 week 9
More informationDegrees 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
More information4. MATRICES Matrices
4. MATRICES 170 4. Matrices 4.1. Definitions. Definition 4.1.1. A matrix is a rectangular array of numbers. A matrix with m rows and n columns is said to have dimension m n and may be represented as follows:
More informationIntroduction to Proofs
Chapter 1 Introduction to Proofs 1.1 Preview of Proof This section previews many of the key ideas of proof and cites [in brackets] the sections where they are discussed thoroughly. All of these ideas are
More informationExample: Backward Chaining. Inference Strategy: Backward Chaining. FirstOrder Logic. Knowledge Engineering. Example: Proof
Inference Strategy: Backward Chaining Idea: Check whether a particular fact q is true. Backward Chaining: Given a fact q to be proven, 1. See if q is already in the KB. If so, return TRUE. 2. Find all
More informationMathematical induction. Niloufar Shafiei
Mathematical induction Niloufar Shafiei Mathematical induction Mathematical induction is an extremely important proof technique. Mathematical induction can be used to prove results about complexity of
More information6.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
More informationQuotient Rings and Field Extensions
Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.
More informationConjunction 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
More informationChapter 13: Basic ring theory
Chapter 3: Basic ring theory Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 3: Basic ring
More informationCOURSE DESCRIPTION FOR THE COMPUTER INFORMATION SYSTEMS CURRICULUM
COURSE DESCRIPTION FOR THE COMPUTER INFORMATION SYSTEMS CURRICULUM Course Code 2505100 Computing Fundamentals Pass/ Fail Prerequisite None This course includes an introduction to the use of the computer
More informationSolutions 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
More information5.1 Commutative rings; Integral Domains
5.1 J.A.Beachy 1 5.1 Commutative rings; Integral Domains from A Study Guide for Beginner s by J.A.Beachy, a supplement to Abstract Algebra by Beachy / Blair 23. Let R be a commutative ring. Prove the following
More informationBoolean Algebra. Boolean Algebra. Boolean Algebra. Boolean Algebra
2 Ver..4 George Boole was an English mathematician of XIX century can operate on logic (or Boolean) variables that can assume just 2 values: /, true/false, on/off, closed/open Usually value is associated
More informationHypothetical Syllogisms 1
Phil 2302 Intro to Logic Dr. Naugle Hypothetical Syllogisms 1 Compound syllogisms are composed of different kinds of sentences in their premises and conclusions (not just categorical propositions, statements
More informationDEDUCTIVE & INDUCTIVE REASONING
DEDUCTIVE & INDUCTIVE REASONING Expectations 1. Take notes on inductive and deductive reasoning. 2. This is an information based presentation  I simply want you to be able to apply this information to
More informationp: 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
More informationLogic, Algebra and Truth Degrees 2008. Siena. A characterization of rst order rational Pavelka's logic
Logic, Algebra and Truth Degrees 2008 September 811, 2008 Siena A characterization of rst order rational Pavelka's logic Xavier Caicedo Universidad de los Andes, Bogota Under appropriate formulations,
More informationCHAPTER 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:
More informationML for the Working Programmer
ML for the Working Programmer 2nd edition Lawrence C. Paulson University of Cambridge CAMBRIDGE UNIVERSITY PRESS CONTENTS Preface to the Second Edition Preface xiii xv 1 Standard ML 1 Functional Programming
More informationFormal Specifications of Security Policy Models
Wolfgang Thumser TSystems GEI GmbH Overview and Motivation Structure of talk Position of FSPM within CC 3.1 and CEM 3.1 CC Requirements CEM Requirements National Scheme Realization of FSPM in terms of
More informationResearch Note. Biintuitionistic Boolean Bunched Logic
UCL DEPARTMENT OF COMPUTER SCIENCE Research Note RN/14/06 Biintuitionistic Boolean Bunched Logic June, 2014 James Brotherston Dept. of Computer Science University College London Jules Villard Dept. of
More informationMathematical 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
More informationTest Case Generation for Ultimately Periodic Paths Joint work with Saddek Bensalem Hongyang Qu Stavros Tripakis Lenore Zuck Accepted to HVC 2007 How to find the condition to execute a path? (weakest precondition
More informationMathematics 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
More informationFoundations of Artificial Intelligence. Knowledge Representation and Reasoning
Foundations of Artificial Intelligence Knowledge Representation and Reasoning Knowledge Based Systems The field of knowledge engineering can be defined as the process of assessing problems, acquiring knowledge
More information