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
Q

T-F satisfiable

A

at least 1 truth tva

contingent/TFT

26
Q

T-F falsifiable

A

at least 1 F tva

contingent or TFF

27
Q

Can valid argument have false conclusion?

A

Yes

28
Q

T-F consistent

A

1 tva where all members true (1 row)

29
Q

T-F equivalent

A

no tva where truth values differ

30
Q

Sound argument

A

valid, and all true premises

31
Q

Can anything be consistent and contradictory?

A

No!

32
Q

Can it be equivalent but inconsistent?

A

Yes, if all false

33
Q

T-F valid

A

no tva all premises true and conclusion false

34
Q

inconsistent premises

A

at least 1 false premise

35
Q

T-F contradictory

A

always differ in tva assignment

36
Q

All compound sentences in TRUTH FUNCTIONAL LOGIC are…

A

truth functional compound sentences

37
Q

if something is a model for a set of sentences…

A

all of the sentences in set are true on that TVA

38
Q

Use contradiction rule: how?

A

Assumption that is the opposite of contraction
Show two other things contradict

then do hook I to introduce, hook E to eliminate

39
Q

vE rule: how do you do it?

A

Take each side of the “or” as assumptions and show that they both reach conclusion.

40
Q

Biconditional arrow introduction

A

show both sides lead to the other

41
Q

Something

A

and symbol

42
Q

Everything

A

Arrow symbol

43
Q

Names

A

lowercase a, b, c … u

44
Q

Predicates

A

Capital letters

45
Q

variables

A

lowercase v, w, x, y, z

46
Q

Quantifiers

A

backwards E and upside down A