Final Exam Flashcards
Truth value
whether statement actually true/false
Truth function logic: complete
proves all valid arguments
Truth functional logic: soundness
only proves valid arguments
Valid
not possible to have all true premises and false conclusion
Counterargument
all true premises, false conclusion
Tautologically
true, can’t be false
self-contradiction
logically false, can’t be true
Inductive strength
likelihood conclusion true based on strength of argument
Truth functional compound sentence
truth value determined by value of simple sentences
Truth table for biconditional arrow
TT/FF are Truth (same = true, otherwise false)
Truth table for single arrow —>
T –> F is false
if x then y
X –> Y
x only if y
X –> Y
X if Y
Y –> X
X is necessary for Y
Y –> X
X is sufficient for Y
X –> Y
X unless Y
hook Y –> X
X if not Y
hook Y –> X
TVA
value for each letter “s”
Open wff
at least 1 free variable not bound to quantifier
Closed wff
no free variables not bound to quantifier
Truth functionally false
all F’s on Truth table
Truth functional true
all T’s on truth table
Some F/some T on truth table
truth functionally contingent
T-F satisfiable
at least 1 truth tva
contingent/TFT
T-F falsifiable
at least 1 F tva
contingent or TFF
Can valid argument have false conclusion?
Yes
T-F consistent
1 tva where all members true (1 row)
T-F equivalent
no tva where truth values differ
Sound argument
valid, and all true premises
Can anything be consistent and contradictory?
No!
Can it be equivalent but inconsistent?
Yes, if all false
T-F valid
no tva all premises true and conclusion false
inconsistent premises
at least 1 false premise
T-F contradictory
always differ in tva assignment
All compound sentences in TRUTH FUNCTIONAL LOGIC are…
truth functional compound sentences
if something is a model for a set of sentences…
all of the sentences in set are true on that TVA
Use contradiction rule: how?
Assumption that is the opposite of contraction
Show two other things contradict
then do hook I to introduce, hook E to eliminate
vE rule: how do you do it?
Take each side of the “or” as assumptions and show that they both reach conclusion.
Biconditional arrow introduction
show both sides lead to the other
Something
and symbol
Everything
Arrow symbol
Names
lowercase a, b, c … u
Predicates
Capital letters
variables
lowercase v, w, x, y, z
Quantifiers
backwards E and upside down A