A simple proof of the undecidability of strong normalisation (Q4405686)

From MaRDI portal
Revision as of 09:02, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1933105
Language Label Description Also known as
English
A simple proof of the undecidability of strong normalisation
scientific article; zbMATH DE number 1933105

    Statements

    A simple proof of the undecidability of strong normalisation (English)
    0 references
    0 references
    23 June 2003
    0 references
    undecidability
    0 references
    pure lambda calculus
    0 references
    partial recursive function
    0 references
    Church numeral
    0 references

    Identifiers