Publications of Stela K. Nikolova



1. An example of an algebraic structure, complete wrt standard schemes with counters,

but incomplete wrt recursive schemes, MSc Thesis, Sofia University, 1985.

2. \Mu-admissibility in abstract structures of arbitrary power. Compt. Rend.

Acad. Bulg. Sci., 43 (10), 1990, pp. 9 - 11.

3. Computability in sense of Moschovakis over multiple-valued abstract structures.

Compt. Rend. Acad. Bulg. Sci., 43 (1), 1990, pp. 35 - 37.

4. On the notion of \forall -recursiveness of non-deterministic procedures. In: Proceedings

of the International Summer School and Conference on Mathematical Logic "Kleene'90",

Chajka near Varna, 1990. 

5. Admissibility in abstract structure with arbitrary cardinality,

  PhD Thesis, Sofia University, 1992.

6. Admissible functionals in abstract structures with arbitrary power.

Ann. Univ. Sofia, Fac. Math. et Mec., 89, 1995, pp. 189 - 201.

7. \Pi^0_1-positive inductive definability on abstract structures.

Ann. Univ. Sofia, Fac. Math et Inf., 91, 1997, pp. 91 - 108.

8. (with A. A. Soskova) Theory of programming in problems. SofTeX, Sofia, 1997.

9. Definability via partial enumerations with semicomputable codomains.

Ann. Univ. Sofia, v. 92, 1998, pp. 49-63.

10.Definability via partial enumerations with \Pi^0_n domains. In: proceedings of Second

Panhellenic Logic Symposium,  Delphi, Greece, 1999, pp. 171 174.

11. Inductive Definability on Abstract Structure, Kliment lecture,  Sofia University, November, 5, 2005.

12. Relatively intrinsically arithmetical sets. Ann. Univ. Sofia, Fac. Math. et Mec., 97, 2005.

13. (with I. Pchelarov) Points of \forall definedness of non-deterministic programs over arbitrary data type.

In: proceedings of the Fifth Panhellenic Logic Symposium,  Athens, Greece, 2005, pp. 105 110.

14.On the notion of  \for_all-recursiveness of non-deterministic programs, ILLC Scientific Publications,

B Loewe ed., Amsterdam, 2005, pp. 178 187.

15. (with A. Soskova) Semantics of Programming Languages. SofTeX, Sofia, 2008.