Logic and Computation Flashcards

You may prefer our related Brainscape-certified flashcards:
1
Q

What is a set?

A

An unordered collection of distinct elements or members.

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

What notation is used to define a set?

A

Curly braces { }, e.g., A = {1, 2, 3, 4, 5}.

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

What does the symbol ∈ mean in set notation?

A

“Element of,” meaning an item is a member of a set.

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

What is the cardinality of a set?

A

The number of elements in a set, denoted |A| or #A.

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

What is a subset (⊆) and a proper subset (⊂)?

A

A subset includes all elements of another set, while a proper subset includes some but not all.

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

What is the union (∪) of two sets?

A

A set containing all elements that are in either set or both.

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

What is the intersection (∩) of two sets?

A

A set containing only elements common to both sets.

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

What is the empty set?

A

A set with no elements, denoted ∅ or { }

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

Define the sets ℕ, ℤ, ℚ, ℝ, ℂ, ℙ, and ∅.

A

ℕ: Natural numbers, ℤ: Integers, ℚ: Rational numbers, ℝ: Real numbers, ℂ: Complex numbers, ℙ: Prime numbers, ∅: Empty set.

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

What is logic?

A

The science of valid reasoning, involving constructing valid arguments.

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

What is propositional logic?

A

Logic dealing with propositions and logical connectives.

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

Define Boolean Logic.

A

A type of algebra with only two values: true (1) or false (0).

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

What is predicate logic?

A

Logic with predicates, allowing more complex statements about objects and properties.

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

What is a simple proposition?

A

A statement expressing a single, complete thought that cannot be broken down.

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

Define a compound proposition.

A

A statement combining two or more simple propositions with logical connectives.

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

What does the AND (∧) connective mean?

A

It is true only when both propositions are true.

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

Define the OR (∨) connective.

A

It is true when at least one proposition is true.

18
Q

What is NOT (¬) in logical terms?

A

A connective that negates the truth value of a proposition.

19
Q

Explain XOR (⊕).

A

It is true when exactly one of the propositions is true.

20
Q

What is the IMPLIES (→) operator?

A

It is false only when the first proposition is true and the second is false.

21
Q

Define a tautology.

A

A compound proposition that is always true.

22
Q

What is a contradiction?

A

A compound proposition that is always false.

23
Q

What does antecedent mean in a conditional statement?

A

The “if” part of an “if-then” statement.

24
Q

Define consequent in a conditional statement.

A

The “then” part of an “if-then” statement.

25
Q

What is a vacuous truth?

A

A statement that is true because its antecedent is false.

26
Q

What are critical rows in a truth table?

A

Rows where premises are true, and the conclusion is false, showing invalidity.

27
Q

What is Modus Ponens?

A

If P → Q and P, then Q.

28
Q

What is Modus Tollens?

A

If P → Q and ¬Q, then ¬P.

29
Q

What is a generalisation rule in inference?

A

From P, infer P ∨ Q.

30
Q

Define the conjunction rule in inference.

A

From P and Q, infer P ∧ Q.

31
Q

Explain elimination in propositional logic.

A

From P ∨ Q and ¬Q, infer P.

32
Q

What is a contradiction rule?

A

From ¬P → c, infer P.

33
Q

What is logical equivalence?

A

When two statements have the same truth value.

34
Q

Define the existential quantifier.

A

“There exists” (∃), meaning at least one member of the set.

35
Q

Define the universal quantifier.

A

“For all” (∀), meaning it applies to all members of the set.

36
Q

What is a universal conditional statement?

A

A statement applying universally in the form “if P(x) then Q(x).”

37
Q

What is the contrapositive of a statement?

A

Negating and switching the parts of an “if-then” statement.
Example: For the statement “If it is raining, then the ground is wet,” the contrapositive is “If the ground is not wet, then it is not raining.”

38
Q

Define inverse in logic.
.

A

Negating both parts of an “if-then” statement

Example: For the statement “If it is raining, then the ground is wet,” the inverse is “If it is not raining, then the ground is not wet.”

39
Q

Define converse in logic.

A

Switching the parts of an “if-then” statement.

Example: For the statement “If it is raining, then the ground is wet,” the converse is “If the ground is wet, then it is raining.”

40
Q

What is the logical equivalence theorem for UCS?

A

The original statement is equivalent to its contrapositive; inverse is equivalent to converse.