In this paper, we will show the Carleson measure characterizations for the boundedness and compactness of the Cesàro-type operator

\begin{equation*}\mathcal{C}_{\mu}(f)(z)=\sum^{\infty}_{n=0}\left( \int_{[0,1)}t^nd\mu(t)\right) \left(\sum^{n}_{k=0}a_k \right)z^n, \quad z\in \mathbb{D},\end{equation*}

acting on a number of important analytic function spaces on $\mathbb{D}$, where µ is a positive finite Borel measure. The function spaces are some newly appeared analytic function spaces (e.g., Bergman–Morrey spaces $A^{p,\lambda}$ and Dirichlet–Morrey spaces $\mathcal{D}_p^{\lambda}$) . This work continues the lines of the previous characterizations by Blasco and Galanopoulos et al. for classical Hardy spaces and weighted Bergman spaces and so forth.

We present a new proof of the compactness of bilinear paraproducts with CMO symbols. By drawing an analogy to compact linear operators, we first explore further properties of compact bilinear operators on Banach spaces and present examples. We then prove compactness of bilinear paraproducts with CMO symbols by combining one of the properties of compact bilinear operators thus obtained with vanishing Carleson measure estimates and interpolation of bilinear compactness.

In this note we study a counterpart in predicate logic of the notion of logical friendliness, introduced into propositional logic in [15]. The result is a new consequence relation for predicate languages with equality using first-order models. While compactness, interpolation and axiomatizability fail dramatically, several other properties are preserved from the propositional case. Divergence is diminished when the language does not contain equality with its standard interpretation.

We prove that it is consistent that Club Stationary Reflection and the Special Aronszajn Tree Property simultaneously hold on $\omega _2$ , thereby contributing to the study of the tension between compactness and incompactness in set theory. The poset which produces the final model follows the collapse of an ineffable cardinal first with an iteration of club adding (with anticipation) and second with an iteration specializing Aronszajn trees.

In the first part of the paper, we prove a general theorem about specializing Aronszajn trees on $\omega _2$ after forcing with what we call $\mathcal {F}$ -Strongly Proper posets, where $\mathcal {F}$ is either the weakly compact filter or the filter dual to the ineffability ideal. This type of poset, of which the Levy collapse is a degenerate example, uses systems of exact residue functions to create many strongly generic conditions. We prove a new result about stationary set preservation by quotients of this kind of poset; as a corollary, we show that the original Laver–Shelah model, which starts from a weakly compact cardinal, satisfies a strong stationary reflection principle, although it fails to satisfy the full Club Stationary Reflection. In the second part, we show that the composition of collapsing and club adding (with anticipation) is an $\mathcal {F}$ -Strongly Proper poset. After proving a new result about Aronszajn tree preservation, we show how to obtain the final model.

We study the boundedness and compactness of weighted composition operators acting on weighted Bergman spaces and weighted Dirichlet spaces by using the corresponding Carleson measures. We give an estimate for the norm and the essential norm of weighted composition operators between weighted Bergman spaces as well as the composition operators between weighted Hilbert spaces.

This paper deals with the multi-objective optimal design of a novel 6-degree of freedom (DOF) hybrid spray-painting robot. Its kinematic model is obtained by dividing it into serial and parallel parts. The dynamic equation is formulated by virtual work principle. A performance index for evaluating the compactness of robot is presented. Taking compactness, motion/force transmissibility, and energy consumption as performance indices, the optimal geometric parameters of the robot are selected in the Pareto-optimal set by constructing a comprehensive performance index. This paper is very useful for the development of the spray-painting robot.

A new characterization of $\text {CMO}(\mathbb R^n)$ is established replying upon local mean oscillations. Some characterizations of iterated compact commutators on weighted Lebesgue spaces are given, which are new even in the unweighted setting for the first order commutators.

The optimum selection of a structure for a given application is a capital phase in typological synthesis of parallel robots. To help in this selection, this paper presents a performance evaluation of four translational parallel robots: Delta, 3-UPU, Romdhane-Affi-Fayet, and Tri-pyramid (TP). The problem is set as a multiobjective optimization using genetic algorithm methods, which uses kinematic criteria, that is, global dexterity and compactness, to ensure a prescribed workspace. The results are presented as Pareto fronts, which are used to compare the performances of the aforementioned structures. The obtained results show that the TP robot has the best kinematic performance, whereas the 3-UPU robot is the most compact for a given prescribed workspace.

First-order formalisations are often preferred to propositional ones because they are thought to underwrite the validity of more arguments. We compare and contrast the ability of some well-known logics—these two in particular—to formally capture valid and invalid arguments. We show that there is a precise and important sense in which first-order logic does not improve on propositional logic in this respect. We also prove some generalisations and related results of philosophical interest. The rest of the article investigates the results’ philosophical significance. A first moral is that the correct way to state the oft-cited superiority of first-order logic vis-à-vis propositional logic is more nuanced than often thought. The second moral concerns semantic theory; the third logic’s use as a tool for discovery. A fourth and final moral is that second-order logic’s transcendence of first-order logic is greater than first-order logic’s transcendence of propositional logic.

We prove that if p > 1, $w\in A_p^ +$, b ∈ CMO and $C_b^ + $ is the commutator with symbol b of a Calderón–Zygmund convolution singular integral with kernel supported on (−∞, 0), then $C_b^ + $ is compact from Lp(w) into itself.