A simple proof of the undecidability of strong normalisation (Q4405686): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1017/s096012950200381x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2152333061 / rank | |||
Normal rank | |||
Latest revision as of 10:02, 30 July 2024
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
23 June 2003
0 references
undecidability
0 references
pure lambda calculus
0 references
partial recursive function
0 references
Church numeral
0 references
