almost multiplier is rather a new concept in the theory of almost functions. in thispaper we discuss on the boundedness of almost multipliers on some special banach algebras,namely stable algebras. we also de ne an adjoint and extension for almost multiplier.

We investigate decision problems like reachability and boundedness for extensions of PB systems with volatile membranes. Specifically, we prove that reachability and boundedness are decidable for PB systems extended with rules for membrane dissolution. For PB systems extended with membrane creation, reachability is still decidable whereas boundedness becomes undecidable. Furthermore, we show th...

Following results are sketched in this extended abstract Datalog recursive programs where each rule has at most one subgoal called unit recursions are shown to be bounded with an e ective con struction of equivalent non recursive programs A generalized chain program which allow IDB predicates of arbitrary arity and remove the uniqueness condition of chain variables is bounded if and only if it ...

Classically, G. Fano proved that the family of (smooth, anticanonically embedded) Fano 3-dimensional varieties is bounded, and moreover provided their classification, later completed by V.A. Iskovskikh, S. Mukai and S. Mori. For singular Fano varieties with log terminal singularities, there are two basic boundedness conjectures: Index Boundedness and the much stronger ǫ-lt Boundedness. The ǫ-lt...

This paper examines the significance of the schematic domain of BOUNDEDNESS in adjectives. It is proposed that boundedness in adjectives is a fundamental characteristic associated with gradability. Cross-categorial correspondences are made to nouns and verbs, where boundedness is a feature of countability and aktionsart respectively. Two basic types of gradable adjectives are distinguished: tho...

We study L (or Lr,∞) boundedness for bilinear translation-invariant operators with nonnegative kernels acting on functions on R. We prove that if such operators are bounded on some products of Lebesgue spaces, then their kernels must necessarily be integrable functions on R, while via a counterexample we show that the converse statement is not valid. We provide certain necessary and some suffic...

Nested Petri nets (NP-nets) are Petri nets with net tokens. The liveness and boundedness problems are undecidable for two-level NP-nets [10]. Boundedness is EXPSPACE and liveness is EXPSPACE or worse for plain Petri nets [4]. However, for some restricted classes, e.g. for plain free-choice Petri nets, problems become more amenable to analysis. There is the polynomial time algorithm to check if ...

A given Datalog program is bounded if its depth of recursion is independent of the input database. Deciding boundedness is a basic task for the analysis of database logic programs. The undecidability of Datalog boundedness was rst demonstrated by Gaifman et al. We introduce new techniques for proving the undecidability of various kinds of boundedness, which allow us to considerably strengthen t...

Numerous properties of vector addition systems with states amount to checking the (un)boundedness of some selective feature (e.g., number of reversals, counter values, run lengths). Some of these features can be checked in exponential space by using Rackoff’s proof or its variants, combined with Savitch’s Theorem. However, the question is still open for many others, e.g., regularity detection p...

Channel boundedness is a necessary condition for a message-passing system to exhibit regular, finite-state behaviour at the global level. For Message Sequence Graphs (MSGs), the most basic form of Highlevel Message Sequence Charts (HMSCs), channel boundedness can be characterized in terms of structural conditions on the underlying graph. We consider MSGs enriched with timing constraints between...