We used the following principle to represent "is-a-kind-of" relations between concepts: If a concept A belongs to the concept class B, then the icon for B should be visible in the icon for A. For example, heart failure belongs to the class of cardiac diseases, and thus the icon for cardiac diseases should be visible in the icon for heart failure.
In Section 2, we derive a basic relation of the Laplace transform of meeting time in Theorems 1 and 2. This result is just a kind of harmonic relation and an extension of that for first hitting times, but plays an important role to get exact value of meeting and infection times.
However, when thinking in term of diseases, these relations translate into "is-a-kind-of" relations, e.g. bronchial diseases are a kind of respiratory diseases.
However, VCM icons include a central pictogram, an external shape and possibly a top right pictogram, each of them having up to 3 levels of "is-a-kind-of" relations, potentially leading to a total of 9 levels.
Rather, a self-predication claim asserts that there is a special primitive kind of ontological relation between a Form (subject) and its essence (predicate).
The transcriptional relation between a TF and a TG is a kind of regulatory relation.
Wright, in particular, suggests that in certain domains of discourse what we say is true in virtue of a correspondence-like relation, while in others it is its true in virtue of a kind of assertibility relation that is closer in spirit to the anti-realist views we have just discussed.
The simplest kinds of state-of-affairs consist of a relation, individuals related by the relation, and a polarity, and might be represented as in (8): Arguments of a relation may be parameterized, as in (9): Parameterized roles can be anchored to individuals.
This is the view that a certain kind of resemblance relation holds between entities of a particular type (for more on resemblance nominalism, see Armstrong 1989, 39 58).
The number of levels of "is-a-kind-of" relations that can be represented is limited by the pictogram complexity because deeper relations would imply more complex pictograms.
