Results 261 to 270 of about 42,222 (303)
Some of the next articles are maybe not open access.
On isomorphisms of quasigroups
Discrete Mathematics and Applications, 2005Summary: We give a solution of the well-known problem of isomorphisms of the quasigroups each of which is principally isotopic to the same quasigroup.
openaire +2 more sources
Isomorphism and representationalism
Behavioral and Brain Sciences, 2003Lehar tries to build a computational theory that succeeds in offering the same computational model for both phenomenal experience and visual processing. However, the vision that Lehar has about isomorphism in Gestalttheorie as representational, is not adequate.
openaire +2 more sources
The American Journal of Psychology, 2014
Abstract Learning and transfer were investigated for a categorical structure that could be mapped without loss of information from 1 sensory modality to another. The category space was composed of 3 nonoverlapping, linearly separable categories whose members were structured, temporal events. Each stimulus was composed of a sequence of on–
Ryan, Ferguson, Donald, Homa
openaire +2 more sources
Abstract Learning and transfer were investigated for a categorical structure that could be mapped without loss of information from 1 sensory modality to another. The category space was composed of 3 nonoverlapping, linearly separable categories whose members were structured, temporal events. Each stimulus was composed of a sequence of on–
Ryan, Ferguson, Donald, Homa
openaire +2 more sources
The Quarterly Journal of Mathematics, 1983
The author considers the isomorphism problem for certain 2-generator metabelian groups of prime exponent p. For the free groups of this kind \textit{H. Meier-Wunderli} [Comment. Math. Helv. 25, 1--10 (1951; Zbl 0044.01505)] determined the ranks of the lower central sections: if \(G\) is a free 2-generator metabelian group of exponent \(p\) and \(G_1=G\)
openaire +2 more sources
The author considers the isomorphism problem for certain 2-generator metabelian groups of prime exponent p. For the free groups of this kind \textit{H. Meier-Wunderli} [Comment. Math. Helv. 25, 1--10 (1951; Zbl 0044.01505)] determined the ranks of the lower central sections: if \(G\) is a free 2-generator metabelian group of exponent \(p\) and \(G_1=G\)
openaire +2 more sources
Communications of the ACM, 1960
The coding of external symbols into symbols internal to a computer can sometimes be carried out in such a way that relevant informational properties are preserved, but in a form much more easily dealt with. A case in point is presented.
openaire +2 more sources
The coding of external symbols into symbols internal to a computer can sometimes be carried out in such a way that relevant informational properties are preserved, but in a form much more easily dealt with. A case in point is presented.
openaire +2 more sources
Artificial Intelligence and Law, 1996
Previous research into the formalisation of statute law identified a number of uses of language which posed problems for formalisation. A previous paper argued that these uses establish the requirement that a formalisation be isomorphic, but noted that this has odd consequences.
openaire +1 more source
Previous research into the formalisation of statute law identified a number of uses of language which posed problems for formalisation. A previous paper argued that these uses establish the requirement that a formalisation be isomorphic, but noted that this has odd consequences.
openaire +1 more source
Anti-Isomorphisms vs. Isomorphisms
Mathematics Magazine, 1971(1971). Anti-Isomorphisms vs. Isomorphisms. Mathematics Magazine: Vol. 44, No. 2, pp. 102-103.
openaire +1 more source
Substructure Isomorphism Matrix
Journal of Chemical Information and Computer Sciences, 2000A substructure isomorphism matrix n x p contains binary elements describing which of the given p query structures (substructures) are part of the given n target structures (molecular structures). Such a matrix can be used to investigate the diversity of the target structures and allows the characterization and comparison of structural libraries.
Kurt Varmuza, Heinz Scsibrany
openaire +3 more sources
The Formula Isomorphism Problem
SIAM Journal on Computing, 2000Summary: We investigate the computational complexity of the formula isomorphism problem (FI): on input of two boolean formulas \(F\) and \(G\) decide whether there exists a permutation of the variables of \(G\) such that \(F\) and \(G\) become equivalent. FI is contained in \({\Sigma_{2}{\mathbf P}}\), the second level of the polynomial hierarchy.
Manindra Agrawal, Thomas Thierauf
openaire +1 more source
Weakly isomorphic transformations that are not isomorphic
Probability Theory and Related Fields, 1988A new method for construction of transformations T: (X\({}_ i,{\mathcal B}_ i,\mu _ i)\), \(i=1,2\), that are factors of each other but that are not measure-theoretically isomorphic is provided. This method uses ergodic product cocycles of the form \(\phi \circ S^{i_ 1}\times \phi \circ S^{i_ 2}\times...\), where \(\phi\) : \(X\to Z_ 2\) is a cocycle ...
openaire +2 more sources