A pathological punctually 1-decidable structure

DOI10.1090/PROC/17329MaRDI QIDQ6937314zbMATH OpenFDO

Authors Ellen Hammatt, Dan Turetsky, Alexander Melnikov, Keng Meng Ng

Publication date 27 August 2025

Published in Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/PROC/17329

Mathematics Subject Classification ID

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

Cites work

• A structure of punctual dimension two
• Algebraic structures computable without delay
• An undecidable linear order that is \(n\)-decidable for all \(n\)
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
• Autostability and computable families of constructivizations
• Categoricity for primitive recursive and polynomial Boolean algebras
• Computable Algebra, General Theory and Theory of Computable Fields
• Computable categoricity versus relative computable categoricity
• Eliminating unbounded search in computable algebra
• Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n))
• Existence and uniqueness of structures computable in polynomial time
• Foundations of online structure theory. II: The operator approach
• Graphs are not universal for online computability
• scientific article; zbMATH DE number 3472034 (Why is no real title available?)
• scientific article; zbMATH DE number 3561336 (Why is no real title available?)
• scientific article; zbMATH DE number 1303204 (Why is no real title available?)
• scientific article; zbMATH DE number 749934 (Why is no real title available?)
• Non Σ_n axiomatizable almost strongly minimal theories
• Online Algorithms
• Online presentations of finitely generated structures
• Polynomial-time Abelian groups
• Polynomial-time versus recursive models
• Primitive recursive reverse mathematics
• Primitively recursive categoricity for unars and equivalence structures
• Primitively recursively categorical linear orderings
• PUNCTUAL CATEGORICITY AND UNIVERSALITY
• Recursive analysis
• Space complexity of abelian groups
• The word problem and power problem in 1-relator groups are primitive recursive
• There is no classification of the decidably presentable structures
• Word problems. Decision problems and the Burnside problem in group theory

This page was built for publication: A pathological punctually 1-decidable structure

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