Ranks Based on Strong Amalgamation Fraisse Classes

Abstract: In this paper, we introduce the notion of K-rank, where K is an strong amalgamation Fraisse class. Roughly speaking, the K-rank of a partial type is the number of "copies" of K that can be "independently coded" inside of the type. We study K-rank for specific examples of K, including linear orders, equivalence relations, and graphs. We discuss the relationship of K-rank to other ranks in model theory, including dp-rank and op-dimension (a notion coined by the first author and C. D. Hill in previous work).