Finite partial cyclic triple systems can be finitely embedded

DOI10.1007/BF02944962zbMath0219.05011OpenAlexW2007456406MaRDI QIDQ2546871

Charles C. Lindner

Publication date: 1971

Published in: Algebra Universalis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02944962

Mathematics Subject Classification ID

Loops, quasigroups (20N05) Triple systems (05B07)

Related Items (6)

Small embeddings of partial directed cycle systems ⋮ Embedding partial Mendelsohn triple systems ⋮ Strong finite embeddability for classes of quasigroups ⋮ Finite embeddability in a class of infinitary algebras ⋮ Intersection preserving finite embedding theorems for partial quasigroups ⋮ Totally symmetric and semi-symmetric quasigroups have the intersection preserving finite embeddability property

Cites Work

• Unnamed Item
• Solution of the basic algorithmic problems in some classes of quasigroups with identities
• Orthogonal Steiner systems
• Embedding partial idempotent Latin squares
• The completion of finite incomplete Steiner triple systems with applications to loop theory
• Finite embedding theorems for partial Latin squares, quasi-groups, and loops
• Finitely Presented Loops, Lattices, etc. are Hopfian
• Some Connections between Residual Finiteness, Finite Embeddability and the Word Problem
• The Word Problem for Abstract Algebras
• Embeddability and the Word Problem

This page was built for publication: Finite partial cyclic triple systems can be finitely embedded