The free roots of the complete graph

dc.contributor.authorCasanovas Ruiz-Fornells, Enriquecat
dc.contributor.authorWagner, Frank O. (Frank Olaf), 1964-cat
dc.date.accessioned2009-04-06T08:02:36Z
dc.date.available2009-04-06T08:02:36Z
dc.date.issued2003cat
dc.description.abstractThere 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.
dc.format.extent6 p.cat
dc.format.mimetypeapplication/pdfcat
dc.identifier.idgrec506756ca
dc.identifier.issn1088-6826cat
dc.identifier.urihttps://hdl.handle.net/2445/7625
dc.language.isoengeng
dc.publisherAmerican Mathematical Societycat
dc.relation.isformatofReproducció digital del document publicat en format paper, proporcionada per AMS http://www.ams.org/proc/2004-132-05/S0002-9939-03-07193-4/S0002-9939-03-07193-4.pdfcat
dc.relation.ispartofProceedings of the American Mathematical Society, 2003, vol. 132, núm. 5, p. 1543-1548.eng
dc.rights(c) American Mathematical Society, 2003cat
dc.rights.accessRightsinfo:eu-repo/semantics/openAccess
dc.sourceArticles publicats en revistes (Matemàtiques i Informàtica)
dc.subject.classificationTeoria de modelscat
dc.subject.otherModel theoryeng
dc.subject.otherClassification theoryeng
dc.titleThe free roots of the complete grapheng
dc.typeinfo:eu-repo/semantics/articleeng
dc.typeinfo:eu-repo/semantics/publishedVersion

Fitxers

Paquet original

Mostrant 1 - 1 de 1
Carregant...
Miniatura
Nom:
506756.pdf
Mida:
144.31 KB
Format:
Adobe Portable Document Format