Non-density in punctual computability

DOI10.1016/j.apal.2021.102985OpenAlexW3158712086MaRDI QIDQ2041959

Alexander G. Melnikov, Noam Greenberg, Dan Turetsky, Matthew Harrison-Trainor

Publication date: 26 July 2021

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2021.102985

zbMATH Keywords

computable structure theoryprimitive recursive

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Theory of numerations, effectively presented structures (03D45)

Related Items

Punctually presented structures I: Closure theorems ⋮ Punctual dimension of algebraic structures in certain classes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic structures computable without delay
• Space complexity of abelian groups
• Polynomial-time Abelian groups
• Finite computable dimension does not relativize
• Computable structures and the hyperarithmetical hierarchy
• Degree spectra and computable dimensions in algebraic structures
• Structures computable in polynomial time. II
• The diversity of categoricity without delay
• The computable dimension of ordered abelian groups
• Online presentations of finitely generated structures
• The back-and-forth method and computability without delay
• Structures computable in polynomial time. I
• Degree spectra of intrinsically c.e. relations
• Every recursive linear ordering has a copy in DTIME-SPACE(n,log(n))
• On-Line Coloring and Recursive Graph Theory
• A structure of punctual dimension two
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
• FOUNDATIONS OF ONLINE STRUCTURE THEORY
• CONSTRUCTIVE ALGEBRAS I
• Computable Algebra, General Theory and Theory of Computable Fields
• PUNCTUAL CATEGORICITY AND UNIVERSALITY

This page was built for publication: Non-density in punctual computability