Punctual structures and primitive recursive reducibility
From MaRDI portal
Publication:2172879
DOI10.1134/S1995080222060142zbMATH Open1496.03155OpenAlexW4285610379MaRDI QIDQ2172879FDOQ2172879
Authors: Iskander 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
Recommendations
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Cites Work
- Enumerations in computable structure theory
- Degree spectra and immunity properties
- Almost computably enumerable families of sets
- Degrees of Structures
- Relative to any nonrecursive set
- Enumerations, countable structures and Turing degrees
- Algebraic structures computable without delay
- The enumeration spectrum hierarchy of \(n\)-families
- THE COMPLEMENTS OF LOWER CONES OF DEGREES AND THE DEGREE SPECTRA OF STRUCTURES
- FOUNDATIONS OF ONLINE STRUCTURE THEORY
- The diversity of categoricity without delay
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
- Punctual definability on structures
- Degrees of enumerations of countable Wehner-like families
- Natural large degree spectra
- Spectra of degrees of some structures
Cited In (6)
This page was built for publication: Punctual structures and primitive recursive reducibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2172879)