Scribd
Upload
17 views

Philosophy 11b

Propositional logic deals with relationships between simple statements and compounds of statements. It represents statements with letters and uses operators like conjunction, disjunction, conditional, biconditional, and negation. Well-formed formulas in propositional logic must contain a syntactically correct arrangement of symbols and have a computable truth value. The validity of arguments can be checked using truth tables, falsification methods, or truth trees. Rules of replacement and substitution like De Morgan's theorems and material implication equivalences can transform formulas into logically equivalent forms.

Uploaded by

chloe manzano
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
17 views

Philosophy 11b

Propositional logic deals with relationships between simple statements and compounds of statements. It represents statements with letters and uses operators like conjunction, disjunction, conditional, biconditional, and negation. Well-formed formulas in propositional logic must contain a syntactically correct arrangement of symbols and have a computable truth value. The validity of arguments can be checked using truth tables, falsification methods, or truth trees. Rules of replacement and substitution like De Morgan's theorems and material implication equivalences can transform formulas into logically equivalent forms.

Uploaded by

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

PROPOSITIONAL LOGIC

§ Also called Setential Logic


§ Functional units are whole statements or propositions
§ Simple statements are represented by capital or small letters
§ Simple statements are combined with operators to form compound statements
§ Deals with the relationships holding between simple propositions or statements and
their compounds
§ Basic logical terms: not, or, if then
Basic Symbols
1. Conjunction (•)
Þ Conjoin together 2 statements
Þ And, both, but, yet, however, moreover, nevertheless, still, also, additionally,
furthermore, both not, not both
Þ Both not: ~A • ~B
Þ Not both: ~(A•B)
P Q P•Q
T T T
T F F
F T F
F F F
2. Disjunction (v)
Þ Disjoin 2 statements from each other
Þ Or, either, unless
Þ Types: exclusive or inclusive
Þ Neither nor: ~(AvB)
P Q PvQ
T T T
T F T
F T T
F F F

3. Conditional (Þ)
Þ Asserts a relationship between statements
Þ 2 parts: antecedent (if, profasis, implicans), consequent (then, apodosis, implicatum)
Þ If then, only if, given that, is sufficient for, is necessary for, unless, implies, on the
condition that
Þ A is sufficient for B: AÞB
Þ A is necessary for B: BÞA
Þ Only if: AÞB
P Q PÞQ
T T T
T F F
F T T
F F T
4. Biconditional (º)
Þ Asserts equivalence between statements
Þ If and only if, is equivalent to, just if, precisely if, just in case, when and only when,
is both sufficient and necessary for
P Q PºQ
T T T
T F F
F T F
F F T
5. Negation (~)
Þ
Þ Negates the truth value of the proposition
Þ Not, it is false that, it is not true that, it is not the case that
P ~P
T F
F T
Techniques:
1. Encircle operators
2. Symbolize the operators in the paragraph
3. Replace statements with symbols

PROPERTIES OF WFFs
Well-Formed Formulas
§ Different statement forms
§ Contains a syntactically current arrangement of symbols
§ Has a computable truth value
§ Accepted in the language of logical notion
To create a WFF:
1. Represent sentence by a capital letter
2. Represent truth-functional operators
3. Indicate grouping when necessary
§ 2n = # of rows in the table
n: # of unique statements (letters)
§ # of rows in the table ÷ 2 = how to write T and F on the table/number of alternations
4÷2=2 Þ T T F F
2÷2=1 Þ T F T F
Tautologous
§ All values under the main operator are T
P Þ [(P Þ Q) Þ Q]
T T T T T T T
T T T F F T F
F T F T T T T
F T F T F F F
Contradictory
§ All values under the main operator are F
(P • Q) • (P Þ ~ Q)
T T T F T F F T
T F F F T T T F
F F T F F T F T
F F F F F T T F
Contingent
§ Values under the main operator vary (T/F)
[P Þ (P Þ Q)] Þ Q
T T T T T T T
T F T F F T F
F T F T T T T
F T F T F F F
Equivalence
§ Same values in both statements
§ All values and same place
P Þ Q º ~ P v Q
T T T ✓ F T T T
T F F ✓ F T F F
F T T ✓ T F T T
F T F ✓ T F T F

METHODS OF CHECKING VALIDITY


§ Valid if tautologous, not falsifiable, and all closed branches
§ Invalid if contradictory, contingent, falsifiable, and has an open branch
Truth Table Method
§ C – count
A – assign
S – show tables
E – evaluate (valid/invalid)
Falsification Method
§ O – operators
L – letters
A – assess (contingent/contradictory)
F – falsifiable or not
§ Deliberately assign T to premise and F to conclusion
§ If more than 2 premises, assign T to conjunction operator because it holds the truth
value
Truth Tree Method
Steps:
1. Stack premises and negate conclusion
2. Use stacking rules (close branch if there is a contradiction)
3. Use branching rules (close branch if there is a contradiction)
4. If there is an open branch, argument is invalid
Pertinent Rules of Replacement/Substitution:
o Double Negation
Þ ~~P º P
o De Morgan’s Theorem
Þ ~(P•Q) º (~P v ~Q)
Þ ~(PvQ) º (~P • ~Q)
o Material Implication
Þ (PÞQ) º (~P v Q)
Þ (PvQ) º (~P Þ Q)
o Material Equivalence
Þ (PºQ) º (P•Q) • (~P•~Q)
Þ (PºQ) º (PÞQ) • (QÞP)

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