Unary PCF is decidable (Q1274980)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Unary PCF is decidable |
scientific article; zbMATH DE number 1238726
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Unary PCF is decidable |
scientific article; zbMATH DE number 1238726 |
Statements
Unary PCF is decidable (English)
0 references
12 January 1999
0 references
Lambda calculus
0 references
PCF
0 references
decidability
0 references
definability
0 references
