On decidability of the decomposability problem for finite theories (Q630293): Difference between revisions

The authors consider the problem of nontrivial representation of a theory as a union of two (or several) theories in disjoint signatures. They prove that for a number of finite signatures this problem is \(\Sigma_1^0\)-complete and, thus, undecidable. This is true already for finite universal Horn theories (theories axiomatized by a finite set of quasi-identities). These theories correspond to the class of logic programs. But if the signature consists only of monadic predicates and constants, the decomposability problem is decidable.