A simple proof of the undecidability of strong normalisation (Q4405686)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1933105
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8332754969596863
0 references
0.8190326690673828
0 references
0.7893307209014893
0 references
