Punctual structures and primitive recursive reducibility
From MaRDI portal
Publication:2172879
Recommendations
Cites work
- Algebraic structures computable without delay
- Almost computably enumerable families of sets
- AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES
- Degree spectra and immunity properties
- Degrees of enumerations of countable Wehner-like families
- Degrees of Structures
- Enumerations in computable structure theory
- Enumerations, countable structures and Turing degrees
- FOUNDATIONS OF ONLINE STRUCTURE THEORY
- Natural large degree spectra
- Punctual definability on structures
- Relative to any nonrecursive set
- Spectra of degrees of some structures
- THE COMPLEMENTS OF LOWER CONES OF DEGREES AND THE DEGREE SPECTRA OF STRUCTURES
- The diversity of categoricity without delay
- The enumeration spectrum hierarchy of n-families
Cited in
(9)- Punctual dimension of algebraic structures in certain classes
- Punctual categoricity relative to a computable oracle
- Punctual definability on structures
- Non-density in punctual computability
- Punctual copies of algebraic structures
- A structure of punctual dimension two
- Punctually presented structures I: Closure theorems
- Punctual spectra of algebraic structures and isomorphisms
- Constructing punctually categorical semigroups
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)