The diversity of categoricity without delay
From MaRDI portal
Publication:1688181
DOI10.1007/s10469-017-9437-6zbMath1423.03151MaRDI 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
03C57: Computable structure theory, computable model theory
03D45: Theory of numerations, effectively presented structures
03C35: Categoricity and completeness of theories
Related Items
Unnamed Item, A structure of punctual dimension two, AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES, FOUNDATIONS OF ONLINE STRUCTURE THEORY, Computable reducibility for computable linear orders of type \(\omega \), Constructing punctually categorical semigroups, Primitive recursive fields and categoricity, Eliminating unbounded search in computable algebra, Punctual categoricity relative to a computable oracle, Punctual definability on structures, Non-density in punctual computability, Punctual categoricity spectra of computably categorical structures, Punctual structures and primitive recursive reducibility, Punctual copies of algebraic structures, Graphs are not universal for online computability, Online presentations of finitely generated structures, The back-and-forth method and computability without delay
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
