Computing with Böhm trees

René David (1)

1 LAMA - Laboratoire de Mathématiques

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.

Domaines: Logique [math.LO]; Logique en informatique [cs.LO]

René David. Computing with Böhm trees. Fundamenta Informaticae, 2001, 45 (1,2), pp.53-77. ⟨hal-00384676⟩