No label defined (Q5620583)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3344563
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3344563 |
Statements
1963
0 references
mathematical logic
0 references
computer science
0 references
A simplification of the Gentzen-type proof methods for the first order predicate logic with symbols for identity and operations from individuals to individuals is given. This simplification is founded principally on some modifications of the rules of inference and a preference order of applications of these rules, namely: 1) The \(\forall\)-antecedent and \(\exists\)-succedent mules are given in the following modified forms: \[ \frac{\Gamma, F_{\alpha}^x, \forall xFx, \Delta \rightarrow Z}{\Gamma, \forall xFx, \Delta \rightarrow Z}, \quad \frac{\Gamma \rightarrow Z, F_{\alpha}^x, \exists xFx, \Lambda}{\Gamma \rightarrow Z, \exists xFx, \Lambda}, \] where \(\alpha\) is a dummy which can take any term occurring in the conclusion as its value if such a term exists, and \(\alpha\) is the first individual parameter otherwise. 2) When constructing a deduction tree for proving any sequent, we prefer applications of the \(\forall\)-succedent and \(\forall\)-antecedent rules to applications of truth functional rules, and we prefer applications of truth functional rules to applications of the \(\forall\) antecedent and \(\exists\)-succedent rules. This simplified proof method is suitable for programming a computer to carry out the demonstrations. [For the entire collection see Zbl 0108.13402.]
0 references