Punctual presentability in certain classes of algebraic structures

DOI10.4230/LIPICS.MFCS.2024.65MaRDI QIDQ7241073zbMATH OpenFDO

Authors Dariusz Kalociński, Luca San Mauro, Michał Wrocławski

Publication date 12 May 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2024.65

zbMATH Keywords

fully primitive recursive structuresinjection structurespunctual presentabilitytrees

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• Algebraic structures computable without delay
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
• Automatic presentations of structures
• Computability-theoretic properties of injection structures
• Computable Algebra, General Theory and Theory of Computable Fields
• Computable Structure Theory
• CONSTRUCTIVE ALGEBRAS I
• Feasible graphs with standard universe
• FOUNDATIONS OF ONLINE STRUCTURE THEORY
• Non-density in punctual computability
• Online presentations of finitely generated structures
• Polynomial computability of fields of algebraic numbers
• Polynomial-time Abelian groups
• Polynomial-time versus recursive models
• Primitive recursive equivalence relations and their primitive recursive complexity
• PUNCTUAL CATEGORICITY AND UNIVERSALITY

This page was built for publication: Punctual presentability in certain classes of algebraic structures

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