Logic (3A) Young W. Lim 10/29/13

Size: px

Start display at page:

Download "Logic (3A) Young W. Lim 10/29/13"

Barry Casey
5 years ago
Views:

2 Copyright (c) Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation; with no Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A copy of the license is included in the section entitled "GNU Free Documentation License". Please send corrections (or suggestions) to youngwlim@hotmail.com. This document was produced by using OpenOffice.

3 Predicate Calculus Atoms Constants Numbers Simple Terms Variables Compound Terms functor(term 1,., term n ) Predicates Propositional Logic : no variable First Order Logic : variable unification (1) Every Prolog predicate : an atomic first-order logic formula (2) Commas separating subgoals : conjunctions in logic ( ^ ) (3) Prolog rules : implications (body, head) : (antecedent, consequent) ( ) and change the order of head and body (4) Queries : implications, (body, ) : (antecedent, consequent ) (5) Every variable : universally quantified 3

4 Proposition a broad use in contemporary philosophy the primary bearers of truth-value the objects of belief and other propositional attitudes (i.e., what is believed, doubted) the referents of that-clauses the meanings of sentences Propositions are the sharable objects of the attitudes the primary bearers of truth and falsity Does not certain candidates for propositions, thought- and utterance-tokens, which presumably are not sharable concrete events or facts, which presumably cannot be false. 4

5 Predicate (grammar) The part of the sentence (or clause) which states something about the subject or the object of the sentence. In "The dog barked very loudly", the subject is "the dog" and the predicate is "barked very loudly". (logic) A term of a statement, where the statement may be true or false depending on whether the thing referred to by the values of the statement's variables has the property signified by that (predicative) term. From Middle French predicate (French prédicat), from post-classical Late Latin praedicatum ( thing said of a subject ), a noun use of the neuter past participle of praedicare ( proclaim ). 5

6 Predicate and Proposition A nullary predicate is a proposition. Also, an instance of a predicate whose terms are all constant e.g., P(2,3) acts as a proposition. A predicate can be thought of as either a relation (between elements of the domain of discourse) or as a truth-valued function (of said elements). A predicate is either valid, (all interpretations make the predicate true) satisfiable, or (an interpretation makes the predicate true) unsatisfiable. (no interpretations make the predicate true) There are two ways of binding a predicate's variables: one is to assign constant values to those variables, the other is to quantify over those variables (using universal or existential quantifiers). If all of a predicate's variables are bound, the resulting formula is a proposition. 6

7 Satisfiability and Validity In mathematical logic, satisfiability and validity are elementary concepts of semantics. A formula is satisfiable if it is possible to find an interpretation (model) that makes the formula true. some S are P A formula is valid if all interpretations make the formula true. every S is a P A formula is unsatisfiable if none of the interpretations make the formula true. no S are P A formula is invalid if some such interpretation makes the formula false. no S are P a theory is satisfiable if one of the interpretations makes each of the axioms of the theory true. a theory is valid if all of the interpretations make each of the axioms of the theory true. a theory is unsatisfiable if all of the interpretations make each of the axioms of the theory false. a theory is invalid if one of the interpretations makes each of the axioms of the theory false. These four concepts are related to each other in a manner exactly analogous to Aristotle's square of opposition. 7

8 Reduction of Validity to Unsatisfiability For classical logics, can reexpress the validity of a formula to satisfiability, because of the relationships between the concepts expressed in the square of opposition. In particular φ is valid if and only if φ is unsatisfiable, which is to say it is not true that φ is satisfiable. Put another way, φ is satisfiable if and only if φ is invalid. 8

9 Square of Opposition A categorical proposition is a simple proposition containing two terms, subject and predicate, in which the predicate is either asserted or denied of the subject. four logical forms. The 'A' proposition, the universal affirmative (universalis affirmativa), 'omne S est P', usually translated as 'every S is a P'. The 'E' proposition, the universal negative (universalis negativa), 'nullum S est P', usually translated as 'no S are P'. The 'I' proposition, the particular affirmative (particularis affirmativa), 'quoddam S est P', usually translated as 'some S are P'. The 'O' proposition, the particular negative (particularis negativa), Latin 'quoddam S non est P', usually translated as 'some S are not P'. 9

10 Material Conditional (1) a logical connective (or a binary operator) that is often symbolized by a forward arrow " " is used to form statements of the form "p q" (termed a conditional statement) which is read as "if p then q" and conventionally compared to the English construction "If...then...". But unlike as the English construction may, the conditional statement "p q" does not specify a causal relationship between p and q is to be understood to mean "if p is true, then q is also true" such that the statement "p q" is false only when p is true and q is false. antecedent p q consequent The material conditional is also to be distinguished from logical consequence. In classical logic p q is logically equivalent to (p q) and by De Morgan's Law to p q 10

11 Material Conditional (2) is to be understood to mean "if p is true, then q is also true" such that the statement "p q" is false only when p is true and q is false. the negative compound: not both p and not q. p q is false if and only if both p is true and q is false. p q is true if and only if either p is false or q is true (or both). The compound p q is logically equivalent also to p q (either not p, or q (or both)), and to q p (if not q then not p). But it is not equivalent to p q, which is equivalent to q p. In classical logic p q is logically equivalent to (p q) and by De Morgan's Law to p q p q p q T T T T F F F T T F F T q p p q p q T T T T F F F T T F F T antecedent consequent 11

12 Contradiction (falsum): represents an arbitrary contradiction (tee): denotes an arbitrary tautology (turnstile): "yields", "proves" ϕ a proposition is a contradiction iff In the classical logic, especially for a contradictory proposition ϕ propositional and it is true that first for all ( ) order logic ϕ ψ ψ ψ "from falsity, whatever you like" one may prove any proposition from a set of axioms which contains contradictions. principle of explosion (ex falso quodlibet) ϕ a proposition ϕ is a contradiction iff it is unsatisfiable In complete logic 12

13 Soundness An argument is sound if and only if The argument is valid. All of its premises are true. For instance, All men are mortal. Socrates is a man. Therefore, Socrates is mortal. The argument is valid (because the conclusion is true based on the premises, that is, that the conclusion follows the premises) and since the premises are in fact true, the argument is sound. The following argument is valid but not sound: All organisms with wings can fly. Penguins have wings. Therefore, penguins can fly. Since the first premise is actually false, the argument, though valid, is not sound. 13

14 Formal System A formal system is broadly defined as any well-defined system of abstract thought based on the model of mathematics. In mathematics, a theorem is a statement that has been proven on the basis of previously established statements, such as other theorems, and generally accepted statements, such as axioms. a tautology (from the Greek word ταυτολογία) is a formula which is true in every possible interpretation. 14

15 Tautology a tautology (from the Greek word ταυτολογία) is a formula which is true in every possible interpretation. 15

16 Complete Logic In logic, semantic completeness is the converse of soundness for formal systems. A formal system is "semantically complete" when all its tautologies are theorems A formal system is "sound" when all theorems are tautologies (that is, they are semantically valid formulas: formulas that are true under every interpretation of the language of the system that is consistent with the rules of the system). A formal system is consistent if for all formulas φ of the system, the formulas φ and φ (the negation of φ) are not both theorems of the system (that is, they cannot be both proved with the rules of the system). 16

17 Completeness and Soundness 17

18 Well Formed Formula 18

19 Rules (1) Every Prolog predicate : an atomic first-order logic formula (2) Commas separating subgoals : conjunctions in logic ( ^ ) (3) Prolog rules : implications (body, head) : (antecedent, consequent) ( ) and change the order of head and body (4) Queries : implications, (body, ) : (antecedent, consequent ) (5) Every variable : universally quantified head body is_bigger(x, Y) :- bigger(x, Y). x. y.(bigger(x, y) is_bigger(x, y)) antecedent consequent 19

20 Queries (1) Every Prolog predicate : an atomic first-order logic formula (2) Commas separating subgoals : conjunctions in logic ( ^ ) (3) Prolog rules : implications (body, head) : (antecedent, consequent) ( ) and change the order of head and body (4) Queries : implications, (body, ) : (antecedent, consequent ) (5) Every variable : universally quantified empty head body?- is_bigger(elephant, X), is_bigger(x, donkey). falsum : contradiction x.(is_bigger(elephant, x) ^ is_bigger(x, donkey) ) antecedent consequent 20

21 First Order Logic Formulas bigger(elephant, horse). bigger(horse, donkey). is_bigger(x, Y) :- bigger(x, Y). is_bigger(x, Y) :- bigger(x, Z), is_bigger(z, Y). { bigger(elephant, horse), bigger(horse, donkey), x. y.(bigger(x, y) is_bigger(x, y)), x. y. z.(bigger(x, z) ^ is_bigger(z, y) is_bigger(x, y)) } 21

22 Horn Formula (A 1 A 2 A n ) B (A 1 A 2 A n ) B A 1 A 2 A n B B A 1 A 2 A n A 1 A 2 A n 22

23 Prolog Query A A?- A A Putting the negation of the goal in a query into the set of formulas. Answering means showing that the set of formulas including the translated query is logically inconsistent. to show that A follows from P, show that adding the negation of A to P will lead to a contradiction. Adding the negation of A to P contradiction P, ( A ) iff P A the negation of A A follows from P 23

24 Resolution in the Propositional Logic A 1 A 2 B 1 B 1 B 2 A 1 A 2 T F B 2 A 1 A 2 F T B 2 A 1 A 2 B 2 B 2 (B 1 = T ) A 1 A 2 (B 1 = F) A 1 A 2 B 1 B 1 B 2 A 1 A 2 B 2 A 1 A 2 B 1 B 1 B 2 A 1 A 2 B 2 B1 :- A1, A2?- B1, B2?- A1, A2, B2?- B1, B2 Find a fact or a rule head that matches the first subgoal b1 B1 :- A1, A2?- A1, A2, B2 Replace the the subgoal with the body of the found rule repeated until there are no more subgoals left in the query. an empty disjunction 24

25 Resolution in the First Order Logic Propositional Logic : no variable First Order Logic : variable unification Unification : matching in Prolog the variable instantiations for successful queries 25

26 References [1] en.wikipedia.org [2] en.wiktionary.org [3] U. Endriss, Lecture Notes : Introduction to Prolog Programming [4] Learn Prolog Now! [5] [6] 26

27 27

Logic (3A) Young W. Lim 11/2/13

Logic (3A) Young W. Lim 11/2/13 Copyright (c) 2013. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software