Lecture 1: Logic Flashcards

(30 cards)

1
Q

What is a deductive argument?

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

What is a premise?

A

A sequence of statements from our previous body of knowledge

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

What is a conclusion?

A

a new statement typically not included in our previous body of knowledge

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

A deductive argument is valid iff

A

A deductive argument is valid if and only if it makes it impossible for the premises (the “old knowledge”) to be true and the conclusion (the “new knowledge”) to be false

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

Does a valid deductive argument require the premise to be true?

A

NO

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

The validity of an argument does not rely on the truth/falseness of is statements, but..

A

In the relationship between these statements

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

Why does logic need to be formalized?

A
  1. to make the sbtract skeleton of arguments more evident
  2. Because reasoning expressed in informal natural language can be flawed (natural language is ambiguous and tricky).
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

What are the three levels of formalization?

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

Each complex sentence in any natural language is made up of

A

Atomic propositions (atoms)

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

What are atoms

A

The smallest syntactical units of a speech that convey an independent piece of information that can be assigned a truth value of True or False

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

Atoms are joined together by

A

Conjunctions

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

A proposition is a declarative sentence that is…

A

unanbiguously true or false

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

All propositions are constructed assembling…

A

Atomic propositions (atoms) via connectives

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

The truth table of a proposition is uniquely and algorithmically dtermined by its

A

Connectives and by the truth values of its atomic consituents

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

What are WFFs

17
Q

What is the precedence of connectives?

18
Q

In logic, the semantics of a proposition is limited to…

A

Its truth value

19
Q

Each atom can have… with the exception of…

20
Q

With sentences using the english word “or” you must be careful…

A

Of whether or not it is an OR or an XOR

21
Q

What is the truth table of the conditional (implication)

22
Q

A conditional statement does not imply…

23
Q

What are some english versions of the conditional statement?

24
Q

What is the truth table of the biconditional?

25
What are eoms english expressions of the biconditional?
26
2 Formulas are logically equivalent iff
27
What are the special logical equivalences?
28
What do the following mean: tautology, contradiction, contingency
29
A formula is said to be satisfiable...
30
A formula is satisfiable if it is a ___ or \_\_\_\_, but a formula that is unsatisfiable iff is is a \_\_\_\_\_
A formula is satisfiable if it is a tautology or contradiction, but a formula that is unsatisfiable is so iff it is a contradiction