Related papers: Preassociative aggregation functions
In this paper we demonstrate that the class of basic feasible functionals has recursion theoretic properties which naturally generalize the corresponding properties of the class of feasible functions. We also improve the Kapron - Cook…
In the framework of graphs, we study abstract elementary classes (aecs). In this work we analyze several properties of Forb(G) and versions of Forb-Con(G) in the context of aecs and we present some examples of classes of graphs which…
We propose a wide class of preferential attachment models of random graphs, generalizing previous approaches. Graphs described by these models obey the power-law degree distribution, with the exponent that can be controlled in the models.…
We introduce a nonlinear aggregation type classifier for functional data defined on a separable and complete metric space. The new rule is built up from a collection of $M$ arbitrary training classifiers. If the classifiers are consistent,…
We discuss the classes $\fC$, $\fM$, and $\fS$ of analytic functions that can be realized as the Liv\v{s}ic characteristic functions of a symmetric densely defined operator $\dot A$ with deficiency indices $(1,1)$, the Weyl-Titchmarsh…
We introduce semicontinuous summation methods for series of fuzzy numbers and give Tauberian conditions under which summation of a series of fuzzy numbers via generalized Dirichlet series and via generalized factorial series implies its…
We provide an introduction of some basic facts of uniformly almost periodic functions, such as Fourier series representations. A result is then proved about Fourier coefficients which is a generalization of the purely periodic case. We then…
For $-1\leq B<A\leq 1$, let $\mathcal{S}^*(A,B)$ denote the class of Janowski starlike functions which satisfy the subordination relation $zf'(z)/f(z)\prec (1+Az)/(1+Bz)$. In the present article, we determine the sharp of pre-Schwarzian…
Let $\mathcal{A}$ denote the class of analytic functions $f$ on the unit disc $\mathbb{D}=\{z\in\mathbb{C}:\;|z|<1\}$ normalized by $f(0)=0$ and $f^{\prime}(0)=1$. In the present article, we consider and $\mathcal{F}(c)$ the subclasses of…
We give a completely elementary study for averages of short correlations of so-called sieve functions (a pretty general class of arithmetic functions).
We provide a description of the class of n-ary operations on an arbitrary chain that are quasitrivial, symmetric, nondecreasing, and associative. We also prove that associativity can be replaced with bisymmetry in the definition of this…
We present a unified categorical treatment of completeness theorems for several classical and intuitionistic infinitary logics with a proposed axiomatization. This provides new completeness theorems and subsumes previous ones by G\"odel,…
The concepts of amenable and compatible functions have been introduced in a recent work, in order to state precise mathematical theorems that guarantee that a backward stable algorithm is also forward stable, and that the composition of two…
We provide necessary and sufficient conditions for operator-valued functions on arbitrary sets associated with a collection of test functions to have factorizations in several situations.
The fuzzy modality `probably` is interpreted over probabilistic type spaces by taking expected truth values. The arising probabilistic fuzzy description logic is invariant under probabilistic bisimilarity; more informatively, it is…
Based on the concept of new type of statistical convergence defined by Aktuglu, we have introduced the weighted $\alpha\beta$ - statistical convergence of order $\theta$ in case of fuzzy functions and classified it into pointwise, uniform…
For functions $f(z)= z+ a_2 z^2 + a_3 z^3 + \cdots$ in various subclasses of normalized analytic functions, we consider the problem of estimating the generalized Zalcman coefficient functional $\phi(f,n,m;\lambda):=|\lambda a_n a_m…
To strengthen the effectiveness of approximate reasoning in fuzzy modus ponens (FMP) and fuzzy modus tollens (FMT) problems, three approximate reasoning schemes with aggregation functions are developed and their validity is respectively…
We bring forward a logical system of transition algebras that enhances many-sorted first-order logic using features from dynamic logics. The sentences we consider include compositions, unions, and transitive closures of transition…
We provide a "shared axiomatization" of natural numbers and hereditarily finite sets built around a polymorphic abstraction of bijective base-2 arithmetics. The "axiomatization" is described as a progressive refinement of Haskell type…