The recent BES Collaboration data on ψ ′ → P V , particularly the isospin violating mode ψ ′ → π 0 ω 0 and finding of a finite number for B(ψ ′ → K * 0 K 0), enable us now to deal more precisely about the challenges to theory concerning this extraordinary and remarkable so called ρ − π Puzzle of J/ψ and ψ ′ Decays. In terms of existing data, and deploying the simplest phenomenol-ogy, measuremen...

Professor Ryszard Wójcicki once asked whether the degree of maxi-mality of the consequence operation C determined by the theorems of the intuitionistic propositional logic and the detachment rule for the implication connective is equal to 2 2 ℵ 0 ? The aim of the paper is to give the affirmative answer to the question. More exactly, it is proved here that the degree of maximality of C Ψ-the Ψ-f...

The nuclear modification of J/ψ production has been studied at forward and backward rapidity in the collision systems p+Al, p+Au, 3He+Au. A comparison results for p+Au 3He+Au is presented, with a focus on possible differences caused by different particle multiplicity final state. ψ(2S) collisions also as function centrality. complement earlier mid-rapidity RHIC energies obtained LHC energies, r...

Using a sample of (10.09±0.04)×109 J/ψ events collected with the BESIII detector, partial wave analysis J/ψ→γη′η′ is performed. The masses and widths observed resonances their branching fractions are reported. main contribution from J/ψ→γf0(2020) f0(2020)→η′η′, which found significance greater than 25σ. product fraction B(J/ψ→γf0(2020))·B(f0(2020)→η′η′) measured to be (2.63±0.06(stat.)−0.46+0.3...

R. Meyer and E. Mares [10] studied the logic CNR, a classical relevant logic with a modal connective. Such logic is of type S4. As it has been noted in [10], the addition of a modal operator in the language of classical relevant logic and the axioms φ ∧ ψ → (φ ∧ ψ) and (φ ∧ ψ) → ( φ ∧ ψ) do not necessarily produce theorems such that as (φ→ ψ) → φ → ψ or (♦φ→ ψ) → (φ→ ψ). These formulas are well...

In 1967 Harary, Hedetniemi, and Prins showed that every graph G admits a complete t-coloring for t with χ(G)≤t≤ψ(G), where χ(G) denotes the chromatic number of ψ(G) achromatic which is maximum r r-coloring. Recently, Edwards Rza̧żewski (2020) this result fails hypergraphs by proving integer k k≥9, there exists k-uniform hypergraph H χ(H)-coloring ψ(H)-coloring, but no some χ(H)<t<ψ(H). They also...