Punctual copies of algebraic structures

DOI10.1134/S0037446619060077MaRDI QIDQ2186304zbMATH OpenOpenAlexFDO

Authors 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 structuresonline model theoryprimitive recursion

Mathematics Subject Classification ID

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

Recommendations

• Punctual dimension of algebraic structures in certain classes
• Punctual structures and primitive recursive reducibility
• Constructing punctually categorical semigroups
• Computable Boolean algebras
• A structure of punctual dimension two

Cites work

• \(\Delta_{2}^{0}\)-categoricity in Boolean algebras and linear orderings
• Algebraic structures computable without delay
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
• Categoricity for primitive recursive and polynomial Boolean algebras
• Computable abelian groups
• Computable Algebra, General Theory and Theory of Computable Fields
• CONSTRUCTIVE ALGEBRAS I
• Copyable structures
• Degrees of orderings not isomorphic to recursive linear orderings
• Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n))
• Graphs are not universal for online computability
• scientific article; zbMATH DE number 67424 (Why is no real title available?)
• scientific article; zbMATH DE number 2047478 (Why is no real title available?)
• scientific article; zbMATH DE number 806746 (Why is no real title available?)
• scientific article; zbMATH DE number 934728 (Why is no real title available?)
• scientific article; zbMATH DE number 1421070 (Why is no real title available?)
• scientific article; zbMATH DE number 1450824 (Why is no real title available?)
• Polynomial-time Abelian groups
• Polynomial-time versus recursive models
• Recursive isomorphism types of recursive Boolean algebras
• Space complexity of abelian groups
• Structures computable in polynomial time. I
• Structures computable in polynomial time. II
• The diversity of categoricity without delay
• Δ 2 0 -copies of linear orderings

Cited in

(7)

• Punctual dimension of algebraic structures in certain classes
• Online presentations of finitely generated structures
• COPYING ONE OF A PAIR OF STRUCTURES
• Punctual 1-linear orders
• Punctually presented structures I: Closure theorems
• Punctually presented structures. II: Comparing presentations.
• Punctual numberings for families of sets

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

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