Search results for "relation"
showing 10 items of 10542 documents
Proving convexity preserving properties of interpolatory subdivision schemes through reconstruction operators
2013
We introduce a new approach towards proving convexity preserving properties for interpolatory subdivision schemes. Our approach is based on the relation between subdivision schemes and prediction operators within Harten's framework for multiresolution, and hinges on certain convexity properties of the reconstruction operator associated to prediction. Our results allow us to recover certain known results [10,8,1,7]. In addition, we are able to determine the necessary conditions for convexity preservation of the family of subdivision schemes based on the Hermite interpolation considered in [4].
Upper and lower generalized factoraggregations based on fuzzy equivalence relation
2014
We develop the concept of a general factoraggre-gation operator introduced by the authors on the basis of an equivalence relation and applied in two recent papers for analysis of bilevel linear programming solving parameters. In the paper this concept is generalized by using a fuzzy equivalence relation instead of the crisp one. By using a left-continuous t-norm and its residuum we define and investigate two modifications of such generalized construction: upper and lower generalized factoraggregations. These generalized factoraggregations can be used for construction of extensional fuzzy sets.
An Overview on Algebraic Structures
2016
This chapter recaps and formalizes concepts used in the previous sections of this book. Furthermore, this chapter reorganizes and describes in depth the topics mentioned at the end of Chap. 1, i.e. a formal characterization of the abstract algebraic structures and their hierarchy. This chapter is thus a revisited summary of concepts previously introduced and used and provides the mathematical basis for the following chapters.
Closedness properties in team learning of recursive functions
1997
This paper investigates closedness properties in relation with team learning of total recursive functions. One of the first problems solved for any new identification types is the following: “Does the identifiability of classes U1 and U2 imply the identifiability of U1∪U2?” In this paper we are interested in a more general question: “Does the identifiability of every union of n−1 classes out of U1,...,Un imply the identifiability of U1∪...∪Un?” If the answer is positive, we call such identification type n-closed. We show that n-closedness can be equivalently formulated in terms of team learning. After that we find for which n team identification in the limit and team finite identification t…
GEOMETRIC EQUIVALENCE OF ALGEBRAS
2001
In this paper, we study the geometric equivalence of algebras in several varieties of algebras. We solve some of the problems formulated in [2], in particular, that of geometric equivalence for real-closed fields and finitely generated commutative groups.
On Extensional Fuzzy Sets Generated by Factoraggregation
2014
We develop the concept of a general factoraggregation operator introduced by the authors on the basis of an equivalence relation and applied in two recent papers for analysis of bilevel linear programming solving parameters. In the paper this concept is generalized by using a fuzzy equivalence relation instead of the crisp one. We show how the generalized factoraggregation can be used for construction of extensional fuzzy sets and consider approximations of arbitrary fuzzy sets by extensional ones.
Elementary Action Systems
2015
This chapter expounds basic notions. An elementary action system is a triple consisting of the set of states, the transition relation between states, and a family of binary relations defined on the set of states. The elements of this family are called atomic actions. Each pair of states belonging to an atomic action is a possible performance of this action. This purely extensional understanding of atomic actions is close to dynamic logic. Compound actions are defined as sets of finite sequences of atomic actions. Thus compound actions are regarded as languages over the alphabet whose elements are atomic actions. This chapter is concerned with the problem of performability of actions and the…
Unification in first-order transitive modal logic
2019
We introduce unification in first-order transitive modal logics, i.e. logics extending Q–K4, and apply it to solve some problems such as admissibility of rules. Unifiable formulas in some extensions of Q–K4 are characterized and an explicit basis for the passive rules (those with non-unifiable premises) is provided. Both unifiability and passive rules depend on the number of logical constants in the logic; we focus on extensions of Q–K4 with at most four constants ⊤,⊥,□⊥,◊⊤. Projective formulas, defined in a way similar to propositional logic, are used to solve some questions concerning the disjunction and existence properties. A partial characterization of first-order modal logics with pr…
Aragon dans la Guerre d'Algérie
2014
-
Aragon dans la Guerre d'Algérie
2014
International audience; -