Logic II Flashcards

1
Q

predicate

A

logical statement whose truth value is a function of one or more variables

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

domain in a predicate

A

set of all possible values for the variable

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

difference between predicate and proposition

A

predicates can have variables, propositions cannot

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

universal quantifier (∀)

A

true for every possible value for x in its domain

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

universally quantified statement (∀x P(x))

A

a proposition

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

arbitrary element

A

means nothing is assumed about the element other than the fact that it is in the domain

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

counterexample

A

an element in the domain for which the predicate is false

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

existential quantifier (∃)

A

true for at least one possible value for x in its domain

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

existentially quantified statement (∃x P(x))

A

a proposition

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

quantifiers

A

general term for universal and existential quantifiers

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

quantified statement

A

logical statement that includes a universal or existential quantifier

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

when are quantifiers applied?

A

before the logical operations used for propositions

∀x P(x) ∧ Q(x) == (∀x P(x)) ∧ Q(x)

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

free variable

A

a variable x in the predicate P(x), because variable is free to take on any value in the domain

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

bound variable

A

variable x in the statement ∀x P(x), because the variable is bound to a quantifier

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

is (∀x P(x)) ∧ Q(x) a proposition?

A

no, x is both bound and free

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

is ∀x (P(x) ∧ Q(x)) a proposition?

A

yes, x is bound

17
Q

¬∀x F(x) is logically equivalent to

A

∃x ¬F(x)