Decidability of All Minimal Models (Revised Version - 2012)
Vincent Padovani (PPS)

TL;DR
This paper presents a shorter, more readable proof demonstrating that determining the existence of all minimal models is a decidable problem, based on cellular terms in observational equivalence classes.
Contribution
It provides an alternative, simplified proof of the decidability of all minimal models, improving understanding and accessibility.
Findings
Decidability of all minimal models established
Existence of cellular terms in each observational class proven
Simplified proof enhances theoretical understanding
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Formal Methods in Verification · Logic, Reasoning, and Knowledge
