Exam 1 Material Flashcards

1
Q

What is a tautology?

A

A formula that outputs true on every truth-assignment (input).

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

What is a contradictory?

A

A formula that outputs false on every truth assignment (input).

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

What is a contingent formula?

A

A formula that outputs true for some truth assignments (inputs) and false for others.

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

A satisfiable formula (sat) is…

A

A formula for which there exists a truth-assignment that makes the formula’s output true.

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

p -> q is a “guarded” or “triggered” two-step proposition because…

A

We only concern ourselves about q (second step) if the guard/trigger, p (first step) is true.

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

The precedence order for the 4 basic logical connectives is (from highest to lowest):

A

~ (NOT)
^ (AND)
v (OR)
–> (IMPLIES)

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

The associativity of the AND (^) connector means that its always combines to the…

A

Left

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

The associativity of the OR( (v) connector means that it always combines to the…

A

Left

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

The associativity of the IMPLIES (–>) connector means that it always combines to the…

A

Right

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

Linear temporal logic:

A

Supports reasoning about event sequencing

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

Propositional logic:

A

Supports reasoning about propositions (statements that are true or false) and about valid ways of drawing conclusions from premises

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

A (valid) argument consists of sentences (claims) chained together in such a way that the truth of each sentence…

A
  1. Is assumed (i.e., the sentence is a premise) or…

2. Follows from the truth of the previous sentences (via inference or deduction).

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

In a valid argument, if all of the premises are true, then…

A

…the conclusions must be true.

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

Act of inference:

A

Attempting to establish the truth of the conclusions from the truth of the premise.

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

Valid inference:

A

The “transmission of truth” such that in every situation where all the premises P are true, the conclusion Q is also true.

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

Syllogism:

A

Consists of exactly 2 premises and a conclusion, whose validity is determined by the underlying structure of the argument.

17
Q

Negation (~) can be recognized in an English sentence by…

A

the presence of the word “not” or morphemes like “un-“ or “ir-“.

18
Q

Conjunction (^) can be recognized in an English sentence by…

A

the presence of the words “and” or “both”.

19
Q

An exclusive OR (disjunction)…

A

Capture two events that cannot occur simultaneously (either/or). Can be represented as (p V q) ^ ~(p ^ q)

20
Q

An inclusive OR (disjunction)…

A

Captures two events that can occur simultaneously or alone (either… or both).

21
Q

Implication (–>) is used to capture…

A

Conditionality.

22
Q

Implication (–>) can be recognized in an English sentence by words such as…

A
If…then...,
… provided that,
 assuming,
 only if...,
 given…
23
Q

A fact C is said to be “known” by person P if…

A
  • C is true, and…
    • P believes C to be true, and…
      • P has some sort of justification that C is true (C is not something that P arrived at by a guess or chance.)
24
Q

Deduction:

A

The synthesis of new facts (consequences) from known facts via truth-preserving inferences.

25
Q

^i

AND Introduction Rule

A
Provided that there are proofs for P and Q, then one can conclude that P^Q is true.

^i :      P Q
     ------------
    P ^ Q
26
Q

^e1

AND Elimination Rule 1

A

A rule to eliminate the RIGHT operand Q, leaving P:

^e1 : P ^ Q
——–
P

27
Q

^e2

AND Elimination Rule 2

A

A rule to eliminate the LEFT operand P, leaving Q:

^e2: P ^ Q
——–
Q