| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10118883 | Annals of Pure and Applied Logic | 2005 | 35 Pages |
Abstract
Full Completeness for ML types (universal closures of quantifier-free types) is proved for this model.
Related Topics
Physical Sciences and Engineering
Mathematics
Logic
Authors
Samson Abramsky, Radha Jagadeesan,