On decidability of the decomposability problem for finite theories (Q630293): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11202-010-0068-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2011298343 / rank | |||
Normal rank | |||
Revision as of 01:07, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On decidability of the decomposability problem for finite theories |
scientific article |
Statements
On decidability of the decomposability problem for finite theories (English)
0 references
17 March 2011
0 references
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.
0 references
decomposition of a theory
0 references
Horn theory
0 references
logic programming
0 references
decomposable theory
0 references
monadic logic
0 references
