Logic Slides Flashcards

1
Q

Formal Logic

A
  • Formal System of rules for how we should prove or disprove things
  • Can be used to represent the statments that we use in English to communicate facts or information
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Statements

A

A sentence that is true or false NOT both

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

Truth Value

A

True = T(1)
False n= F(0)

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

Compound Statements

A

Statement made of more than one simple statement
- Usually use some kind of logical connectives

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

Components of Compound Statements

A
  • Statement Variables : A, B, C
  • Logical Connectives: ∨, ∧, →, ↔, ¬
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Conjuction

A

∧ (AND)
A ∧ B : “A and B”

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

Disjuction

A

OR
A ∨ B: “A or B”

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

Negation

A

¬ NOT
¬ A : “Not A”

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

Implication

A

→ IF
A → B : “If A then B” or “A implies B”
A : Hypothesis
B : Conclusion

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

Equivalence

A

↔ If and only if
A ↔ B : “A if and only if B”

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

Well formed formulas (WFF)

A

Combined variables, connectives, and parentheses make an expression that is meaningful.

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

Order of Precedence

A
  1. Connectives parentheses, innermost parenthese first
  2. Negation
  3. Conjuction, disjunction
  4. Implication
  5. Equivalence
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Number of Rows in a Truth Table

A

2^n

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

Tautology

A

A wff that is intrinsically true, no matter what statements comprise the wff

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

Contradictions

A

A wff that is intrisically false, no matter what the truth statements that compromise the wff

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

Propostions

A

Also known as statements.

17
Q

Logical Equivalences

A

Two statements forms are logically equivalent if and only if they have identical truth values for each possible substitution of statements for their statement variables.
Denotes 𝑃 ≡ 𝑄
- Used to simplify statements