<< Chapter < Page | Chapter >> Page > |
The following are in addition to those of propositional logic .
Abbreviation | Name | If you know all of | then you can infer |
---|---|---|---|
Intro | -introduction | ||
arbitrary . | |||
Elim | -elimination | ||
is any term that is free to be replaced in . | |||
Domain non-empty. | |||
Intro | -introduction | ||
is any term in that is free to be replaced. | |||
Domain non-empty. | , where is arbitrary | ||
Elim | -elimination | ||
is a new constant in the proof. | |||
does not occur in the proof's conclusion. |
As usual, we use as a meta-variable to range over first-order WFFs. Similarly, is a meta-variable for first-order terms, and is a meta-variable for domain constants.The notation means the formula but with every appropriate occurrence of replaced by .
As discussed in the lecture notes , a variable is arbitrary unless :
As a detail in Elim and Intro, the term must be free to replace the variable in . This means that it is not the case that both contains a variable quantified in , and that occurs free within that quantifier. In short, the bound variable names should be kept distinct from the free variable names.Also, only free occurrences get replaced. The restriction in Elim on being new is similar.
Notification Switch
Would you like to follow the 'Intro to logic' conversation and receive update notifications?