Abstract
The relationship between enumeration degrees and abstract models of computability inspires a new direction in the field of computable structure theory. Computable structure theory uses the notions and methods of computability theory in order to find the effective contents of some mathematical problems and constructions. The paper is a survey on the computable structure theory from the point of view of enumeration reducibility.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
