The diversity of categoricity without delay
From MaRDI portal
Publication:1688181
DOI10.1007/s10469-017-9437-6zbMath1423.03151OpenAlexW2735673988MaRDI QIDQ1688181
Alexander G. Melnikov, Keng Meng Ng, Iskander Sh. Kalimullin
Publication date: 5 January 2018
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10220/43537
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Categoricity and completeness of theories (03C35)
Related Items (17)
Constructing punctually categorical semigroups ⋮ Punctual structures and primitive recursive reducibility ⋮ Punctual copies of algebraic structures ⋮ Graphs are not universal for online computability ⋮ A structure of punctual dimension two ⋮ Computable reducibility for computable linear orders of type \(\omega \) ⋮ Online presentations of finitely generated structures ⋮ Primitive recursive fields and categoricity ⋮ Eliminating unbounded search in computable algebra ⋮ The back-and-forth method and computability without delay ⋮ Punctual categoricity relative to a computable oracle ⋮ Punctual definability on structures ⋮ AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES ⋮ Non-density in punctual computability ⋮ Punctual categoricity spectra of computably categorical structures ⋮ FOUNDATIONS OF ONLINE STRUCTURE THEORY ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Existence and uniqueness of structures computable in polynomial time
- Algebraic structures computable without delay
- Space complexity of abelian groups
- Polynomial-time versus recursive models
- Computable structures and the hyperarithmetical hierarchy
- Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
This page was built for publication: The diversity of categoricity without delay
