$\prod_{1}^{0}$-POSITIVE INDUCTIVE DEFINABILITY ON ABSTRACT STRUCTURES

Authors

  • Stela Nikolova

Keywords:

inductive definability, non-deterministic computability, points of $\forall$-definedness, prime computability

Abstract

Inductive definability by means of $\prod_{1}^{0}$-positive formulas is studied in the paper. An explicit characterization of the $\prod_{1}^{0}$-positive inductive sets on an arbitrary abstract structure with equality is presented. A relationship between these sets and the sets of all points of $\forall$-definedness of non-deterministic programs is established.

Downloads

Published

1998-12-12

How to Cite

Nikolova, S. (1998). $\prod_{1}^{0}$-POSITIVE INDUCTIVE DEFINABILITY ON ABSTRACT STRUCTURES. Ann. Sofia Univ. Fac. Math. And Inf., 90, 91–108. Retrieved from https://ftl5.uni-sofia.bg./index.php/fmi/article/view/288

Issue

Vol. 90 (1998): Ann. Sofia Univ. Fac. Math and Inf.

Section

Articles