Author： Puzarenko V.
Publisher： Springer Publishing Company
ISSN： 0002-5232
Source： Algebra and Logic, Vol.49, Iss.2, 2010-05, pp. : 160-176
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Relations are treated between the following descriptive properties on admissible sets: enumerability, uniformization, reduction, separation, extension. Moreover, in the setting of these properties, we consider existence problems for a universal computable function and for a computable function universal for {0; 1}-valued computable functions. It is shown that all relations between the given properties are strict. Also we look into algorithmic complexity of admissible sets lending support to the specified relations. It is stated that the reduction principle fails in some admissible sets over classical structures.
Related content
The Journal of Symbolic Logic, Vol. 64, Iss. 2, 1999-06 ,pp. :
Access to resources
Recommend
Infinitary logic and admissible sets
The Journal of Symbolic Logic, Vol. 34, Iss. 2, 1969-07 ,pp. :
Barwise: Infinitary Logic and Admissible Sets
Bulletin of Symbolic Logic, Vol. 10, Iss. 1, 2004-03 ,pp. :
Σ1 compactness for next admissible sets
The Journal of Symbolic Logic, Vol. 39, Iss. 1, 1974-03 ,pp. :
Descriptive set theory over hyperfinite sets
The Journal of Symbolic Logic, Vol. 54, Iss. 4, 1989-12 ,pp. :