Decidable fragments of many-sorted logic

Aharon Abadi*, Alexander Rabinovich, Mooly Sagiv

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

24 Scopus citations


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.

Original languageEnglish
Pages (from-to)153-172
Number of pages20
JournalJournal of Symbolic Computation
Issue number2
StatePublished - Feb 2010


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


Dive into the research topics of 'Decidable fragments of many-sorted logic'. Together they form a unique fingerprint.

Cite this