0 Up votes0 Down votes

264 views25 pagesslide show

Feb 28, 2013

© Attribution Non-Commercial (BY-NC)

PPTX, PDF, TXT or read online from Scribd

slide show

Attribution Non-Commercial (BY-NC)

264 views

slide show

Attribution Non-Commercial (BY-NC)

- Raymond Smullyan, Diagonalization and Self-Reference
- yes.docx
- 1 Propositional Logic
- Week 3
- ideas thru reasoning.pdf
- Vilfredo Pareto Mind and Society part 3 Theory of Derivations
- symbolic_logic8.pdf
- 19_evenmorelogic.pdf
- Set Theory Exercise 3
- Affidavit of Ma. Adelfa Ayupan y Aceso
- Mathematical Symbols
- part_2 (8)
- HUMA1000-L3_lecture+5_Week+6
- Toward a Modal Logical Treatment of Quantum Physics
- joint-affidavit-of-two-disinterested-persons-magno.docx
- Autodesk Navisworks Training Course _ ETC Lebanon
- ieee paper1
- Tut6
- Relation
- Logic

You are on page 1of 25

[Exclusive Or] [disjunction(or)] [conjunction(and)] [not] [ifthen] [if and only if]

Proposition Sentence that declare fact either true or false but not both. Examples: / 1. F and S are alphabet. 2. They are beautiful. x (is not proposition because is not declarative) 3. 2 + 1 = 10 / 4. x + y = 6 x (is not proposition because it is neither true or false)

Truth Table

-display relationship between truth values of propositions Types of truth tables: 1. the Negation of a Proposition. 2. Conjunction of Two Propositions. 3. Disjunction of Two Propositions. 4. Exclusive Or of Two Propositions. 5. Conditional Statement p q. 6. Biconditional p q. 7. The Truth Table of (p q) (p q). 8. Precedence of Logical Operators.

p T F

p F T

T T F F

T F T F

T T T F

p T T F F q T F T F p F T T F q

1

2 3 4 5

Tautology : a compound proposition that is always true no matter what the truth values of the propositional occurs in it. Example: pp Contradiction : a compound proposition that is always false. Example: pp Contingency : a compound proposition that is neither a tautology nor a contradiction.

pp

pp

T

F

F

T

T

T

F

F

Compound

propositions that have the same truth values in all possible cases Example: p q = -p -q

a) b)

If it rains then, I stay at home If I dont stay at home, then it thus not rain

predicate or propositional function is a description of the property (or properties) a variable or subject may have. A proposition may be created from a propositional function by either assigning a value to the variable or by quantification.

In

general, the set of all x in the universe of discourse having the atribute P(x) is called the truth set of P(x). That is, the truth set of P(x) is : { x U |P(x) }

where

the truth value can be whether true or false... See more at: http://weartificialintelligence.blogspot.com /#sthash.DyhdBMPq.dpuf

Suppose P(x) is the predicate x + 2 = 2x, and the universe of discourse for x is the set f1;2;3g. Then... xP(x) is the proposition For every x in {1,2,3} x + 2 = 2x." This proposition is false. xP(x) is the proposition There exists x in {1,2,3} such that x + 2 = 2x. This proposition is true.

Example 1 : The propositional function P(x) is given by "x > 0". The universe of discourse for x is the set of integers.To create a proposition from P, we may assign a value for x. For example, setting x = -3, we get P(-3): "-3 > 0", which is false. setting x = 2, we get P(2): "2 > 0", which is true.

Example 2 :

Suppose P(x) is the predicate x has fur ". The universe of discourse for x is the set of all animals.

Example 3 : There also involve 2 or more variable. consider "x = y + 3" and we can denote it as Q(x , y). Q is a predicate and the question is what is the truth value for Q(1,2) and Q(3,0) ?

Answer

for Q(1,2),set x = 1 and y = 2 and substitute into "x = y + 3",which u get false. Same as Q(3,0),which u get true. Answer must be shown in table.

quantifier turns a propositional function into a proposition without assigning specific values for the variable. There are primarily two quantifiers:

The

universal quantification of P(x) is the proposition P(x) is true for all values x in the universe of discourse. : "For all x P(x)" or "For every x P(x)" is written xP(x).

Notation

example 1 :

Let

P(x) be the statement x+1>x. What is the truth value of the Quantification xP(x) where the universe of discourse consist of all real numbers ? : Since P(x) is true for all real numbers x, the quantification xP(x) is true.

x 1 x+1>x 2>1 x P(x) true

solution

2 3

3>2 4>3

True true

example 2 :

What

is the truth value of x P(x), where P(x) is the statement "x < 10" and the universe discourse consist of the positive integers not exceed 4 ?

Solution:

the statement x P(x) is the same as the conjunction P(1) ^ P(2) ^ P(3) ^ P(4), since the universe discourse consist of the integers 1,2,3 n 4. Since P(4) which the statements "4 < 10 " is false, it follows that x P(x) is false.

The

existential quantification of P(x) is the proposition "There exists an element x in the universe of discourse such that P(x) is true."

"There exists x such that P(x)" or "There is at least one x such that P(x)" is written x P(x).

Notation:

Example 1 :

Let P(x) denote the statement "x >3" What is the truth value of the quantification xP(x), where the universe discourse consist of all real numbers ? solution : Since "x>3" is true--for instance , when x = 4--the existancial qualification of P(x),which is xP(x) is true.

x 1 2 4

Example What

2:

is the truth value of xP(x), where P(x) is the statement "x > 10" and the universe discourse consist of the positive integers not exceed 4 ?

Solution:

Since

the universe of discourse is {1,2,3,4}, the proposition xP(x) is the same as the disjunction P(1) v P(2) v P(3) v P(4), Since P(4) which the statements "4 > 10 " is true, it follows that xP(x) is true.

TABLE 1 QUANTIFIERS

Statement When True ? When False ?

x P(x)

x P(x)

Hard

The ease of quantification is one of the features used to distinguish hard and soft sciences from each other. sciences

Social

- Raymond Smullyan, Diagonalization and Self-ReferenceUploaded byBrent Cullen
- yes.docxUploaded byKent Emmanuel C. Soria
- 1 Propositional LogicUploaded byedsheeran2317
- Week 3Uploaded byMuhammad Fadzreen
- ideas thru reasoning.pdfUploaded byraja89
- Vilfredo Pareto Mind and Society part 3 Theory of DerivationsUploaded bykabud
- symbolic_logic8.pdfUploaded byジー デイ
- 19_evenmorelogic.pdfUploaded byhardadi nur aziz
- Set Theory Exercise 3Uploaded byNoreen Patayan
- Affidavit of Ma. Adelfa Ayupan y AcesoUploaded bySara Pcr
- Mathematical SymbolsUploaded byflaviofs1888
- part_2 (8)Uploaded bySheehan Hanrahan
- HUMA1000-L3_lecture+5_Week+6Uploaded byJames Jackson
- Toward a Modal Logical Treatment of Quantum PhysicsUploaded byRobert McAlmon
- joint-affidavit-of-two-disinterested-persons-magno.docxUploaded byMichael AS
- Autodesk Navisworks Training Course _ ETC LebanonUploaded bysomjitsahani
- ieee paper1Uploaded byapi-265518344
- Tut6Uploaded byiamme22021990
- RelationUploaded byjprgg24
- LogicUploaded byPablo Perez
- Basic Understanding of LogicUploaded byคัมจันทะนูศร
- A Blighting CurseUploaded byxenocid3r
- Car Nap on Inductive LogicUploaded byomertave
- Lexical Semantics Klp 8Uploaded byPutri Suryani
- Branches of PhiloUploaded byafiqahauntiecu
- mfcs notes 1Uploaded bypraveennallavelly
- Nirshan.phlUploaded byPallaviSinha
- History of Logic 1Uploaded byMennatallah M.Salah El Din
- Critical Thinking and Legal CultureUploaded byElle
- productFlyer_978-3-540-62927-6Uploaded byMateus Oliveira Cabral

- CdcUploaded byNishaan Nishaan
- UntitledUploaded byRevathy Jayabaskar
- Syllogistic UnityUploaded byArmahedi Mahzar
- 07 Rules of InferenceUploaded bySawant_Ashish_609
- 20121129 Quiz 9b SolutionsUploaded byPaul Jones
- Compiler QuestionsUploaded byEugene Charles
- Chapter-3.pdfUploaded byKarla Mae
- AI Presentation HAW - Logical Programming and ResolutionUploaded byhtotisum
- fUploaded byAnonymous 8ishCm7R
- String in JavaUploaded byTapan Chowdhury
- Rules_of_Logical_Inference.pdfUploaded bySushil Timilsina
- FlatUploaded byPrathyusha Lakshmi
- Automata Theory TutorialUploaded byHeena Jain
- J. Myhill - ParadoxesUploaded byDawa Ajr
- Clean Code - Part 1, ArgumentsUploaded byMarek Hudik
- lec02-parserCFG[1]Uploaded bykarthi_gopal
- lecture 21-25 (1)Uploaded bydv
- 06_AI_Lecture_on_Knowledge_Representation_TechniquesUploaded bysumit245
- TOC MCQUploaded bySurya Kameswari
- TCS_CFG_L1Uploaded byHitarth Dadhania
- Zae 02005Uploaded byBalakrishna Vegi
- Lexical Part 1Uploaded byalenasamuel
- Bulti CollectionUploaded bydipshi92
- Tamil VenpaUploaded byDinesh Ramoo
- The Transfinite Universe by Hugh WoodinUploaded bybnkhudson
- cd QUploaded byShikha Arya
- Yacc TutorialUploaded byravikiran_sunshine
- CS154 MidtermUploaded byAzmat Naseem
- Closure Properties of Context Free Languages(proof).docxUploaded byNehal Gupta
- CS107-05 Pumping Lemma for RLs(1)Uploaded byRom Sto Domingo

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.