$\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

$\prod_{1}^{0}$-POSITIVE INDUCTIVE DEFINABILITY ON ABSTRACT STRUCTURES. (1998). Annual of Sofia University St. Kliment Ohridski. Faculty of Mathematics and Informatics, 90, 91-108. https://annual.uni-sofia.bg/index.php/fmi/article/view/288