ADMISSIBILITY IN $\sum_n^0$-ENUMERATIONS

Authors

  • Alexandra Soskova
  • Ivan Soskov

Keywords:

definability, enumerations, forcing

Abstract

In the paper we introduce the notion of $\sum_n^0 \textit{ partial enumeration}$ of an abstract structure $\mathfrak{A}$. Given a $k \leq n$, we obtain a characterization of the subsets of $\mathfrak{A}$ possessing $\sum_k^0$ pullbacks in all $\sum_n^0$ partial enumerations of $\mathfrak{A}$.

Downloads

Published

1998-12-12

How to Cite

Soskova, A., & Soskov, I. (1998). ADMISSIBILITY IN $\sum_n^0$-ENUMERATIONS. Ann. Sofia Univ. Fac. Math. And Inf., 90, 77–90. Retrieved from https://ftl5.uni-sofia.bg./index.php/fmi/article/view/287