Results 251 to 260 of about 2,701,936 (269)

Asymmetric learning and adaptability to changes in relational structure during transitive inference

Graham TA, Spitzer B.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Finite σ-soluble groups in which σ-permutability is a transitive relation

Journal of Algebra and its Applications, 2019
Let [Formula: see text] be some partition of the set of all primes [Formula: see text], [Formula: see text] a finite group and [Formula: see text]. A set [Formula: see text] of subgroups of [Formula: see text] is said to be a complete Hall[Formula: see ...
Xiaoxing Zhu, C. Cao, W. Guo
semanticscholar   +1 more source

Uncountable groups in which normality is a transitive relation

International journal of algebra and computation, 2019
A group is called a [Formula: see text]-group if all its subnormal subgroups are normal. It is proved here that if [Formula: see text] is an uncountable soluble periodic group of regular cardinality [Formula: see text] in which all subnormal subgroups of
M. Falco, F. Giovanni, C. Musella, Y. Sysak   +3 more
semanticscholar   +1 more source

Coincidence Theorems in New Generalized Metric Spaces Under Locally g-transitive Binary Relation

Journal of the Indian Mathematical Society, 2018
In this paper, we establish coincidence point theorems for contractive mappings, using locally g-transitivity of binary relation in new generalized metric spaces. In the present results, we use some relation theoretic analogues of standard metric notions
G. Prasad, R. Dimri
semanticscholar   +1 more source

Closed-set lattice of regular sets based on a serial and transitive relation through matroids

International Journal of Machine Learning and Cybernetics, 2012
Rough sets are efficient for data pre-processing in data mining. Matroids are based on linear algebra and graph theory, and have a variety of applications in many fields. Both rough sets and matroids are closely related to lattices.
Qingyin Li, William Zhu
semanticscholar   +1 more source

Equivalence relation

Научно-образовательный портал "Большая российская энциклопедия", 2023
Definition 1. An equivalence relation is a relationship on a set, generally denoted by " ∼ " , that is reflexive, symmetric, and transitive for everything in the set. 1. (Reflexivity) a ∼ a, 2. (Symmetry) if a ∼ b then b ∼ a, 3.
Alexei Yurievich Zoubov
semanticscholar   +1 more source

Finite groups in which modularity is a transitive relation

Archiv der Mathematik, 2023
A-Ming Liu, Wenbin Guo, I. N. Safonova, A. Skiba   +3 more
semanticscholar   +1 more source

Groups in which normality is a weakly transitive relation

, 2015
E. Romano, G. Vincenzi
semanticscholar   +1 more source

Finite solvable groups in which semi-normality is a transitive relation

, 2013
A. Ballester-Bolinches, J. Beidleman, A. Feldman, H. Heineken, M. Ragland   +4 more
semanticscholar   +1 more source

Groups in which normality is a transitive relation

Mathematical Proceedings of the Cambridge Philosophical Society, 1964
D. Robinson
semanticscholar   +1 more source