Decidable fragments of many-sorted logic

作者：Abadi Aharon^*; Rabinovich Alexander; Sagiv Mooly

来源：Journal of Symbolic Computation, 2010, 45(2): 153-172.

DOI：10.1016/j.jsc.2009.03.003

• Decidable logic
• Many-sorted logic
• The classical decision problem
• Verification
• Transitive closure

Many natural specifications use types. We investigate the decidability of fragments of many-sorted first-order logic. We identified some decidable fragments and illustrated their usefulness by formalizing specifications considered in the literature. Often the intended interpretations of specifications are finite. We prove that the formulas in these fragments are valid iff they are valid over the finite structures. We extend these results to logics that allow a restricted form of transitive closure.
We tried to extend the classical classification of the quantifier prefixes into decidable/undecidable classes to the many-sorted logic. However, our results indicate that a naive extension fails and more subtle classification is needed.

• 出版日期2010-2
• 单位IBM