Scribd
Upload
5 views11 pages

Group 5 Presentation-Propositional Logic

The document summarizes key concepts in propositional logic. It defines logic as the study of valid versus invalid statements and propositions as statements that are either true or false. There are two types of propositions: simple/primitive, which cannot be broken down further; and compound, which combine two simple statements using connectives like "and" or "or". Truth tables show all possible combinations of true and false values for simple statements to determine the truth value of compound statements. Symbols are used to represent propositions and connectives in logic.

Uploaded by

David Moyo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
5 views11 pages

Group 5 Presentation-Propositional Logic

The document summarizes key concepts in propositional logic. It defines logic as the study of valid versus invalid statements and propositions as statements that are either true or false. There are two types of propositions: simple/primitive, which cannot be broken down further; and compound, which combine two simple statements using connectives like "and" or "or". Truth tables show all possible combinations of true and false values for simple statements to determine the truth value of compound statements. Symbols are used to represent propositions and connectives in logic.

Uploaded by

David Moyo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 11

Group 5 Presentation

Propositional logic
Members:
Collen, Adrain, Chiedza, Sithembekile, Lizzy, Mondli, Prestige, Primrose,
Stanford, Ubettina, Lilian.
What is Mathematical Logic
• Logic is the study of rules and methods to separate a valid(true)
statement from an Invalid( false) statement.
• Logic is the study of truth and reasoning.
What is a Proposition
• A proposition is a statement that is either true or false but not both.
• There is no maybe or sort of in propositions.

• Examples
• 3 is odd
• 3 is even
• 7+5 =12
Types of propositions
• A simple or primitive proposition
• is a statement which cannot be broken down into anything simpler.
• A simple statement is denoted by use of letters p, q, r...
• Examples:
 p: There are seven days in a week
• p is a simple statement
 r: 3+ 2 = 6
• r is a simple statement
Types of propositions cont.’
• COMPOUND STATEMENT
• Are two simple statements combined together using connectives or logic operators.
• There are denoted by use of letters P, Q, R...
• Examples:
 P: There are seven days in a week and twelve months in a year.
 p: There are seven days in a week
 q: There twelve months in a year
 Operation: and
 Q: The grass is green or It is hot today
 q: The grass is green
 r: It is hot today
 Operation: or
 P: If it is not raining then I will go outside and eat my lunch.
 p: It is raining
 q: I will go outside
 r: I will eat my lunch
 Negation of p
 Operations: If… then, and
Logic operators/connectives
• Propositions are joined using connectives or operators.
Uses of symbols and statements

• Let p = “It is hot”, and q = “ It is sunny”


• SENTENCE SYMBOLIC FORM
• 1.It is not hot. ~p
• 2.It is hot and sunny. p q
• 3.It is hot or sunny. pq
• 4.It is not hot but sunny. ~ p q
• 5.It is neither hot nor sunny. ~p~q
Truth Tables
• Is a table showing when a more complicated proposition is true,
based on when each individual component of it is true.
• When determining the truth value of a compound statement all
possible combinations of the truth values of the statements comprising
it must be considered.
• These are denoted “T” and “F” respectively.
Truth table for Conjunction ()/ “and”:
• The statement “p and q” is only true if p is true and q is true.
• Therefore in the column for pq is true.
Truth table for Disjunction () /“or”
• The statement “p or q” is only true if p is true or q is true.
• If one of the statement is true, then the or statement is true.
Truth table for Negation, “not”
• “not” essentially changes the value from true to false, or false to true.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy