Search results for "predicate"
showing 10 items of 216 documents
Analytic extension of non quasi-analytic Whitney jets of Roumieu type
1997
Let (Mr)r∈ℕ0 be a logarithmically convex sequence of positive numbers which verifies M0 = 1 as well as Mr≥ 1 for every r ∈ ℕ and defines a non quasi-analytic class. Let moreover F be a closed proper subset of ℝn. Then for every function ƒ on ℝn belonging to the non quasi-analytic (Mr)-class of Roumieu type, there is an element g of the same class which is analytic on ℝnF and such that Dα ƒ(x) = Dαg(x) for every σ ∈ ƒ0n SBAP and x ∈ F.
Extensions of Representable Positive Linear Functionals to Unitized Quasi *-Algebras: A New Method
2014
In this paper we introduce a topological approach for extending a representable linear functional \({\omega}\), defined on a topological quasi *-algebra without unit, to a representable linear functional defined on a quasi *-algebra with unit. In particular, we suppose that \({\omega}\) is continuous and the positive sesquilinear form \({\varphi_\omega}\), associated with \({\omega}\), is closable and prove that the extension \({\overline{\varphi_\omega}^e}\) of the closure \({\overline{\varphi_\omega}}\) is an i.p.s. form. By \({\overline{\varphi_\omega}^e}\) we construct the desired extension.
On the decision problem for the guarded fragment with transitivity
2002
The guarded fragment with transitive guards, [GF+TG], is an extension of GF in which certain relations are required to be transitive, transitive predicate letters appear only in guards of the quantifiers and the equality symbol may appear everywhere. We prove that the decision problem for [GF+TG] is decidable. This answers the question posed in (Ganzinger et al., 1999). Moreover, we show that the problem is 2EXPTIME-complete. This result is optimal since the satisfiability problem for GF is 2EXPTIME-complete (Gradel, 1999). We also show that the satisfiability problem for two-variable [GF+TG] is NEXPTIME-hard in contrast to GF with bounded number of variables for which the satisfiability pr…
On the Finite Satisfiability Problem for the Guarded Fragment with Transitivity
2005
We study the finite satisfiability problem for the guarded fragment with transitivity. We prove that in case of one transitive predicate the problem is decidable and its complexity is the same as the general satisfiability problem, i.e. 2Exptime-complete. We also show that finite models for sentences of GF with more transitive predicate letters used only in guards have essentially different properties than infinite ones.
Browder's theorems through localized SVEP
2005
A bounded linear operator T ∈ L(X) on aBanach space X is said to satisfy “Browder’s theorem” if the Browder spectrum coincides with the Weyl spectrum. T ∈ L(X) is said to satisfy “a-Browder’s theorem” if the upper semi-Browder spectrum coincides with the approximate point Weyl spectrum. In this note we give several characterizations of operators satisfying these theorems. Most of these characterizations are obtained by using a localized version of the single-valued extension property of T. In the last part we shall give some characterizations of operators for which “Weyl’s theorem” holds.
A generalization of Sardinas and Patterson's algorithm to z-codes
1993
Abstract This paper concerns the framework of z-codes theory. The main contribution consists in an extension of the algorithm of Sardinas and Patterson for deciding whether a finite set of words X is a z-code. To improve the efficiency of this test we have found a tight upper bound on the length of the shortest words that might have a double z-factorization over X. Some remarks on the complexity of the algorithm are also given. Moreover, a slight modification of this algorithm allows us to compute the z-deciphering delay of X.
Sylow permutable subnormal subgroups of finite groups
2002
[EN] An extension of the well-known Frobenius criterion of p-nilpotence in groups with modular Sylow p-subgroups is proved in the paper. This result is useful to get information about the classes of groups in which every subnormal subgroup is permutable and Sylow permutable.
Learning with belief levels
2008
AbstractWe study learning of predicate logics formulas from “elementary facts,” i.e. from the values of the predicates in the given model. Several models of learning are considered, but most of our attention is paid to learning with belief levels. We propose an axiom system which describes what we consider to be a human scientist's natural behavior when trying to explore these elementary facts. It is proved that no such system can be complete. However we believe that our axiom system is “practically” complete. Theorems presented in the paper in some sense confirm our hypothesis.
Extension of luminance component based demosaicking algorithm to 4- and 5-band multispectral images
2021
Abstract Multispectral imaging systems are currently expanding with a variety of multispectral demosaicking algorithms. But these algorithms have limitations due to the remarkable presence of artifacts in the reconstructed image. In this paper, we propose a powerful multispectral image demosaicking method that focuses on the G band and luminance component. We've first identified a relevant 4-and 5-band multispectral filter array (MSFA) with the dominant G band and then proposed an algorithm that consistently estimates the missing G values and other missing components using a convolution operator and a weighted bilinear interpolation algorithm based on the luminance component. Using the cons…
Of Many, Many Other Things
2021
Propositions of everyday discourse can have, unlike those of formal languages, other components over and above the predicate and the terms needed to saturate it. These components are of two very different sorts: adverbs and further individual terms. Only adverbs have already been discussed by other writers in this connection; but they are not the whole story.