No label defined (Q4133596)
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 3557745
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3557745 |
Statements
1974
0 references
0.8684312
0 references
0.86568016
0 references
0.85945344
0 references
0.8584641
0 references
0.85787773
0 references
Adding the \(\varepsilon\)-symbol with Hilberts \(\varepsilon\)-axiom \(\exists xA \rightarrow A [\varepsilon xA]\) to Heyting predicate calculus HPC is known to result in a non-conservative extension: \(\exists y(\exists xPx \rightarrow Py)\) becomes derivable. A conservative extension HPC\({}^\varepsilon\) considered here is obtained (following A. G. Dragalin) by restricting postulates for negative quantifiers, i.e., \(\forall\)-elimination and \(\exists\)-introduction, to a form \(\exists x_1B_1 \& \dots \& \exists x_nB_n \&\forall xA \rightarrow A_x [t]\) when \(t\) contains \(\varepsilon x_1B_1,\dots , \varepsilon x_nB_n\). Thus \(\varepsilon\)-symbols are treated as partially defined functions. The normalization (cut-elimination) theorem is proved for sequents in which for every \(\varepsilon\)-expression \(\varepsilon xA(x,y)\) with bounded variable \(y\) there is an antecedent member \(\forall y\exists xA(x,y)\). This implies conservativity over HPC, which was established earlier by Dragalin using model-theoretic means. The proof-theoretic treatment used here was later employed to prove the normalization theorem for Heyting arithmetic with choice axiom.
0 references