Computing with Böhm trees
David, René
HAL, hal-00384676 / Harvested from HAL
Text on HAL
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.
Publié le : 2001-01-01
Classification:  [MATH.MATH-LO]Mathematics [math]/Logic [math.LO],  [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO] 
@article{hal-00384676,
     author = {David, Ren\'e},
     title = {Computing with B\"ohm trees},
     journal = {HAL},
     volume = {2001},
     number = {0},
     year = {2001},
     language = {en},
     url = {http://dml.mathdoc.fr/item/hal-00384676}
}

David, René. Computing with Böhm trees. HAL, Tome 2001 (2001) no. 0, . http://gdmltest.u-ga.fr/item/hal-00384676/