RELATIVELY INTRINSICALLY ARITHMETICAL SETS

Authors

  • Stela Nikolova

Keywords:

abstract, computability, definability

Abstract

Sets that have $\sum_n^0$ ($\prod_n^0$, 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.

Downloads

Published

2005-12-12

How to Cite

Nikolova, S. (2005). RELATIVELY INTRINSICALLY ARITHMETICAL SETS. Ann. Sofia Univ. Fac. Math. And Inf., 97, 41–62. Retrieved from https://ftl5.uni-sofia.bg./index.php/fmi/article/view/143

Issue

Vol. 97 (2005): Ann. Sofia Univ. Fac. Math and Inf.

Section

Articles