logic week 1 - 4 (test 1) Flashcards

1
Q

necessary truth

A
  • no possibility where it is false
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

possible truth

A
  • there is a possible world where it is true
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

good argument

A
  • arguments that are sound and valid
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

validity

A
  • if and only if its impossible for the premises to be true and the conclusion false
  • the truth of the premises guarantees the truth of the conclusion
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

sound

A
  • valid and true premises
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

circularity

A
  • one of the premises is the same as the conclusion
  • always sound and valid args
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

consistency

A
  • it is possible for all sentences to be true
  • has close relationship with validity
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

formal validity

A
  • if and only if every argument with this form is valid
  • can have generally valid args that are valid based purely off of the link between concepts of arg but formal validity is constant by form (recipe)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

conditional

A
  • if … then … (and other English forms)
  • hook
    -truth function rule ; false if we move from truth to falsity
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

conjunction

A
  • … and …
  • dot
  • truth function rule ; true only if both are true
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

disjunction

A
  • … or …
  • inclusive or for this course
  • vel
  • truth function rule ; false only if both are false
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

negation

A
  • not …
  • tilde
  • truth function rule ; one is true opposite isn’t
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

biconditional

A
  • = (p hook q) . (q hook p)
  • shortened to if and only if = iff
  • truth function rule ; true in doubles (two false or two truths)
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

tautology

A
  • statement true no matter the components truth-values
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

contigent statement

A
  • sometime true sometimes false
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

contradiction

A

always false

15
Q

proving validity

A
  • assume concl. is false and premises true then do working. if possible then invalid if not possible then valid
16
Q

proving consistency

A
  • set all sentences to be true if letters allow for such then consistent if not inconsistent
17
Q

logical equivalence and logical implication

A
  • method 1: focus on true state and balance it on rhs + lhs
  • method 2: focus on falsity state and balance it on rhs + lhs
  • method 3: side based focus & truth/falsity consistency
18
Q

equivalence argument forms

A
  • DN ; not not a = a
    -** DeM** ; distribute negation in and change to and/or = take out negation and change to and/or
  • comm; swap around and/or brackets order
  • assoc; and/or can move small bracket if within bigger bracket with strictly and in it or strictly or in it
  • dist; distribute the and/or and make two brackets with opp of distributed operator = ‘factorise out’ and or and replace with bracket of opposite and/or
  • contra; normal hook = negated and swaped order hook
  • impl; normal hook = negation of first bit and vel replacement of hook
  • exp; peep answer sheet bc i cant put it in words
  • taut; statement = statement and/or same statement
  • equiv; biconditional = normal expansion or biconditional = [(p.q) v same bracket but distributed negation]

these are given to you but wise to learn them off dome

19
Q

sentential proofs

A
  • MP
  • MT
  • DS
  • HS
  • SIMP
  • CONJ
  • ADD
  • CD