Decidability of All Minimal Models (Revised Version - 2012)

Vincent Padovani (1)

1 PPS - Preuves, Programmes et Systèmes

This unpublished note is an alternate, shorter (and hopefully more readable) proof of the decidability of all minimal models. The decidability follows from a proof of the existence of a cellular term in each observational equivalence class of a minimal model.

Mots clés: lambda calculus; minimal model; decidability

Domaines: Logique en informatique [cs.LO]

Vincent Padovani. Decidability of All Minimal Models (Revised Version - 2012). 2012. ⟨hal-00741219⟩