Results 241 to 250 of about 1,050,506 (284)
Some of the next articles are maybe not open access.
The clone relation of a binary relation
Information Sciences, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Raúl Perez-Fernandez +2 more
exaly +3 more sources
Remarks on “Perov Fixed-Point Results on F-Contraction Mappings Equipped with Binary Relation”
Since 1964, when I.A. Perov introduced the so-called generalized metric space where d(x,y) is an element of the vector space Rm, many researchers have considered various contractive conditions in this type of space.
Slobodanka Mitrović +2 more
exaly +3 more sources
This article comprises some fixed point results for Boyd–Wong-type strict almost contractions using locally L-transitive binary relations. We provide several examples to illustrate our findings.
Doaa Filali +2 more
exaly +3 more sources
Transformation of binary relations
Proceedings of the Sixth International Conference on Computer Supported Cooperative Work in Design (IEEE Cat. No.01EX472), 2002In the object-oriented paradigm, as complexity rises, the cost of developing and maintaining software systems grows exponentially. This complexity emerges from the continuous evolution of software systems to cope with changing requirements. This crucial problem can be dealt with by performing an active transformation of the elements (i.e.
Jamal Said, Eric Steegmans
openaire +1 more source
Binary Relations and Permutation Groups
Mathematical Logic Quarterly, 1995AbstractWe discuss some new properties of the natural Galois connection among set relation algebras, permutation groups, and first order logic. In particular, we exhibit infinitely many permutational relation algebras without a Galois closed representation, and we also show that every relation algebra on a set with at most six elements is Galois closed
Hajnal Andréka +2 more
openaire +2 more sources
On the Compatibility of a Ternary Relation with a Binary Fuzzy Relation
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2019Recently, De Baets et al. have characterized the fuzzy tolerance relations that a given strict order relation is compatible with. In general, the compatibility of a strict order relation with a binary fuzzy relation guarantees also the compatibility of its associated betweenness relation with that binary fuzzy relation.
Omar Barkat +2 more
openaire +1 more source
1974
A binary relation defined on a set containing n elements can be interpreted as an n × n incidence matrix. Such matrix may be taken either over the two element boolean algebra or over the field Z2 . The main purpose of this paper is to study the incidence subgroups and the collineation subgroups of semigroups of binary relations.
openaire +1 more source
A binary relation defined on a set containing n elements can be interpreted as an n × n incidence matrix. Such matrix may be taken either over the two element boolean algebra or over the field Z2 . The main purpose of this paper is to study the incidence subgroups and the collineation subgroups of semigroups of binary relations.
openaire +1 more source

