Strong normalization of barrecursive terms without using infinite terms
From MaRDI portal
Recommendations
- Strong normalization theorem for a constructive arithmetic with definition by transfinite recursion and bar induction
- Normalization of Infinite Terms
- Strong normalisation for the linear term calculus
- Strong normalizability as a finiteness structure via the Taylor expansion of -terms
- Strongly normalizing extensions
- Strong normalisation in the \(\pi\)-calculus
- Infinitary normalization
- Short Proofs of Strong Normalization
- Asymptotically almost all \lambda-terms are strongly normalizing
- Computer Science Logic
Cites work
- Ein starker Normalisationssatz für die bar-rekursiven Funktionale
- Extensional Gödel functional interpretation. A consistency proof of classical analysis
- scientific article; zbMATH DE number 3440411 (Why is no real title available?)
- scientific article; zbMATH DE number 3231083 (Why is no real title available?)
- Strongly majorizable functionals of finite type: A model for barrecursion containing discontinuous functionals
- ÜBER EINE BISHER NOCH NICHT BENÜTZTE ERWEITERUNG DES FINITEN STANDPUNKTES
Cited in
(6)- Strong normalization theorem for a constructive arithmetic with definition by transfinite recursion and bar induction
- Strongly majorizable functionals of finite type: A model for barrecursion containing discontinuous functionals
- On the computational content of the axiom of choice
- A direct proof of Schwichtenberg's bar recursion closure theorem
- scientific article; zbMATH DE number 7269245 (Why is no real title available?)
- Computer Science Logic
This page was built for publication: Strong normalization of barrecursive terms without using infinite terms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3739119)
