Kind, type, and instance. A binary relation (just relation henceforth) is commonly defined as follow. In the discussion of the properties of relations, I need to refer to three levels of abstraction: kind, type, and instance. The least abstract “relations” are called instances. Whenever in a candidate (or a structure) two or more elements are connected, we say that they are an instance of a relation. The most abstract characterization is the kind. A kind is defined exclusively by the axioms that govern a relation. It defines the set of specific properties that apply to all instances of a relation. This is a fundamental concept because I prove the formal identity of the φ-Correspondence and I/O-Correspondence by showing that they are of the same kind, that is, that they adhere to the same set of properties.
Appears in 2 contracts
Sources: Phonological Agreement Theory, Phonological Agreement Theory
Kind, type, and instance. A binary relation (just relation henceforth) is commonly defined as follow. In the discussion of the properties of relations, I need to refer to three levels of abstraction: kind, type, and instance. The least abstract “relations” are called instances. Whenever in a candidate (or a structure) two or more elements are connected, we say that they are an instance of a relation. The most abstract characterization is the kind. A kind is defined exclusively by the axioms that govern a relation. It defines the set of specific properties that apply to all instances of a relation. This is a fundamental concept because I prove the formal identity of the φ-Correspondence and I/O-Correspondence by showing that they are of the same kind, that is, that they adhere to the same set of properties.
Appears in 1 contract
Sources: Phonological Agreement Theory