Type-amalgamation properties and polygroupoids in stable theories

, &
Journal of Mathematical Logic 15 (1):1550004 (2015)
  Copy   BIBTEX

Abstract

We show that in a stable first-order theory, the failure of higher dimensional type amalgamation can always be witnessed by algebraic structures that we call n-ary polygroupoids. This generalizes a result of Hrushovski in [16] that failures of 4-amalgamation are witnessed by definable groupoids. The n-ary polygroupoids are definable in a mild expansion of the language.

Categories

Keywords

Reprint years

DOI

10.1142/s021906131550004x

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 103,748

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Failure of n -uniqueness: a family of examples.Elisabetta Pastori & Pablo Spiga - 2011 - Mathematical Logic Quarterly 57 (2):133-148.
Products of Classes of Finite Structures.Vince Guingona, Miriam Parnes & Lynn Scow - 2023 - Notre Dame Journal of Formal Logic 64 (4):441-469.
Disjoint $n$ -Amalgamation and Pseudofinite Countably Categorical Theories.Alex Kruckman - 2019 - Notre Dame Journal of Formal Logic 60 (1):139-160.
Amalgamation properties and finite models in L n -theories.John Baldwin & Olivier Lessmann - 2002 - Archive for Mathematical Logic 41 (2):155-167.
On definability of types and relative stability.Viktor Verbovskiy - 2019 - Mathematical Logic Quarterly 65 (3):332-346.
n-Simple theories.Alexei S. Kolesnikov - 2005 - Annals of Pure and Applied Logic 131 (1-3):227-261.
Stable Definability and Generic Relations.Byunghan Kim & Rahim Moosa - 2007 - Journal of Symbolic Logic 72 (4):1163 - 1176.
Some definable types that cannot be amalgamated.Martin Hils & Rosario Mennuni - 2023 - Mathematical Logic Quarterly 69 (1):46-49.
Generalized amalgamation and n -simplicity.Byunghan Kim, Alexei S. Kolesnikov & Akito Tsuboi - 2008 - Annals of Pure and Applied Logic 155 (2):97-114.
On enveloping type-definable structures.Cédric Milliet - 2011 - Journal of Symbolic Logic 76 (3):1023 - 1034.

Analytics

Added to PP
2015-07-11

Downloads
47 (#508,357)

6 months
11 (#303,202)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Disjoint $n$ -Amalgamation and Pseudofinite Countably Categorical Theories.Alex Kruckman - 2019 - Notre Dame Journal of Formal Logic 60 (1):139-160.
On the n-uniqueness of types in rosy theories.Byunghan Kim - 2016 - Archive for Mathematical Logic 55 (5-6):677-686.

Add more citations

References found in this work

Classification Theory and the Number of Nonisomorphic Models.S. Shelah - 1982 - Journal of Symbolic Logic 47 (3):694-696.
Generalized amalgamation and n -simplicity.Byunghan Kim, Alexei S. Kolesnikov & Akito Tsuboi - 2008 - Annals of Pure and Applied Logic 155 (2):97-114.

View all 6 references / Add more references