Results 1 to 10 of about 569,019 (209)
Binary and ternary relations [PDF]
Mathematica Bohemica, 1992 Two operators are constructed which make it possible to transform ternary relations into binary relations defined on binary relations and vice versa. A possible graphical representation of ternary relations is described.
Vítězslav Novák, Miroslav Novotný
openalex +3 more sources
A theorem on the semigroup of binary relations [PDF]
Proceedings of the American Mathematical Society, 1969 PROOF. Necessity. Let p =p5p, where 5 ESx. Let o = 6p, then o2 = andp =po-. It is known in [1] that L(of) and L(p) are complete lattices in which joins are unions and, moreover, L(of) is completely distributive. If A CX, then it is easy to show that {t(A) =4t(4(A)) and +(A) =x(+1(A)) where c(A)EL(o-), ql(A)EL(p) and X(A)EL(a). Define the mapping 0 of L(
Jaw-ching Yang
openalex +2 more sources
On Some Properties of Binary Relations [PDF]
Nagoya Mathematical Journal, 1957 Some important notions in the theory of binary relations such as the relative product of two relations and the converse of a relation are defined in Whitehead and Russell’s “Principia mathematica” ([1]). McKinsey ([2]) and Tarski ([3]) gave their systems of postulates for the calculus of relations.
Katuzi Ono
openalex +4 more sources
MATHEMATICA SCANDINAVICA, 2011 We define the category of partitioned binary relations and show that it contains many classical diagram categories, including categories of binary relations, maps, injective maps, partitions, (oriented) Brauer diagrams and (oriented) Temperley-Lieb diagrams.
Paul Martin, Volodymyr Mazorchuk
openalex +6 more sources
Binary relations and reduced hypergroups
Discrete Mathematics, 2007 AbstractDifferent partial hypergroupoids are associated with binary relations defined on a set H. In this paper we find sufficient and necessary conditions for these hypergroupoids in order to be reduced hypergroups. Given two binary relations ρ and σ on H we investigate when the hypergroups associated with the relations ρ∩σ, ρ∪σ and ρσ are reduced. We
Irina Cristea, Mirela Ştefănescu
openalex +3 more sources
Distributivity of lattices of binary relations [PDF]
Mathematica Bohemica, 2002 We present a formal scheme which whenever satisfied by relations of a given relational lattice $L$ containing only reflexive and transitive relations ensures distributivity of $L$.
Ivan Chajda
openalex +3 more sources
Hyperstructures associated with binary relations
Computers & Mathematics with Applications, 2006 AbstractIn this paper, we deal with the partial hyperoperation introduced and studied by Corsini [1]. Various characterizations of the relations R, so that (H, ÕR) is a hypergroupoid, are given by means of the associated Boolean matrices. All hypergroupoids (H, ÕR) obtained from the set H, card H=2, 3, 4 are calculated.
Stefanos Spartalis, C. Mamaloukas
openalex +3 more sources
A construction for idempotent binary relations [PDF]
Proceedings of the Japan Academy, Series A, Mathematical Sciences, 1970 Boris M. Schein
openalex +4 more sources
Induction on fields of binary relations. [PDF]
Notre Dame Journal of Formal Logic, 1972 W. Russell Belding
openalex +4 more sources
Mathematics, 2023 This article consists of some new fixed point theorems verifying relation-theoretic strict almost nonlinear contractions that are preserved by a locally finitely transitive relation. Our results improve certain well-known results in the literature.
Faizan Ahmad Khan +5 more
doaj +1 more source