Relative definability and models of Unary PCF
Résumé
We show that the poset of degrees of relative definability in the Scott model of Unary PCF is non trivial, and that, nevertheless, the hierarchy of order extensional models of the language is reduced to a bottom element (the fully abstract model) and a top one (the Scott model itself).
Domaines
Logique en informatique [cs.LO]
Origine : Fichiers produits par l'(les) auteur(s)