Document type
ArticleVersion
Published versionPublication date
All rights reserved
Please use this identifier to cite or link to this item: https://hdl.handle.net/2445/7625
The free roots of the complete graph
Journal Title
Director/Tutor
Journal ISSN
Volume Title
Related resource
Abstract
There is a model-completion Tn of the theory of a (reflexive) ncoloured
graph (X, R1,...,Rn) such that Rn is total, and Ri ◦ Rj ⊆ Ri+j for
all i, j. For n > 2, the theory Tn is not simple, and does not have the strict
order property. The theories Tn combine to yield a non-simple theory T∞
without the strict order property, which does not eliminate hyperimaginaries.
Subject
Subject (English)
Citation
Citation
CASANOVAS RUIZ-FORNELLS, Enrique and WAGNER, Frank O. (Frank Olaf). The free roots of the complete graph. Proceedings of the American Mathematical Society. 2003. Vol. 132, num. 5, pags. 1543-1548. ISSN 1088-6826. [consulted: 15 of June of 2026]. Available at: https://hdl.handle.net/2445/7625