Abstract
We prove that each elementary theory has a unique decomposition into indecomposable components and formulate a decomposability criterion.
Similar content being viewed by others
References
Palchunov D., “GABEK for ontology generation,” in: Integration and Learning in Organizations, Eds.: J. Zelger, P. Herdina, A. Oberprantacher, LIT-publ. Comp., Wien, 2005. Bd. II.
Amir E. and McIlraith S., “Partition-based logical reasoning for first-order and propositional theories,” Artificial Intelligence, 162, No. 1–2, 49–88 (2005).
Cuenca-Grau B., Parsia B., Sirin E., and Kalyanpur A., “Modularity and Web ontologies,” in: Proc. KR2006, 2006, pp. 198–208.
Lutz C., Walther D., and Wolter F., “Conservative extensions in expressive description logics,” in: Proc. IJCAI-07, 2007, pp. 453–458.
Chang C. C. and Keisler H. J., Model Theory, North-Holland, Amsterdam (1973).
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text Copyright © 2008 Ponomaryov D. K.
The author was supported by the Russian Foundation for Basic Research (Grant 05-01-04003-NNIO_a) and DFG project COMO, GZ: 436 RUS 113/829/0-1.
__________
Translated from Sibirskiĭ Matematicheskiĭ Zhurnal, Vol. 49, No. 1, pp. 189–192, January–February, 2008.
Rights and permissions
About this article
Cite this article
Ponomaryov, D. A decomposability criterion for elementary theories. Sib Math J 49, 152–154 (2008). https://doi.org/10.1007/s11202-008-0015-y
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s11202-008-0015-y