Punctual copies of algebraic structures

DOI10.1134/S0037446619060077zbMath1468.03051OpenAlexW3008832147MaRDI QIDQ2186304

Yanyan Li

Publication date: 9 June 2020

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0037446619060077

zbMATH Keywords

computable structuresprimitive recursiononline model theory

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (3)

Punctual 1-linear orders ⋮ Punctually presented structures I: Closure theorems ⋮ Punctual dimension of algebraic structures in certain classes

Cites Work

• Algebraic structures computable without delay
• Degrees of orderings not isomorphic to recursive linear orderings
• Space complexity of abelian groups
• Polynomial-time versus recursive models
• Polynomial-time Abelian groups
• Structures computable in polynomial time. II
• The diversity of categoricity without delay
• Categoricity for primitive recursive and polynomial Boolean algebras
• \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
• Graphs are not universal for online computability
• Structures computable in polynomial time. I
• COMPUTABLE ABELIAN GROUPS
• Recursive isomorphism types of recursive Boolean algebras
• Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n))
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
• Δ 2 0 -copies of linear orderings
• CONSTRUCTIVE ALGEBRAS I
• Copyable Structures
• Computable Algebra, General Theory and Theory of Computable Fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Punctual copies of algebraic structures