Distinguishability of a Semi-Group by a Machine

DOI10.2307/2034265zbMATH Open0118.25403OpenAlexW4242566197MaRDI QIDQ5729307FDOQ5729307

Edwin H. Spanier, Seymour Ginsburg

Publication date: 1961

Full work available at URL: https://doi.org/10.2307/2034265

zbMATH Keywords

mathematical logic

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Recursive unsolvability of group theoretic problems
• Some Remarks on Abstract Machines

Recommendations

• Recognizable subsets of semigroups 👍 👎
• Distinguishability of infinite groups and graphs 👍 👎
• Algorithmic recognition of identities in one class of finitely presented semigroups 👍 👎
• On finitely recognizable semigroups 👍 👎
• Decidability of semigroup identities in soluble groups 👍 👎
• The order of a group machine 👍 👎
• The distinguishing number of quasiprimitive and semiprimitive groups 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Distinguishability of a Semi-Group by a Machine

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