Final Exam Flashcards

1
Q

Truth value

A

whether statement actually true/false

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Truth function logic: complete

A

proves all valid arguments

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Truth functional logic: soundness

A

only proves valid arguments

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Valid

A

not possible to have all true premises and false conclusion

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Counterargument

A

all true premises, false conclusion

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Tautologically

A

true, can’t be false

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

self-contradiction

A

logically false, can’t be true

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Inductive strength

A

likelihood conclusion true based on strength of argument

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Truth functional compound sentence

A

truth value determined by value of simple sentences

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Truth table for biconditional arrow

A

TT/FF are Truth (same = true, otherwise false)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Truth table for single arrow —>

A

T –> F is false

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

if x then y

A

X –> Y

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

x only if y

A

X –> Y

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

X if Y

A

Y –> X

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

X is necessary for Y

A

Y –> X

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

X is sufficient for Y

A

X –> Y

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

X unless Y

A

hook Y –> X

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

X if not Y

A

hook Y –> X

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

TVA

A

value for each letter “s”

20
Q

Open wff

A

at least 1 free variable not bound to quantifier

21
Q

Closed wff

A

no free variables not bound to quantifier

22
Q

Truth functionally false

A

all F’s on Truth table

23
Q

Truth functional true

A

all T’s on truth table

24
Q

Some F/some T on truth table

A

truth functionally contingent

25
T-F satisfiable
at least 1 truth tva | contingent/TFT
26
T-F falsifiable
at least 1 F tva | contingent or TFF
27
Can valid argument have false conclusion?
Yes
28
T-F consistent
1 tva where all members true (1 row)
29
T-F equivalent
no tva where truth values differ
30
Sound argument
valid, and all true premises
31
Can anything be consistent and contradictory?
No!
32
Can it be equivalent but inconsistent?
Yes, if all false
33
T-F valid
no tva all premises true and conclusion false
34
inconsistent premises
at least 1 false premise
35
T-F contradictory
always differ in tva assignment
36
All compound sentences in TRUTH FUNCTIONAL LOGIC are...
truth functional compound sentences
37
if something is a model for a set of sentences...
all of the sentences in set are true on that TVA
38
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
39
vE rule: how do you do it?
Take each side of the "or" as assumptions and show that they both reach conclusion.
40
Biconditional arrow introduction
show both sides lead to the other
41
Something
and symbol
42
Everything
Arrow symbol
43
Names
lowercase a, b, c … u
44
Predicates
Capital letters
45
variables
lowercase v, w, x, y, z
46
Quantifiers
backwards E and upside down A