A simple proof of the undecidability of strong normalisation

DOI10.1017/S096012950200381XMaRDI QIDQ4405686zbMATH OpenOpenAlexFDO

Authors Paweł Urzyczyn

Publication date 23 June 2003

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s096012950200381x

zbMATH Keywords

Church numeralpartial recursive functionpure lambda calculusundecidability

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Recommendations

• An elementary proof of strong normalization for intersection types
• Strong normalization and typability with intersection types
• scientific article; zbMATH DE number 2061702
• Short Proofs of Strong Normalization
• scientific article; zbMATH DE number 4045709

Cited in

(7)

• The ant-lion paradigm for strong normalization
• The completeness of BCD for an operational semantics
• A simple proof of the undecidability of inhabitation in λP
• scientific article; zbMATH DE number 1189064 (Why is no real title available?)
• scientific article; zbMATH DE number 7393562 (Why is no real title available?)
• A short proof of the decidability of normalization in recursive program schemes
• Strong normalization from an unusual point of view

This page was built for publication: A simple proof of the undecidability of strong normalisation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4405686)