Home
Relatively intrinsically arithmetical sets
Author: S. K. Nikolova
Sets that have \sj\ (\pj, arithmetical) associates in every partial enumeration of given countable abstract structure are considered. Some minimal classes of partial enumerations are obtained such that admissibility in every such class yields the respective definability.
Annotation in PDF format:
(PDF document
54Kb)
(PDF document
54Kb)
Keywords: abstract, computability, definability
2000 MSC:
03D70,
03D75
