scientific article; zbMATH DE number 3557745
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.
- scientific article; zbMATH DE number 4123698
- scientific article; zbMATH DE number 3851084
- scientific article; zbMATH DE number 3300566
- The logic of the partial -calculus with equality
- scientific article; zbMATH DE number 4164835
- A finitely axiomatized formalization of predicate calculus with equality
- A Gentzen-style axiomatization for basic predicate calculus
- Intuitionistic existential instantiation and epsilon symbol
- A symbolic semantics for the \(\pi\)-calculus
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4133596)