Question 1

In logic, a statement that can be either true or false is called a ___.

Accepted Answer

proposition

Question 2

A ___ statement is one that combines two or more propositions using logical connectives.

Accepted Answer

compound

Question 3

The ___ of a statement is the opposite of the statement itself.

Accepted Answer

negation

Question 4

In symbolic logic, the symbol for 'and' is ___.

Accepted Answer

∧

Question 5

The truth value of a statement can be represented as ___ or ___.

Accepted Answer

true, false

Question 6

The statement '___ is a whole number and ___ is an even number' is ___.

Accepted Answer

3, 3, true

Question 7

A simple statement conveys ___ idea.

Accepted Answer

a single

Question 8

The truth table illustrates the four possible cases that arise when forming a ___ of two statements.

Accepted Answer

conjunction

Question 9

A truth table is used to analyze ___ statements.

Accepted Answer

compound

Question 10

The expression '9³ + 2 is not a prime number' is a ___.

Accepted Answer

statement

Question 11

The negation of a statement with a universal quantifier changes it to an ___ quantifier.

Accepted Answer

existential

Question 12

The logical representation of 'not s or r' is ___.

Accepted Answer

~s v r

Question 13

A truth table is used to determine the truth values of ___ statements.

Accepted Answer

logical

Question 14

The statement 'For every ___, there exists a ___' can be negated as 'There exists an ___ such that for every ___, ___ does not hold'.

Accepted Answer

X, Y, Y

Question 15

In George Boole's system, ___ are used to represent connectives.

Accepted Answer

symbols

Question 16

A universal quantifier is represented by the symbol ___.

Accepted Answer

∀

Question 17

The statement '3 is not an even number' is a ___ statement.

Accepted Answer

false

Question 18

In a statement, the words ___, ___, ___, and ___ are called universal quantifiers.

Accepted Answer

none, no, all, every

Question 19

A compound statement consists of ___ simple statements.

Accepted Answer

grouped together

Question 20

The negation of the statement 'No doctors write in a legible manner' is ___ doctors write in a legible manner.

Accepted Answer

Some

Question 21

An opinion can be expressed as: 'Your shirt is ___!'

Accepted Answer

nice

Question 22

The negation of 'Some movies are not worth the price of admission' is ___ movies are worth the price of admission.

Accepted Answer

All

Question 23

The phrase 'It is true for x = 4, however it is false for any other values of x' describes an ___ statement.

Accepted Answer

open

Question 24

A truth table is used to determine the ___ of logical statements.

Accepted Answer

truth values

Question 25

The truth value of a simple statement is either ___ or ___.

Accepted Answer

true, false

Question 26

The word ___ and the phrases 'there exists' and 'at least one' are called existential quantifiers.

Accepted Answer

some

Question 27

In a statement, the phrases 'there exists' and 'at least one' are examples of ___ quantifiers.

Accepted Answer

existential

Question 28

The statement '7 ≥ 5' means ___ or ___.

Accepted Answer

7 > 5, 7 = 5

Question 29

The logical expression for 'p and q' is represented as ___.

Accepted Answer

p ^ q

Question 30

The statement 'I am smart and you are ___' is an example of a compound statement.

Accepted Answer

handsome

Question 31

In a compound statement, the truth value can depend on the truth values of the ___ statements involved.

Accepted Answer

simple

Question 32

In logic, a statement that can be either ___ or ___ is known as a logic statement.

Accepted Answer

true, false

Question 33

The negation of 'Some ___ are ___' is 'No ___ are ___'.

Accepted Answer

X, Y

Question 34

The statement 'If you do not complete the training, then you will not get a promotion and you will not receive a bonus.' can be written in symbolic form as: ___ → (¬p ^ ¬r).

Accepted Answer

¬q

Question 35

The statement 'I will attend the meeting or I will go to ___' is an example of a compound statement.

Accepted Answer

school

Question 36

An example of a command is: '___ get the newspaper.'

Accepted Answer

Go

Question 37

The negation of 'No airports are open' is ___ airports are open.

Accepted Answer

Some

Question 38

The statement 'I am going to a basketball game or I am going to a movie' in symbolic form is ___.

Accepted Answer

s ∨ r

Question 39

The negation of the statement 'For all x, P(x)' is 'There exists an x such that ___'.

Accepted Answer

¬P(x)

Question 40

The implication 'q implies s' is denoted as ___.

Accepted Answer

q → s

Question 41

The truth value of a compound statement depends on the truth of its ___ statements and ___.

Accepted Answer

simple, connectives

Question 42

The truth table shows the four possible cases for a ___ of two statements.

Accepted Answer

disjunction

Question 43

The question 'Where have you been?' is ___ a statement.

Accepted Answer

not

Question 44

We use the words ___, ___, ___... then, and ___ to create a compound statement.

Accepted Answer

and, or, if, if and only if

Question 45

The expression for 'not q and r' is written as ___.

Accepted Answer

~q ^ r

Question 46

If you get a promotion and complete the training, then you will receive a ___.

Accepted Answer

bonus

Question 47

The negation of the statement 'There exists an x such that P(x)' is 'For all x, ___'.

Accepted Answer

¬P(x)

Question 48

The conditional statement is often expressed in the form 'If ___, then ___.

Accepted Answer

P, Q

Question 49

The statement 'Today is Friday' can be negated as ___

Accepted Answer

Today is not Friday.

Question 50

George Boole used letters such as ___, ___, ___, and ___ to represent simple statements.

Accepted Answer

p, q, r, s

Question 51

The negation of the statement 'Some airports are open' is: '___ airports are open.'

Accepted Answer

No

Question 52

A compound statement is a statement that conveys ___ or more ideas.

Accepted Answer

two

Question 53

An existential quantifier is represented by the symbol ___.

Accepted Answer

∃

Question 54

The statement ___ ≥ ___ has a truth value of ___.

Accepted Answer

7, 5, true

Question 55

The statement 'If it is raining, then I am not going to the basketball game' in symbolic form is ___.

Accepted Answer

q → ¬s

Question 56

The symbolic representation of the statement is ___ → (~p ^ ~r).

Accepted Answer

~q

Question 57

The truth value of a conjunction (AND) is ___ if both statements are true.

Accepted Answer

true

Question 58

The statement 'The dog does not need to be fed' can be negated as ___

Accepted Answer

The dog needs to be fed.

Question 59

Cagayan de Oro is found in Mindanao is an example of a ___.

Accepted Answer

statement

Question 60

The negation of the statement 'No odd numbers are divisible by 2' is: '___ odd numbers are divisible by 2.'

Accepted Answer

Some

Question 61

The equation 'x + 1 = 5' is considered a ___.

Accepted Answer

statement

Question 62

The statement 'I am not going to school if and only if today is ___' is an example of a compound statement.

Accepted Answer

Sunday

Question 63

In a truth table, each row represents a possible ___ of the variables.

Accepted Answer

combination

Question 64

The negation of 'There exists an ___ such that ___' is 'For all ___, ___ does not hold'.

Accepted Answer

X, Y

In logic, a statement that can be either true or false is called a ___.

A ___ statement is one that combines two or more propositions using logical connectives.

The ___ of a statement is the opposite of the statement itself.

In symbolic logic, the symbol for 'and' is ___.

The truth value of a statement can be represented as ___ or ___.

The statement '___ is a whole number and ___ is an even number' is ___.

A simple statement conveys ___ idea.

The truth table illustrates the four possible cases that arise when forming a ___ of two statements.

A truth table is used to analyze ___ statements.

The expression '9³ + 2 is not a prime number' is a ___.

The negation of a statement with a universal quantifier changes it to an ___ quantifier.

The logical representation of 'not s or r' is ___.

A truth table is used to determine the truth values of ___ statements.

The statement 'For every ___, there exists a ___' can be negated as 'There exists an ___ such that for every ___, ___ does not hold'.

In George Boole's system, ___ are used to represent connectives.

A universal quantifier is represented by the symbol ___.

The statement '3 is not an even number' is a ___ statement.

In a statement, the words ___, ___, ___, and ___ are called universal quantifiers.

A compound statement consists of ___ simple statements.

The negation of the statement 'No doctors write in a legible manner' is ___ doctors write in a legible manner.

An opinion can be expressed as: 'Your shirt is ___!'

The negation of 'Some movies are not worth the price of admission' is ___ movies are worth the price of admission.

The phrase 'It is true for x = 4, however it is false for any other values of x' describes an ___ statement.

A truth table is used to determine the ___ of logical statements.

The truth value of a simple statement is either ___ or ___.

The word ___ and the phrases 'there exists' and 'at least one' are called existential quantifiers.

In a statement, the phrases 'there exists' and 'at least one' are examples of ___ quantifiers.

The statement '7 ≥ 5' means ___ or ___.

The logical expression for 'p and q' is represented as ___.

The statement 'I am smart and you are ___' is an example of a compound statement.

In a compound statement, the truth value can depend on the truth values of the ___ statements involved.

In logic, a statement that can be either ___ or ___ is known as a logic statement.

The negation of 'Some ___ are ___' is 'No ___ are ___'.

The statement 'If you do not complete the training, then you will not get a promotion and you will not receive a bonus.' can be written in symbolic form as: ___ → (¬p ^ ¬r).

The statement 'I will attend the meeting or I will go to ___' is an example of a compound statement.

An example of a command is: '___ get the newspaper.'

The negation of 'No airports are open' is ___ airports are open.

The statement 'I am going to a basketball game or I am going to a movie' in symbolic form is ___.

The negation of the statement 'For all x, P(x)' is 'There exists an x such that ___'.

The implication 'q implies s' is denoted as ___.

The truth value of a compound statement depends on the truth of its ___ statements and ___.

The truth table shows the four possible cases for a ___ of two statements.

The question 'Where have you been?' is ___ a statement.

We use the words ___, ___, ___... then, and ___ to create a compound statement.

The expression for 'not q and r' is written as ___.

If you get a promotion and complete the training, then you will receive a ___.

The negation of the statement 'There exists an x such that P(x)' is 'For all x, ___'.

The conditional statement is often expressed in the form 'If ___, then ___.

The statement 'Today is Friday' can be negated as ___

George Boole used letters such as ___, ___, ___, and ___ to represent simple statements.

The negation of the statement 'Some airports are open' is: '___ airports are open.'

A compound statement is a statement that conveys ___ or more ideas.

An existential quantifier is represented by the symbol ___.

The statement ___ ≥ ___ has a truth value of ___.

The statement 'If it is raining, then I am not going to the basketball game' in symbolic form is ___.

The symbolic representation of the statement is ___ → (~p ^ ~r).

The truth value of a conjunction (AND) is ___ if both statements are true.

The statement 'The dog does not need to be fed' can be negated as ___

Cagayan de Oro is found in Mindanao is an example of a ___.

The negation of the statement 'No odd numbers are divisible by 2' is: '___ odd numbers are divisible by 2.'

The equation 'x + 1 = 5' is considered a ___.

The statement 'I am not going to school if and only if today is ___' is an example of a compound statement.

In a truth table, each row represents a possible ___ of the variables.

The negation of 'There exists an ___ such that ___' is 'For all ___, ___ does not hold'.

A statement is a declarative sentence that is either ___ or ___, but cannot be both at the same time.

A compound statement written in symbolic form requires ___ to show the grouping of simple statements.

A ___ is a type of sentence that asks for information.

A compound statement is formed by combining two or more ___ statements.

In a truth table, each row represents a different combination of ___ values.

A fact is a statement such as: '___ is the capital of Thailand.'

The negation of 'Some odd numbers are divisible by 2' is ___ odd numbers are not divisible by 2.

The negation of 'All ___ are ___' is 'Not all ___ are ___'.

The truth value of a disjunction (OR) is ___ if at least one statement is true.

The negation of the statement 'All movies are worth the price of admission' is: '___ movies are worth the price of admission.'

The phrase 'if... then' is used to create a ___ statement.

In logic, a statement can have a truth value of ___ or ___.

In the expression ~q → (~p ^ ~r), ~q represents the ___ of receiving a bonus.

A biconditional statement is true if both the ___ and ___ statements are either true or false.

The compound statement (p ^ q) → r translates to: If you ___ a promotion and you ___ the training, then you will receive a ___.

In a compound statement written as an English sentence, a ___ is used to indicate which simple statements are grouped together.

The truth value of a statement can be represented as _ or _.

The statement '_ is a whole number and _ is an even number' is ___.

The statement 'For every _, there exists a _' can be negated as 'There exists an _ such that for every _, ___ does not hold'.

In a statement, the words _, _, _, and _ are called universal quantifiers.

The truth value of a simple statement is either _ or _.

The statement '7 ≥ 5' means _ or _.

In logic, a statement that can be either _ or _ is known as a logic statement.

The negation of 'Some _ are _' is 'No _ are _'.

The truth value of a compound statement depends on the truth of its _ statements and _.

We use the words _, _, _... then, and _ to create a compound statement.

The conditional statement is often expressed in the form 'If _, then _.

George Boole used letters such as _, _, _, and _ to represent simple statements.

The statement _ ≥ _ has a truth value of ___.

The negation of 'There exists an _ such that _' is 'For all _, _ does not hold'.

A statement is a declarative sentence that is either _ or _, but cannot be both at the same time.

The negation of 'All _ are _' is 'Not all _ are _'.

In logic, a statement can have a truth value of _ or _.

A biconditional statement is true if both the _ and _ statements are either true or false.

The compound statement (p ^ q) → r translates to: If you _ a promotion and you _ the training, then you will receive a ___.

Grouping symbols such as _ and _ are used to indicate the order of operations in compound statements.

The statement '_ is a prime number and _ is an even number' is ___.

The components of the statement include getting a promotion (_), completing training (_), and receiving a bonus (___).

Since 7 > 5 is _, the statement '7 ≥ 5' is a _ statement.