Module 5. Mathematical Logic Flashcards

1
Q

deals with the scientific method of judging the truth or falsity of statements

A

Logic

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

body of statements or mathematical sentences

A

Mathematics

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

important in understanding mathematics as a logical system

A

symbolic language

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

basis of all mathematic reasoning

A

logic

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

one of the first mathematicians to make a serious study of symbolic logic

A

Gottfried Wilhelm Leibniz (1646-1716)

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

Leibniz tried to advance the study of logic from a merely __ subject to a formal __ subject

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

Was Leibniz able to achieve the goal of advancing the study from merely a philosophical subject to a formal mathematical subject?

A

no

(HAHAHAHA taas kaayo question unya ani ra answer)

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

Several mathematicans who contributed to the advancement of symbolic logic as a mathematical discipline

A
  • Augustus De Morgan (1806-1871)
  • George Boole (1851-1864)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q
  • declarative sentence
  • either true or false
  • but not both true and false
A

statement/proposition

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

To determine whether a sentence is a statement, it may not be necessary to determine whether it is __

A

true

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

a statement is either true or false but not

A

both true and false

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

statement that conveys a single idea

A

simple statement

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

statement that conveys two or more ideas

A

compound statement

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

denial of a statement

A

negation

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

if p is any proposition, what is its negation symbol

A

~p (not p)

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

negation of a true statement

A

false

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

negation of a false statement

A

true

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

truth table for negation
p ~p
T
F

A

p ~p
T F
F T

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

some, all, and no (or none)

A

quantifiers

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

examples of quantifiers

A
  • some
  • all
  • no (or none)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

Negation of:
all p are q

A

some p are not q

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

Negation of:
some p are q

A

no p are q

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q
  • if p and q denotes to propositions
  • compound proposition “p and q”
A

conjunction of p and q

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

symbol of conjunction of p and q

A

p ∧ q

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
a conjunction is true only if
both p and q are true
26
truth table of conjunction of p and q p q p ∧ q T T T F F T F F
p q p ∧ q T T T T F F F T F F F F
27
- compound proposition - formed by joining of two or more propositions by the word "or"
disjunction
28
symbol for disjunction of p and q
p ∨ q
29
equivalent to "and/or"
inclusive sense
30
inclusive sense is equivalent to
and/or
31
equivalent to "either ... or" but not both
exclusive sense
32
exclusive sense is equivalent to
"either ... or" but not both
33
Logicians have agreed to use the inclusive "or" meaning
one or the other or both
34
truth table of disjunction of p and q p q p ∨ q T T T F F T F F
p q p ∨ q T T T T F T F T T F F F
35
proposition "if p, then q"
conditional/implication
36
symbol for conditional or implication of p and q
p => q
37
truth table for the conditional or implication p q p => q T T T F F T F F
p q p => q T T T T F F F T T F F T
38
if p, then q
conditional
39
conditional
if p, then q
40
- interchaning the antecedent p with consequent q - if q, then p
converse
41
converse
if q, then p
42
- negating the antecedent p and negating the consequent q - if ~p, then ~q
inverse
43
inverse
if ~p, then ~q
44
- negating both the antecedent p and the consequent q and interchanging them - if ~q, then ~p
contrapositive
45
contrapositive
if ~q, then ~p
46
truth table for converse p q q => p T T T F F T F F
p q q => p T T T T F T F T F F F T
47
truth table for inverse p q ~p => ~q T T T F F T F F
p q ~p => ~q T T T T F T F T F F F T
48
truth table for contrapositive p q ~q => ~p T T T F F T F F
p q ~q => ~p T T T T F F F T T F F T
49
statement of the form (p => q) ∧ (q => p)
biconditional
50
symbol for biconditional
p <=> q
51
how to read the symbol p <=> q
p if and only if q
52
abbreviation of "p if and only if q"
p iff q
53
biconditional means
two conditionals
54
a biconditional can also be expressed by using __ and __ terminology
- necessary - sufficient
55
"p is sufficient for q" can be rephrased as
if p then q
56
"p is necessary for q" can be rephrased as
if q then p
57
biconditional "p if and only if q" can also be phrased as
p is necessary and sufficient for q
58
biconditional combines a __ and its __ into one statement
- conditional - converse
59
truth table for biconditional p q p=>q q=>p q<=>p T T T T T F F T F T T F F F T T
p q p=>q q=>p q<=>p T T T T T T F F T F F T T F F F F T T T
60
words that connect simple statements and creates a compound statement
- and - or - if...then - if and only if
61
used symbols such as p, q, r, and s to represent statements and symbols ∧, ∨, ~, =>, <=> to represent connectives
George Boole
62
when someone makes a sequence of statements and draws some conclusion from them, he or she is presenting an __
argument
63
two components of arguments
1. initial statements (hypotheses) 2. final statement (conclucsion)
64
if the conclusion of the argument is guaranteed under its given set of hypotheses
valid
65
consists of a set of statements called premises and another statement called the conclusion
argument
66
set of statements in an argument
premises
67
another statement in an argument
conclusion
68
an argument is __ if the conclusion is true whenever all the premises are assumed to be true
valid
69
an argument is __ if it not a valid argument
invalid
70
Two Argument Types
1. inductive argument 2. deductive argument
71
uses a collection of specific examples as its premises and uses them to propose a general conclusion
inductive argument
72
inductive argument
from specific to general
73
uses a collection of general statements as its premises and uses them to propose a specific situation as the conclusion
deductive argument
74
deductive argument
from general to specific
75
it is customary to place a __ __ between the premises and the conclusion
horizontal line
76
inductive or deductive Premises: I ate candy last week and I had toothache. I ate candy yesterday and I had toothache. I ate candy today, and I had toothache. ------------------------------------------------------ Conclusion: Therefore, eating candy gives me toothache.
inductive
77
inductive or deductive Premises: all cats are mammals. a tiger is a cat. ------------------------------- Conclusion: A tiger is a mammal.
deductive
78
inductive or deductive Premises: all doctors are men. my mother is a doctor. --------------------------------- Conclusion: Therefore, my mother is a man.
deductive
79
Truth table procedure to determine validity of argument
1. write the argument in symbolic form. 2. construct truth table that shows truth value of each premise and truth value of conclusion for all combinations of truth values of simple statements. 3. if conclusion is true in every row of truth table in which all the premises are true, the argument is valid. if the conclusion is false in any row in which all of the premises are true, the argument is valid.
80
diagram consisting of various overlapping figures contained within a rectangle
Venn diagram
81
rectangle of a Venn diagram is called
universe
82
depict form of "all A are B" or "if A, then B"
two circles, one inside the other - inner circle = A - outer circle = B
83
saying that an argument is valid does not mean that the conclusion is __
true
84
Standard forms of Four Valid Arguments
1. direct reasoning 2. contrapositive reasoning 3. transitive reasoning 4. disjunctive reasoning
85
direct reasoning symbol
p => q p --------- ∴ q
86
contrapositive reasoning symbol
p => q ~q --------- ∴ ~p
87
transitive reasoning symbol
p => q q => r --------- ∴ p => r
88
disjunctive reasoning symbol
p V q ~p ------- ∴ q or p V q ~q ------- ∴ p
89
Determine valid conclusion: if julia is a lawyer, then she will be able to help us. julia is not able to help us. ------------------------------- ∴
Julia is not a lawyer.
90
Determine valid conclusion: if they had a good time, they will return. if they return, we will make more money. ---------------------------------- ∴
If they had a good time, we will make more money.
91
Determine valid conclusion: if you can dream it, you can do it. you can dream it. -------------------------- ∴
you can do it
92
Determine valid conclusion: i bought a car or i bought a motorcycle. i did not buy a car. ------------------------- ∴
I bought a motorcycle.
93
Standard Forms of Two Invalid Arguments
1. Fallacy of the converse 2. Fallacy of the inverse
94
Fallacy of the converse or
Fallacy of affirming the conclusion
95
Fallacy of the inverse or
Fallacy of denying the hypothesis
96
Fallacy of the converse symbol
p => q q ------- ∴ p
97
Fallacy of the inverse symbol
p => ~p ------- ∴ ~q