JUCS - Journal of Universal Computer Science 1(2): 151-154, doi: 10.3217/jucs-001-02-0151
On Completeness of Pseudosimple Sets
expand article infoVadim Bulitko‡
‡ Odessa State University, Ukraine

Corresponding author: Vadim Bulitko ( bulitko.odessa@rex.iasnet.com )

© Vadim Bulitko.
This article is freely available under the J.UCS Open Content License.
Citation: Bulitko V (1995) On Completeness of Pseudosimple Sets. JUCS - Journal of Universal Computer Science 1(2): 151-154. https://doi.org/10.3217/jucs-001-02-0151
Open Access
Abstract
The paper contains completeness criterions for pseudosimple sets. Those criterions are constructed using effectivization of the definitions as well as extensionally bounded functions.
Keywords
Completeness, Pseudosimple set, Effectivization, Extensionally bounded function