scientific article; zbMATH DE number 598799

MaRDI QIDQ4297174zbMATH OpenFDO

Authors Sergei Tupailo

Publication date 24 November 1994

zbMATH Keywords

arithmetical comprehensionaxiom of choiceHilbert's epsilon-axiomnormalization proofsecond-order arithmetictransfinite induction

Mathematics Subject Classification ID

Axiom of choice and related propositions (03E25) Cut-elimination and normal-form theorems (03F05) Second- and higher-order arithmetic and fragments (03F35)

Recommendations

• Arithmetical proofs of strong normalization results for symmetric lambda calculi
• Explicit Composition and Its Application in Proofs of Normalization
• Typed Lambda Calculi and Applications
• A normal form for arithmetical derivations implying the \(\omega\)-consistency of arithmetic
• Normalization and axiomatization for numerical dependencies
• Normalization, approximation, and semantics for combinator systems
• On the likelihood of normalization in combinatory logic
• Normalization proof for Peano arithmetic
• On Normalisation of Infinitary Combinatory Reduction Systems
• Normalization in the simply typed -calculus

Cited in

(1)

• scientific article; zbMATH DE number 218499 (Why is no real title available?)

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 Q4297174)