Computing with Böhm trees
Résumé
I develop a technic to compute with Böhm trees. This gives a proof of R.Kerth's conjecture on unsolvable terms. This also gives a syntactical proof of Hyland and Wadsworth's theorem.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...