Decidability of All Minimal Models (Revised Version - 2012)
Logic in Computer Science
2012-10-15 v1
Abstract
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.
Cite
@article{arxiv.1210.3599,
title = {Decidability of All Minimal Models (Revised Version - 2012)},
author = {Vincent Padovani},
journal= {arXiv preprint arXiv:1210.3599},
year = {2012}
}