Constructing punctually categorical semigroups

DOI10.1007/S10469-020-09614-8zbMATH Open1480.03024OpenAlexW3106851417MaRDI QIDQ828124FDOQ828124

Iskander Kalimullin

Publication date: 8 January 2021

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-020-09614-8

zbMATH Keywords

primitive recursioncategorical semigroupspunctual set theory

Mathematics Subject Classification ID

Model-theoretic algebra (03C60) Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Connections of semigroups with homological algebra and category theory (20M50)

Cites Work

• Algebraic structures computable without delay
• Structures computable in polynomial time. I
• FOUNDATIONS OF ONLINE STRUCTURE THEORY
• Structures computable in polynomial time. II
• The diversity of categoricity without delay
• Categoricity for primitive recursive and polynomial Boolean algebras
• Primitive recursive fields and categoricity

Cited In (1)

• On the index set of punctually categorical finitely generated structures

This page was built for publication: Constructing punctually categorical semigroups

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