Propositions Flashcards

1
Q

is a declarative sentence (that is, a sentence that declares a fact) that is either
true or false, but not both.

A

proposition

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

We use letters to denote_____________________, that is, variables
that represent propositions, just as letters are used to denote numerical variables

A

propositional variables(or sentential variables)

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

The conventional letters used for propositional variables are

A

p, q, r, s, …

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

a proposition is true, denoted by T, if it is a true proposition, and the truth value of a proposition is false, denoted by F, if it is a false proposition

A

truth value

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

Propositions that cannot be expressed in terms of simpler
propositions are called

A

atomic propositions.

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

The area of logic that deals with propositions is called the

A

propositional calculus or propositional logic

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

It was first developed systematically by the Greek philosopher _____________ more than
2300 years ago.

A

Aristotle

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

These methods were discussed by the English mathematician George Boole in
1854 in his book

A

The Laws of Thought.

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

New propositions, called ___________________________ , are formed
from existing propositions using __________________________

A

compound propositions, logical operators.

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

Let p be a proposition. The negation of p, denoted by ¬p (also denoted by p), is the statement

A

“It is not the case that p.”

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

The proposition ¬p is read “not p.” The truth value of the negation of p, ¬p, is

A

the opposite
of the truth value of p.

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

The notation for the negation operator is not standardized. Although ¬p and p are the
most common notations used in mathematics to express the negation of p, other notations you
might see are

A

∼p, −p, p′
, Np, and !p.

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

The negation of a proposition can also be considered the result of the operation of the

A

negation operator on a proposition

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

logical operators that are used to form
new propositions from two or more existing propositions

A

connectives.

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

The conjunction of p and q, denoted by p ∧ q, is the proposition
“p and q.” The conjunction p ∧ q is

A

true when both p and q are true and is false otherwise

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

The disjunction of p and q, denoted by p ∨ q, is the proposition
“p or q.” The disjunction p ∨ q is false when

A

n both p and q are false and is true otherwise.

17
Q

The use of the connective or in a disjunction corresponds to one of the two ways the word
or is used in English, namely, as an

A

inclusive or

18
Q

The exclusive or of p and q, denoted by p ⊕ q (or p XORq), is
the proposition that is true when

A

exactly one of p and q is true and is false otherwise.

19
Q

“Students who have taken calculus or computer science, but not both, can enroll in this
class.”

A

e exclusive or

20
Q

The exclusive or of p and q, denoted by p ⊕ q, is the proposition
that is true when exactly

A

one of p and q is true and is false otherwise.

21
Q

The conditional statement p → q is the proposition “if p, then
q.” The conditional statement p → q is false when p is true and q is false, and true otherwise.
In the conditional statement p → q, p is called the

A

hypothesis (or antecedent or premise)
and q is called the conclusion (or consequence).

22
Q

The statement p → q is called a conditional statement because

A

p → q asserts that q is true
on the condition that p holds

23
Q

A conditional statement is also called an

A

implication

24
Q

Most programming languages contain statements such as

A

if p then S,

25
The proposition q → p is called the
converse of p → q
26
is the proposition ¬q → ¬p.
contrapositive of p → q
27
The proposition ¬p → ¬q is called the
inverse of p → q
28
When two compound propositions always have the same truth value we call them
equivalent
29
” The biconditional statement p ↔ q is true when
p and q have the same truth values, and is false otherwise. Biconditional statements are also called bi-implications
30
is a symbol with two possible values, namely, 0 (zero) and 1 (one)
bit
31
A variable is called a
Boolean variable
32
correspond to the logical connectives
computer bit operations
33
is a sequence of zero or more bits.
bit string
34
The __________ of this string is the number of _______ in the string.
length, bits
35
We define the bitwise OR, bitwise AND, and bitwise XOR of two strings of the same length to be
the strings that have as their bits the OR, AND, and XOR of the corresponding bits in the two strings, respectively