Punctual structures and primitive recursive reducibility

DOI10.1134/S1995080222060142zbMath1496.03155OpenAlexW4285610379MaRDI QIDQ2172879

Iskander Sh. Kalimullin

Publication date: 19 September 2022

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1995080222060142

zbMATH Keywords

primitive recursive functioncomputable functionpunctual algebraic structure

Mathematics Subject Classification ID

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

Cites Work

• Algebraic structures computable without delay
• The diversity of categoricity without delay
• Punctual definability on structures
• Degrees of enumerations of countable Wehner-like families
• Enumerations in computable structure theory
• The enumeration spectrum hierarchy ofn-families
• Natural Large Degree Spectra
• THE COMPLEMENTS OF LOWER CONES OF DEGREES AND THE DEGREE SPECTRA OF STRUCTURES
• Degree spectra and immunity properties
• Spectra of degrees of some structures
• Almost computably enumerable families of sets
• Relative to any nonrecursive set
• Enumerations, countable structures and Turing degrees
• Degrees of Structures
• AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
• FOUNDATIONS OF ONLINE STRUCTURE THEORY

This page was built for publication: Punctual structures and primitive recursive reducibility