The existence of primitive recursive structures

DOI10.1007/978-3-031-95908-0_9MaRDI QIDQ6897659zbMATH OpenFDO

Authors P. E. Alaev

Publication date 19 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-95908-0_9

zbMATH Keywords

abelian groupBoolean algebracomputabilitycomputable structurepartial orderingprimitive recursive structurepunctual structure

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A criterion for P-computability of structures
• Algebraic structures computable without delay
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
• Categoricity for primitive recursive and polynomial Boolean algebras
• CONSTRUCTIVE ALGEBRAS I
• Description of structures computable in polynomial time
• Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n))
• FOUNDATIONS OF ONLINE STRUCTURE THEORY
• scientific article; zbMATH DE number 1002913 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Independence in computable algebra
• Inversion operations in algebraic structures
• Polynomial-time versus recursive models
• Structures computable in polynomial time. I
• The complexity of inversion in groups

This page was built for publication: The existence of primitive recursive structures

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