Finite partial cyclic triple systems can be finitely embedded

DOI10.1007/BF02944962MaRDI QIDQ2546871zbMATH OpenOpenAlexFDO

Authors C. 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

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

Cites work

• Embeddability and the Word Problem
• Embedding partial idempotent Latin squares
• Finite embedding theorems for partial Latin squares, quasi-groups, and loops
• Finitely Presented Loops, Lattices, etc. are Hopfian
• scientific article; zbMATH DE number 3343725 (Why is no real title available?)
• Orthogonal Steiner systems
• Solution of the basic algorithmic problems in some classes of quasigroups with identities
• Some Connections between Residual Finiteness, Finite Embeddability and the Word Problem
• The completion of finite incomplete Steiner triple systems with applications to loop theory
• The Word Problem for Abstract Algebras

Cited in

(6)

• 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
• Small embeddings of partial directed cycle systems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2546871)