By means of the function induced by a logical formulaA, the concept of truth degree of the logical formulaAis introduced in the 3-valued pre-rough logic in this paper. Moreover, similarity degrees among formulas are proposed and a pseudometric is defined on the set of formulas, and hence a possible framework suitable for developing approximate reasoning theory in 3-value logic pre-rough logic is established.
We generalize a result of Flenner, proved in characteristic zero, to positive characteristics. We prove that the first syzygy bundle, [Formula: see text], of the line bundle [Formula: see text] over [Formula: see text] is semistable, for a certain infinite set of integers d ≥ 0. Moreover, for arbitrary d, there is a "good enough estimate" on [Formula: see text] in terms of d and n; thus a strong restriction theorem of Langer, proved earlier for characteristic k > d, is valid in arbitrary characteristics.
AbstractLocal isomorphism constitutes the regulatory, cognitive and normative profile of a host country. The regulatory institutional setting reflects the rules and legislation governing collective bargaining agreements, trade unions, local content laws and employment relationships. The cultural or cognitive dimension supports the widely held cultural and social knowledge and the normative profile acknowledges the influences of social groups and organizations on acceptable normative behaviour. Earlier literature lends support to the importance of institutional profile and its influence on the design and implementation of multinational enterprises’ human resource management policies and practices. This paper seeks to advance the concept of local isomorphism and highlight the implications of local isomorphism for future research on the transfer of multinational enterprises’ human resource management practices across and between subsidiaries.
It is known that every digital covering map p:(E,k) ? (B,?) has the
unique path lifting property. In this paper, we show that its inverse is
true when the continuous surjective map p has no conciliator point. Also, we
prove that a digital (k,?)-continuous surjection p:(E,k)? (B,?) is a
digital covering map if and only if it is a local isomorphism, when all
digital spaces are connected. Moreover, we find out a loop criterion for a
digital covering map to be a radius n covering map.
Let $\text{H}$ be a subgroup of some locally compact group $\text{G}$. Assume that $\text{H}$ is approximable by discrete subgroups and that $\text{G}$ admits neighborhood bases which are almost invariant under conjugation by finite subsets of $\text{H}$. Let $m:\text{G}\rightarrow \mathbb{C}$ be a bounded continuous symbol giving rise to an $L_{p}$-bounded Fourier multiplier (not necessarily completely bounded) on the group von Neumann algebra of $\text{G}$ for some $1\leqslant p\leqslant \infty$. Then, $m_{\mid _{\text{H}}}$ yields an $L_{p}$-bounded Fourier multiplier on the group von Neumann algebra of $\text{H}$ provided that the modular function ${\rm\Delta}_{\text{G}}$ is equal to 1 over $\text{H}$. This is a noncommutative form of de Leeuw’s restriction theorem for a large class of pairs $(\text{G},\text{H})$. Our assumptions on $\text{H}$ are quite natural, and they recover the classical result. The main difference with de Leeuw’s original proof is that we replace dilations of Gaussians by other approximations of the identity for which certain new estimates on almost-multiplicative maps are crucial. Compactification via lattice approximation and periodization theorems are also investigated.
Truth Degrees Theory and Approximate Reasoning in 3-Valued Propositional Pre-Rough Logic