We give necessary and sufficient conditions for the boundedness of generalized fractional integral maximal operators on Orlicz–Morrey weak spaces. To do this, we prove weak–weak type modular inequality Hardy–Littlewood operator with respect to Young function. spaces contain L p $L^p$ ( 1 ≤ ∞ $1\le p\le \infty$ ), Orlicz spaces, Morrey as special cases. Hence, get these function corollaries.

In this paper we revisit Wiener’s method (IEEE-IT 1990) of continued fraction (CF) to find new weaknesses in RSA. We consider RSA with N = pq, q < p < 2q, public encryption exponent e and private decryption exponent d. Our motivation is to find out when RSA is insecure given d is O(N), where we are mostly interested in the range 0.3 ≤ δ ≤ 0.5. Given ρ (1 ≤ ρ ≤ 2) is known to the attacker, we sh...

This complements the work of [2] on the construction of scales of minimal complexity on sets of reals in K(R). Theorem 0.1 was proved there under the stronger hypothesis that all sets definable over M are determined, although without the capturing hypothesis. (See [2, Theorem 4.14].) Unfortunately, this is more determinacy than would be available as an induction hypothesis in a core model induc...

Starting from a logic which speciies how to make deductions from a set of sentences (a ``at theory'), a way to generalise this to a partially ordered bag of sentences (a `structured theory') is given. The partial order is used to resolve connicts. If occurs below then is accepted only insofar as it does not connict with. We start with a language L, a set of interpretations M and a satisfaction ...

The paper studies the weighted weak type inequalities for the Hardy operator as an operator from weighted L to weighted weak L in the case p = 1. It considers two different versions of the Hardy operator and characterizes their weighted weak type inequalities when p = 1. It proves that for the classical Hardy operator, the weak type inequality is generally weaker when q < p = 1. The best consta...

In this paper, we establish the relationships between spaces with a compact-countable weak-base and spaces with various compact-countable networks, and give two mapping theorems on spaces with compact-countable weakbases. Weak-bases and g-first countable spaces were introduced by A.V.Arhangel’skii [1]. Spaces with a point-countable weak-base were discussed in [5,6], and spaces with a locally co...

where 1 sp < co. This definition is far from being intrinsic. For an intrinsic definition of WrTp(Mm, N”) see [ 11. In this space, beside the standard topology induced by the norm (1. ]ll,p, we also have weak topology and weak convergence. Let fk, f E W’~p(Mm), where 1 < p < co. We say that fk converges to f in weak topology iff fk + f in Lp and the set (lIVfk[lp)k is bounded. Weak convergence ...

It is wellknown that Minker’s semantics GCWA for positive disjunctive programs P is ΠP2 -complete , i.e. to decide if a literal is true in all minimal models of P . This is in contrast to the same entailment problem for semantics of non-disjunctive programs such as STABLE and SUPPORTED (both are co-NP-complete) as well as Msupp P and WFS (that are even polynomial). Recently, the idea of reducin...

A mass problem is a set of Turing oracles. If P and Q are mass problems, we say that P is weakly reducible to Q if for all Y ∈ Q there exists X ∈ P such that X is Turing reducible to Y . A weak degree is an equivalence class of mass problems under mutual weak reducibility. Let Pw be the lattice of weak degrees of mass problems associated with nonempty Π1 subsets of the Cantor space. The lattice...

We argue that weak containment is an appropriate notion of amenability for inverse semigroups. Given an inverse semigroup S and a homomorphism φ of S onto a group G, we show, under an assumption on ker(φ), that S has weak containment if and only if G is amenable and ker(φ) has weak containment. Using Fell bundle amenability, we find a related result for inverse semigroups with zero. We show tha...