Logic Flashcards

(55 cards)

1
Q

Study of Reasoning

A

LOGIC

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

Sentences or expressions that are not arbitrary but are the ones that are either true or false, but not both

A

PROPOSITIONS

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

Mathematical model that allows us to reason about truth and falsehood of logical expressions

A

PROPOSITIONAL LOGIC

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

Area of logic that deals with proposition. Developed by Greek philosopher, Aristotle

A

PROPOSITIONAL CALCULUS

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

The methods of producing new propositions from existing ones were discussed by English Mathematician ___________ in his book _________

A

GEORGE BOOLE, THE LAWS OF THOUGHT

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

Letters are used to denote ________ variables

A

PROPOSITIONAL VARIABLE

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

Are used to build complex or compound propositions from simpler ones

A

LOGICAL CONNECTIVES OR OPERATORS

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

A logical operator is that is applies to only a single proposition

A

UNARY

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

A logical operator that is applies to two propositions

A

BINARY

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

Give an example of unary operator

A

NEGATIION

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

A unary logical connective that takes the proposition p to another proposition which means not p

A

NEGATION OPERATOR

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

“It is not the case of P”

A

NEGATION OPERATOR

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

A binary logical connective that when applied to two propositions p and q, will yield “p and q”

A

CONJUNCTION

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

A binary logical connective that when a applied, will yield ‘p or q’

A

Disjunction

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

the disjunction pVq is the proposition that is true when EITHER P IS TRUE, Q IS TRUE, OR BOTH ARE TRUE, AND FALSE OTHERWISE is called

A

Inclusive OR

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

A proposition that is TRUE iF EXACTLY ONE OF P OR Q IS TRUE, BUT NOT BOTH.

A

Exclusive OR

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

A ___ or ___ operator is a binary logical connective that yields ‘if p then q’

A

CONDITIONAL OR IMPLICATION OPERATOR

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

In a conditional proposition, p is called the _____ (3 terms)

A

PREMISE, HYPOTHESIS, ANTECEDENT

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

In a conditional proposition, q is called the _____ (2 terms)

A

CONCLUSION or CONSEQUENT

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

The implication ____ is the proposition that is false precisely when p is true but q is false. MEANING IF THE PREMISE IS SATISFIES THAN IT FOLLOWS THAT THE CONCLUSION SHOULD HAPPEN

A

p-> q

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

Is a condition that suffices to guarantee a particular outcome

A

SUFFICIENT CONDITION

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

If the condition does not hold, the outcome might be achieved in another way OR if the condition does hold, the outcome is guaranteed (WHAT CONDITION IS THIS?)

A

SUFFICIENT CONDITION

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

A condition that is necessary for the particular outcome be achieved

A

NECESSARY CONDITION

24
Q

p cannot be true unless q is true OR if q is false then p is false (WHAT CONDITION IS THIS)

A

NECESSARY CONDITION

25
~p -> ~q
INVERSE
26
q -> p
CONVERSE
27
~q -> ~p
CONTRAPOSITIVE
28
p if and only if q (give the two terms)
BICONDITIONAL OR MATERIAL EQUIVALENCE
29
for p and q to be trues, p and q should both be true or both false
BICONDITIONAL
30
the equivalent statement of biconditional operation is (in terms of p and q)
(p>q)A(q>p)
31
Represent relationship between the truth values of propositions and the formed compound propositions
TRUTH TABLES
32
List of all possible combinations and their corresponding output truth value once evaluated
TRUTH TABLE
33
formula for all possible values of combinations
n=2^k
34
Is composed of a sequence of statement called premise and concludion
ARGUMENT
35
A class of compound propositions that are ALWAYS TRUE for all possible combinations of truth values
TAUTOLOGY
36
is the opposite of tautology. it is a compound proposition that is always false (2 terms)
CONTRADICTION OR ABSURDITY
37
Compound values that have the same truth values in all possible combinations are called ____
LOGICALLY EQUIVALENT
38
Pertains to rules that can be used as building blocks to construct more complicated valid arguments
RULES OF INFERENCE
39
method of affirming (q)
modus ponens or law of detachment
40
p>r
Hypothethical syllogism
41
Method of denying ~p
Modus tollens
42
A valid argument that established the truth of a mathematical statement of the truth of a theorem
PROOF
43
shows that a conditional statement p>q is true by showing that IF P IS TRUE, THEN Q MUST ALSO BE TRUE. the combination of p is true and q is false never occurs
Direct proof
44
to prove that p>q is true, it should be known that P IS FALSE. p>q is only true when p is false
VACUOUS PROOF
45
to prove that p>q is true, it should be known that Q IS true. p>q is only true when q is true
TRIVIAL PROOF
46
Puzzles that can be solved using logical reasoning
Logic puzzles
47
Are the basic building blocks of any digital dydtem
LOGIC GATES
48
Combination of propositions
Logical arguments
49
combinations of switches that control the flow of current
CIRCUITS
50
is an algebra that deals with binary variables and logical operations
BOOLEAN ALGEBRA
51
States that every algebraic expression deducible form the postulates of boolean algebra remains valid of the operators and identity elements are interchanged
DUALITY PRINCIPLE
52
______ have the property of creating any logic gate of any Boolean expression by combining them
universal gates
53
Give an example of universal gates
NOR and NAND
54
This refers to high value (1) 2 terms
NORMAL VARIABLE (PRIMED)
55
This refers to low value (0) 2 terms
INVERTIBLE (UNPRIMED)