Logic Flashcards

1
Q

Argument

A

An ARGUMENT is any collection of premises together with a conclusion

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

Validity

A

An argument is VALID if and only if it is impossible for all of its premises to be true and the conclusion false

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

Soundness

A

An argument is SOUND if and only if it is both valid and all of its premises are true

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

Jointly Consistent

A

Sentences are JOINTLY CONSISTENT if and only if it is possible for them all to be true together

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

Jointly Inconsistent

A

Sentences are JOINTLY INCOSISTENT if and only if it is not possible for them all to be true together

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

Necessary Truth

A

A sentence is a NECESSARY TRUTH if and only if it is true and it is not possible for it to be false

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

Necessary Falsehood

A

A sentence is a NECESSARY FALSEHOOD if and only if it is false and not possible for it to be true

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

Contingent

A

A sentence is CONTINGENT* if and only if* it is possible for it to be true and possible for it to be false

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

Symbolization Key (TFL)

A

A SYMBOLIZATION KEY specifies which atomic sentence each letter represents in the relevant case

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

Expression of TFL

A

An EXPRESSION OF TFL is any string of symbols in TFL

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

CONNECTIVES, also known as logical operators, are symbols used to combine simple statements into more complex ones

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

Negation (¬)

A

Flips the truth value of a statement

Example: ¬P means “It is not the case that P”

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

Conjunction (∧)

A

True only when both conjuncts are true

Example: P ∧ Q means “P and Q”

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

Disjunction (∨)

A

True when at least one disjunct is true

Example: P ∨ Q means “P or Q” (inclusive or)

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

Conditional (→)

A

False only when the antecedent is true and the consequent false

Example: P → Q means “If P, then Q”

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

Biconditional (↔)

A

True when both components have the same truth value

Example: P ↔ Q means “P if and only if Q”

17
Q

Main Logical Operator

A

The MAIN LOGICAL OPERATOR in a formula is the operator that was introduced last when that formula was constructed using the recursive rules

18
Q

Scope of a Connective (TFL)

A

The SCOPE of a connective (in a sentence) is the subsentence for which that connective is the main logical operator

19
Q

Truth-Functional Connective

A

A connective is TRUTH-FUNCTIONAL if and only if the truth value of a sentence featuring that connective as its main logical operator is uniquely determined by the truth value(s) of the constituent sentence(s)

20
Q

Valutation

A

A VALUATION is any assignment of truth values to particular atomic sentences of TFL

21
Q

Complete Truth Table

A

A COMPLETE TRUTH TABLE has a line for every possible assignment of True and False to the relevant atomic sentences

Each line represents a valuation, and a complete truth table has a line for all possible different valuations

22
Q

Tautology

A

𝒜 is a TAUTOLOGY if and only if it is true on every valuation

23
Q

Contradiction

A

𝒜 is a CONTRADICTION if and only if it is false on every valuation

24
Q

Tautologically Equivalent

A

𝒜 and 𝐵 are TAUTOLOGICALLY EQUIVALENT if and only if they have the same truth value on every valuation

25
Q

Jointly Tautologically Consistent

A

𝒜1, 𝒜2, … 𝒜ₙ are JOINTLY TAUTOLOGOCALLY CONSISTENT if and only if there is some valuation that makes them all true

26
Q

Jointly Tautologically Inconsistent

A

𝒜1, 𝒜2, … 𝒜ₙ are JOINTLY TAUTOLOGOCALLY INCONSISTENT if and only if there is no valuation that makes them all true

27
Q

Tautologically Entail

A

The sentences 𝒜1, 𝒜2, … 𝒜ₙ TAUTOLOGOCALLY ENTAIL the sentence 𝒞 if there is no valuation of the atomic sentences which makes all of 𝒜1, 𝒜2, … 𝒜ₙ true and 𝒞 false

If 𝒜1, 𝒜2, … 𝒜ₙ tautologically entail 𝒞 , then 𝒜1, 𝒜2, … 𝒜ₙ , ∴ 𝒞 is valid

28
Q

Vacuously True

A

When F is an empty predicate, every sentence of the form Ɐx(Fx → …) will be VACUOUSLY TRUE

29
Q

Expression of FOL

A

An EXPRESSION of FOL is any string of symbols of FOL

30
Q

Term

A

A TERM is any name or variable

31
Q

Scope

A

The SCOPE of a logical operator in a formula is the sub-formula for which that operator is the main logical operator

32
Q

Bound Variable

A

A BOUND VARIABLE is an occurrence of a variable x that is within the scope of either Ɐx or ∃x

33
Q

Free Variable

A

A FREE VARIABLE is any variable that is not bound

34
Q

Sentence of FOL

A

A SENTENCE of FOL is any formula of FOL that contains no free variables

35
Q

Interpretation

A

An INTERPRETATION consists of three things:
1. The specification of a domain
2. An assignment of exactly one object within the domain for each name that we care to consider
3. For each predicate (except ‘=‘) that we are considering, a specification of what things (in what order) the predicate is to be true of