Chpt. 1 Sets, Relations, and Arguments Flashcards

1
Q

A Set

A

A set is a collection of objects.

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

An Element

A

An element of a set is an object within the collection.

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

Identical Sets

A

Identical sets are sets with the same elements.

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

What does “a ∈ A” mean?

A

That a is an element of set A.

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

What does ∅ represent?

A

An empty set that contains no elements.

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

How do read this: {x: x is an animal with a heart}

A

The set of all animals with a heart.

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

Write this in set notation: the set of all UN recognized states.

A

{x: x is a UN recognized state}

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

A Binary Relation

A

A binary relation is a set that contains only ordered pairs.

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

Is ∅ a binary relation?

A

Yes, because it does not contain anything that is not an ordered pair.

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

A binary relation R is reflexive on a set S if and only if…

A

for all elements d of S the pair [d,d] is an element of R

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

A binary relation R is symmetric on a set S if and only if…

A

for all elements d, e of S the pairs [d,e] ∈ R and [e,d] ∈ R

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

A binary relation R is asymmetric on a set S if and only if…

A

for no elements d, e of S the pair [d,e] ∈ R and [e,d] ∈ R

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

A binary relation R is antisymmetric on a set S if and only if…

A

for no two distinct elements of d, e of S, the pairs [d,e] ∈ R and [e,d] ∈ R

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

A binary relation R is transitive on a set S if and only if…

A

for all elements d, e, f of S: if [d,e] ∈ R and [e,f] ∈ R then also [d,f] ∈ R

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

A binary relation R is symmetric if and only if…

A

it is symmetric on all sets; for all d,e: if [d,e] ∈ R then [e,d] ∈ R

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

A binary relation R is asymmetric if and only if…

A

it is asymmetric on all sets; for no d,e: [d,e] ∈ R and [e,d] ∈ R

17
Q

A binary relation R is antisymmetric if and only if…

A

it is antisymmetric on all sets; for no two distinct d,e: [d,e] ∈ R and [e,d] ∈ R

18
Q

A binary relation R is transitive if and only if…

A

it is transitive on all sets; for all d,e,f: [d,e] ∈ R and [e,f] ∈ R, then also [d,f] ∈ R

19
Q

A binary relation R is an equivalence relation on S if and only if…

A

R is reflexive, symmetric, and transitive on S

20
Q

A binary relation R is a function if and only if…

A

for all d,e,f: if [d,e] ∈ R and [d,f] ∈ R then e = f

21
Q

R is a function into the set S if and only if…

A

all elements of the range of the function are in S.

22
Q

A Declarative Sentence

A

is a sentence that is either true or false.

23
Q

An Argument

A

an argument is a set of declarative sentences (the premisses) and a declarative sentence marked as the concluded sentence (the conclusion).

24
Q

Logical/Formal Validity

A

An argument is logically/formally valid if and only if there is no interpretation under which the premisses are all true and the conclusion is false.

25
Q

Propositional Validity

A

An argument is is propositionally valid when there is no interpretation of the sentences such that all the premisses are true and yet the conclusion is false.

26
Q

Consistency

A

A set of sentences is logically consistent if and only if there is at least one interpretation under which all sentences of the set are true.

27
Q

Define validity in terms of consistency.

A

An argument is valid if and only if the set obtained by adding the negation of the conclusion to the premisses is inconsistent.

28
Q

Logical Truth

A

A sentence is logically true if and only if it is true under any interpretation.

29
Q

Contradiction

A

A sentence is a contradiction if and only if it is false under all interpretations.

30
Q

Logical Equivalence

A

Sentences are logically equivalent if and only if they are true under exactly the same interpretations.

31
Q

What are the components that we can break down languages into?

A

Syntax, semantic, and pragmatics.

32
Q

Syntax

A

Is concerned with the expressions of a language outside of their meaning.

33
Q

Semantics

A

Is concerned with the meanings of the expressions of a language.

34
Q

Pragmatics

A

Is concerned with the use of language (understanding it within context).