scientific article; zbMATH DE number 598799
From MaRDI portal
Publication:4297174
zbMATH Open0799.03069MaRDI QIDQ4297174FDOQ4297174
Publication date: 24 November 1994
Title of this publication is not available (Why is that?)
axiom of choicesecond-order arithmetictransfinite inductionarithmetical comprehensionHilbert's epsilon-axiomnormalization proof
Cut-elimination and normal-form theorems (03F05) Axiom of choice and related propositions (03E25) Second- and higher-order arithmetic and fragments (03F35)
Recommendations
- Normalization, approximation, and semantics for combinator systems 👍 👎
- A normal form for arithmetical derivations implying the \(\omega\)-consistency of arithmetic 👍 👎
- Normalization proof for Peano arithmetic 👍 👎
- Typed Lambda Calculi and Applications 👍 👎
- Normalization and axiomatization for numerical dependencies 👍 👎
- Arithmetical proofs of strong normalization results for symmetric lambda calculi 👍 👎
- On Normalisation of Infinitary Combinatory Reduction Systems 👍 👎
- On the likelihood of normalization in combinatory logic 👍 👎
- Explicit Composition and Its Application in Proofs of Normalization 👍 👎
- Normalization in the simply typed -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 Q4297174)
