In this paper, the modal logic interpretation of plausibility and belief measures on an arbitrary universe of discourse, as proposed by Harmanec et al., is further developed by employing notions from set-valued analysis. In a model of modal logic, a multivalued mapping is constructed from the accessibility relation and a mapping determined by the value assignment function. This multivalued mapp...

Computational and empirical neuroimaging studies have suggested that the anatomical connections between brain regions primarily constrain their functional interactions. Given that the large-scale organization of functional networks is determined by the temporal relationships between brain regions, the structural limitations may extend to the global characteristics of functional networks. Here, ...

We consider A-series modular invariant Virasoro minimal models on the upper half plane. From Lewellen's sewing constraints a necessary form of the bulk and boundary structure constants is derived. Necessary means that any solution can be brought to the given form by rescaling of the fields. All constants are expressed essentially in terms of fusing (F-) matrix elements and the normalisations ar...

A Keith number is a positive integer N with the decimal representation a1a2 . . . an such that n ≥ 2 and N appears in the sequence (Km)m≥1 given by the recurrence K1 = a1, . . . ,Kn = an and Km = Km−1 + Km−2 + · · · + Km−n for m > n. We prove that there are only finitely many Keith numbers using only one decimal digit (i.e., a1 = a2 = · · · = an), and that the set of Keith numbers is of asympto...

Let I1 be a relation structure. We say that I1 is discrete if and only if: (Def. 1) The internal relation of I1 = △the carrier of I1. Let us mention that there exists a poset which is strict discrete and non empty and there exists a poset which is strict discrete and empty. Let X be a set. Then △X is an order in X. Observe that 〈∅,△∅〉 is empty. Let P be an empty relation structure. One can chec...