The Robinson property and amalgamations of higher arities

Abstract

In this article we discuss a version of the Robinson property studied recently by Gyenis in , and we present a solution to one of his open problems. We say that a first‐order structure satisfies the Robinson property whenever the union of two non‐trivial partial n‐types over different finite sets is realizable if and only if they are not explicitly contradictory. In his article, Gyenis showed that a universal, homogeneous structure over a language that consists of at most binary relation symbols satisfies the Robinson property if and only if its age has a generalized amalgamation property (the so called prescribed amalgamation property, PAP). We go further and define a series of new kinds of amalgamation properties, APn for any natural number n. Using these properties we can characterize all universal and homogeneous structures that satisfy the Robinson property independently from the arities of relation symbols of the language.