Final Notions & Proofs to Memorize

0.0(0)
studied byStudied by 0 people
0.0(0)
full-widthCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/13

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

14 Terms

1
New cards
term image
knowt flashcard image
2
New cards
term image
knowt flashcard image
3
New cards

What does this represent: is the deductive system minimally adequate, does it prove only things that it should prove?

soundness

4
New cards

What does this represent: is the deductive system fully adequate, does it prove all the things that it should prove?

completeness

5
New cards

What is FOL soundness?

if P1, .., Pn |- Q then P1, …, Pn |= Q

if we can derive a conclusion from some set of sentences, then the argument must be first-order valid

if |- Q then |= Q

6
New cards

How do we prove soundness? What is the sketch?

with an informal proof

  1. any derivation has to be finite (theres a beginning and an end)

  2. assume that we have a derivation in which all inferences before the last were made correctly

  3. all rules (introduction, elimination, R, X, IP) all yield valid inferences

7
New cards

What is FOL completeness?

if P1, …, Pn |= Q then P1, …, Pn |- Q

if an argument is first-order valid, then we must able to derive the conclusion from some of the sentences that constitutes the premises

if |= Q then |- Q

8
New cards

=I rule

at any point you can write t=t for any name t

no conditions

use when you need a trivial identity statement

often used with =E to swap terms

9
New cards

=E rule

m s=t

n A(…s…s…)

A(…t…t…)

you can replace one, some, all occurrences of a name

works with free variables too

  • b = i, L(x,b) derives L(x,i)

10
New cards

AE rule

k AxA(x)

A(t)

you must replace all occurrences of x with t

can be applied multiple times to same universal with different names

11
New cards

AI rule

k A(c)

AxA(x)

conditions:

  1. c must NOT appear in any premises, any undischarged assumption (any assumption of an unfinished proof)

  2. must replace ALL occurrences of c with x

12
New cards

EI rule

k A(…c…c…)

ExA(…x…c…)

can replace one or more occurrences

x must not already be in formula

13
New cards

EE rule

m ExA(…x…x…)

[ ]A(…c…c…)

[ ]B

B :EEm,i-j

conditions:

  1. replace ALL occurrences of x with c

  2. c must be fresh (NOT appear in):

    1. any premise

    2. any undischarged assumption (any assumption of an unfinished proof)

    3. the formula ExA(…x…x…)

  3. c must NOT appear in B (conclusion that’s exported)

14
New cards
term image
knowt flashcard image