not assume how or in what context the represented knowledge will be used (Hayes 1977). Simply stated, logical inferences based on valid logical statements never result in invalid conclusions. The consistency of firstorder logic is appealing, but it comes at a cost: All knowledge must be stated categorically; no possible occurrences or partially achievable goals can exist. This consistency prope...

We study entanglement properties of hypergraph states in arbitrary finite dimension. compute multipartite elementary qudit states, namely those endowed with a single maximum-cardinality hyperedge. show that, analogously to the qubit case, also for dimension there exists lower bound connected states; this is given by an equal-dimension state featuring same number qudits as largest-cardinality hi...

Using the QCD sum rule approach, we show that the flavor-nonsinglet H dibaryon states with Jπ = 1+, Jπ = 0+, I=1 (27plet) are nearly degenerate with the Jπ = 0+, I=0 singlet H0 dibaryon, which has been predicted to be stable against strong decay, but has not been observed. Our calculation, which does not require an instanton correction, suggests that the H0 is slightly heavier than these flavor...

Let $R$ be a commutative ring with identity and let $M$ be an $R$-module. A proper submodule $P$ of $M$ is called strongly prime submodule if $(P + Rx : M)ysubseteq P$ for $x, yin M$, implies that $xin P$ or $yin P$. In this paper, we study more properties of strongly prime submodules. It is shown that a finitely generated $R$-module $M$ is Artinian if and only if $M$ is Noetherian and every st...

The prime graph of a finite group $G$ is denoted by$ga(G)$. A nonabelian simple group $G$ is called quasirecognizable by primegraph, if for every finite group $H$, where $ga(H)=ga(G)$, thereexists a nonabelian composition factor of $H$ which is isomorphic to$G$. Until now, it is proved that some finite linear simple groups arequasirecognizable by prime graph, for instance, the linear groups $L_...

let  $r$ be a commutative noetherian ring and $i$ be an ideal of $r$. we say that $i$ satisfies the persistence property if  $mathrm{ass}_r(r/i^k)subseteq mathrm{ass}_r(r/i^{k+1})$ for all positive integers $kgeq 1$, which $mathrm{ass}_r(r/i)$ denotes the set of associated prime ideals of $i$. in this paper, we introduce a class of square-free monomial ideals in the polynomial ring  $r=k[x_1,ld...

in this paper, we give a generalization of the integral dependence from rings to modules. we study the stability of the integral closure with respect to various module theoretic constructions. moreover, we introduce the notion of integral extension of a module and prove the lying over, going up and going down theorems for modules.

the prime graph $gamma(g)$ of a group $g$ is a graph with vertex set $pi(g)$, the set of primes dividing the order of $g$, and two distinct vertices $p$ and $q$ are adjacent by an edge written $psim q$ if there is an element in $g$ of order $pq$. let $pi(g)={p_{1},p_{2},...,p_{k}}$. for $pinpi(g)$, set $deg(p):=|{q inpi(g)| psim q}|$, which is called the degree of $p$. we also set $d(g):...

‎let $g$ be a finite group‎. ‎in [ghasemabadi et al.‎, ‎characterizations of the simple group ${}^2d_n(3)$ by prime graph‎ ‎and spectrum‎, ‎monatsh math.‎, ‎2011] it is‎ ‎proved that if $n$ is odd‎, ‎then ${}^2d _n(3)$ is recognizable by‎ ‎prime graph and also by element orders‎. ‎in this paper we prove‎ ‎that if $n$ is even‎, ‎then $d={}^2d_{n}(3)$ is quasirecognizable by‎ ‎prime graph‎, ‎i.e‎...