Exam 1 Flashcards

1
Q

Three of the most important kinds of sentences in mathematics are _______ statements, _______ statements, and _______ statements.

A

Universal
Conditional
Existential

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

Says that a certain property is true for all elements in a set.

A

Universal statement

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

Says that if one thing is true then some other thing also has to be true.

A

Conditional statement

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

Given a property that may of may not be true, an _________________ says that there is at least one thing for which the property is true.

A

Existential statement

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

Contain some variation of the words “for all” and conditional statements contain versions of the words “if-then”.

A

Universal statements

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

A _____________________ is a statement that is both universal and conditional. Here is an example:

For all animals a, If a is a dog, then a is a mammal.

A

Universal conditional statement

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

One of the most important facts about universal conditional statements is that they can be rewritten in ways that make them appear to be purely ________ or purely _________.

A

Universal

Conditional

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

A statement that is universal because it’s first part says that a certain property is true for all objects of a given type, and it is existential because it’s second part asserts the existence of something. For example:

Every real number has and additive inverse.

A

Universal existential statement

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

“______________________” asserts the existence of something- and additive inverse- for each real number

A

Has an additive inverse

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

A statement that is existential because it’s first part asserts that a certain object exists and is universal because it’s second part says that the object satisfies a certain property for all things of a certain kind.

A

Existential universal statement

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

Example:

There is a positive integer that is less than or equal to every positive integer

What statement does this true example refer too?

A

Existential universal statement

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

Some of the most important mathematical concepts, such as the definition limit of a sequence, can only be defined using phrases that are ________, ________, and __________, and they require the use of all three phases “______”, “_______”, and “_______”.

A

Universal
Existential
Conditional

For all
There is
If-then

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

A set may be specified using the _____________ by writing all the elements between braces. Example:

{1,2,3}

A

Set-roster notation

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

An infinite set symbol. Example:

{1,2,3,…}

A

Ellipsis

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

__ set of all real numbers
— set of all integers
— set of all rational numbers, or quotients of integers

A

R
Z
Q

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

The number 0 to a middle point, called the _______.

A

Origin

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

A unit of distance is marked off, and each point to the right of the origin corresponds to a ________________ found by the computing its distance from the origin.

A

Positive real number

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

Each point to the left of the origin corresponds to a _______________, which is denoted by computing its distance from the origin and putting a minus sign in front of the resulting number.

A

Negative real number

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

The set of real numbers is therefore divided into three parts: set of _________ numbers, set of ________ numbers, and the number __, which is neither positive or negative.

A

Positive real
Negative real
0

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

The name _____________ comes from the distinction between continuous and discrete mathematical objects.

A

Discrete mathematics

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

__ denotes the set of all real numbers
__ denotes the set of all integers
__ denotes the set of all positive integers

A

R
Z
Z+

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

Let A and B be sets. A is a ___________ of B if, and only if, every element of A is in B but there is at least one element of B that is not A.

A

Proper subset

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

Given sets A and B, the _____________ of A and B, denoted A x B and read “A cross B”.

A

Cartesian product

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

The term ___________ is often used to refer to a plane with this coordinate system.

A

Cartesian plane

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

And _________ is a sequence of statements.

A

Argument

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

A ________ is a sequence of statement forms.

A

Argument form

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

When an argument is valid and it’s premises are true, the truth of the conclusion is said to be _________ or _________.

A

Inferred

Deduced

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

If a conclusion “ain’t necessarily so”, then is is it a _____________.

A

Valid deduction

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

An argument form consisting of two premises and a conclusion is called a ____________

A

Syllogism

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

The first and second premises are called the ______________ and ______________.

A

Major premise

Minor premise

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

The most famous form of syllogism in logic is called ______________. Is has the following form:

If p then a.
p
q

A

Modus ponens

32
Q

A valid argument form called _____________. It has the following:

If p then q.
~q
~p

A

Modus tollens

33
Q

A form of argument that is valid. This modus ponens and modus tollens are both rules of inference.

A

Rule of inference

34
Q

Let p and q be statements. A sentence of the form “if p then q” is denoted symbolically by “p->q”; p is called the ___________ and q is called the ____________.

A

Hypothesis

Conclusion

35
Q

If 10 is divisible by 10,
|
Hypothesis

then 10 is divisible by 5
|
Conclusion

Such a sentence is called ___________ because the truth of statement q is conditioned on the truth of statement p.

A

Conditional

36
Q

___________ of q by p is “if p then q” and is denoted p->q

A

Conditional

37
Q

p->q

What is p of the conditional

A

Hypothesis

38
Q

p->q

What is q of the conditional

A

Conclusion or consequent

39
Q

A conditional statement that is true by virtue of the fact that it’s hypothesis is false is often called?

A

Vacuously true
Or
True by default

40
Q

Thus the statement “If you show up for work Monday morning, then you will get the job” is vacuously true if you ________________ for work Monday morning.

A

Do not show up

41
Q

In general, when the “if” part of an if-then statement is false, the statement as a whole is said to be ______, regardless of whether the conclusion is true or false.

A

True

42
Q

By definition, p->q is false if, and only if, it’s hypothesis,p, is ______ and it’s conclusion,q, is ______.

A

True

False

43
Q

The negation of if p then q is logically equivalent to ___________

A

p and not q

44
Q

The __________________ of p->q is ~q->~p

A

Contrapositive

45
Q

A conditional statement is logically equivalent to its ?

A

Contrapositive

46
Q

A conditional statement and it’s converse are ?

A

Not logically equivalent

47
Q

A conditional statement and it’s inverse are ?

A

Not logically equivalent

48
Q

A converse and the inverse of a conditional statement are ?

A

Logically equivalent to each other

49
Q

Given statement variables p and q, the _____________ of p and q is “p If, and only if,q” and is denoted pq

A

Biconditional

50
Q

The addriviation iff means?

A

If and only if

51
Q

is coequal with ->. The only way to indicate precedence between them is to use ____________

A

Parentheses

52
Q

What is the order of operations for logical operators

A
  1. ~
  2. V, ^
  3. ->,
53
Q

r is a ______________ condition for s Means “if r then s”

A

Sufficient

54
Q

r is a ______________ condition for s Means “if not r then not s”

A

Necessary

55
Q

“r is a sufficient condition for s” means that the occurrence of r is _________ to guarantee the occurrence of s

A

Sufficient

56
Q

A sentence that is true or false but not both

A

Statement

56
Q

~p is read not p and is called

A

The negation of p

56
Q

p ^ q is read p and q and is called

A

The conjunction of p and q

56
Q

p v q is read p or q and is called

A

Disjunction of p and q

57
Q

Statement form displays the truth values

A

Truth table

58
Q

Two statements forms are called __________ If and only if they have identical truth values

A

Logically equivalent

59
Q

Symbol -
-
-

Means?

A

Logically equivalent

60
Q

Two logical equivalences are known as

A

De Morgan’s laws

61
Q

~(p^q) logically equivalent to ~p v ~q

~(p v q) logically equivalent to ~p ^ ~q

A

De Morgan’s law

62
Q

A tautology is a statement that is always _____

A

True

63
Q

A contradiction is a statement form that is always _________

A

False

64
Q

A row of the truth table in which all the premises are true is called a

A

Critical row

65
Q

The operation of a black box is completely specified by constructing an

A

Input/output table

66
Q

An efficient method for designing more complicated circuits is to build them by connecting less complicated _________ circuits

A

Black box

67
Q

A circuit with one input signs and one output signal

Looks like |>•

A

NOT-gate

68
Q

A circuit with two input signals and one output signal

Looks like a D

A

AND-gate

69
Q

A circuit with two input signals and one output signal

Looks like |>

A

OR-gate

70
Q

Gates can be combined into circuits in a variety of ways called

A

Combination circuit

71
Q

Expression composed of ~,^, and V is called a

A

Boolean expression

72
Q

p -> q

~p -> ~q

A

Inverse

73
Q

p -> q

q -> p

A

Converse