نتایج جستجو برای: fundamental equivalence relation

تعداد نتایج: 523045  

Journal: :JOURNAL OF EDUCATION AND SCIENCE 2013

Journal: :Banach Center Publications 1988

2010
HUI RAO YANG WANG

In this paper we investigate the Lipschitz equivalence of dust-like self-similar sets in Rd. One of the fundamental results by Falconer and Marsh [On the Lipschitz equivalence of Cantor sets, Mathematika, 39 (1992), 223– 233] establishes conditions for Lipschitz equivalence based on the algebraic properties of the contraction ratios of the self-similar sets. In this paper we extend the study by...

2017
John D. Clemens Dominique Lecomte Benjamin D. Miller JOHN D. CLEMENS BENJAMIN D. MILLER

We prove that for every Borel equivalence relation E, either E is Borel reducible to E0, or the family of Borel equivalence relations incompatible with E has cofinal essential complexity. It follows that if F is a Borel equivalence relation and F is a family of Borel equivalence relations of non-cofinal essential complexity which together satisfy the dichotomy that for every Borel equivalence r...

Journal: :iranian journal of science and technology (sciences) 2013
r. ameri

we consider the fundamental relation  on a semihypergroup  to interpret the lower and upper approximations as subsets of the fundamental semigroup  and we give some results in this connection. also, we introduce the notion of a bi-hyperideal to study the relationship between approximations and bi-hyperideals.

Journal: :Electr. Notes Theor. Comput. Sci. 2017
Mauricio Ayala-Rincón Washington de Carvalho Segundo Maribel Fernández Daniele Nantes-Sobrinho

A formalisation of soundness of the notion of α-equivalence in nominal abstract syntax modulo associative (A) and associative-commutative (AC) equational theories is described. Initially, the notion of α-equivalence is specified based on a so called “weak” nominal relation as suggested by Urban in his nominal development in Isabelle/HOL. Then, it is formalised in Coq that this equality is indee...

2008
David Meyer Kurt Hornik

Given k sets of objects X1, . . . , Xk, a k-ary relation R on D(R) = (X1, . . . , Xk) is a subset G(R) of the Cartesian product X1 × · · · ×Xk. I.e., D(R) is a k-tuple of sets and G(R) is a set of k-tuples. We refer to D(R) and G(R) as the domain and the graph of the relation R, respectively (alternative notions are that of ground and figure, respectively). Relations are a very fundamental math...

Journal: :Fuzzy Sets and Systems 2012
Miroslav Ciric Jelena Ignjatovic Nada Damljanovic Milan Basic

Bisimulations have beenwidely used inmany areas of computer science tomodel equivalence between various systems, and to reduce the number of states of these systems, whereas uniform fuzzy relations have recently been introduced as a means to model the fuzzy equivalence between elements of two possible different sets. Here we use the conjunction of these two concepts as a powerful tool in the st...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید