This is a preview of subscription content, log in via an institution to check access.
References
Evans, T.,The Word Problem for Abstract Algebras, J. London Math. Soc.26, 64–71 (1951).
Evans, T.,Embeddability and the Word Problem, J. London Math. Soc.28, 76–80 (1953).
Evans, T.,Some Connections Between Residual Finiteness, Finite Embeddability and the Word Problem, J. London Math. Soc. (2)1 399–403 (1969).
Evans, T.,Finitely Presented Loops, Lattices, etc., are Hopfian, J. London Math. Soc.44, 551–552 (1969).
Gvaramiya, A. A. andGlukhov, M. M.,Solution of the Basic Algorithmic Problems in Some Classes of Quasigroups with Identities, Sibirskii Matematicheskii Zhurnal10, 297–317, (1969).
Lindner, C. C.,Embedding Partial Idempotent Latin Squares, J. Combinatorial Theory (to appear).
Linder, C. C.,Finite Embedding Theorems for Partial Latin Squares, Quasigroups, and Loops, J. Combinatorial Theory (to appear).
Mendelsohn, N. S.,Orthogonal Steiner Systems (to appear).
Mendelsohn, N. S.,A Natural Generalization of Steiner Triple Systems (to appear).
Treash, C.,A Completion of Finite Incomplete Steiner Triple Systems, J. Combinatorial Theory (to appear).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lindner, C.C. Finite partial cyclic triple systems can be finitely embedded. Algebra Univ. 1, 93–96 (1971). https://doi.org/10.1007/BF02944962
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF02944962