On Completeness of Pseudosimple Sets
| dc.creator | Bulitko,Vadim | |
| dc.date | 1995 | |
| dc.date.accessioned | 2024-02-06T12:47:35Z | |
| dc.date.available | 2024-02-06T12:47:35Z | |
| dc.description | The paper contains completeness criterions for pseudosimple sets. Those criterions are constructed using effectivization of the definitions as well as extensionally bounded functions. | |
| dc.format | text/html | |
| dc.identifier | https://doi.org/10.3217/jucs-001-02-0151 | |
| dc.identifier | https://lib.jucs.org/article/27102/ | |
| dc.identifier.uri | https://openrepository.mephi.ru/handle/123456789/6733 | |
| dc.language | en | |
| dc.publisher | Journal of Universal Computer Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/eissn/0948-6968 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/pissn/0948-695X | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights | J.UCS License | |
| dc.source | JUCS - Journal of Universal Computer Science 1(2): 151-154 | |
| dc.subject | Completeness | |
| dc.subject | Pseudosimple set | |
| dc.subject | Effectivization | |
| dc.subject | Extensionally bounded function | |
| dc.title | On Completeness of Pseudosimple Sets | |
| dc.type | Research Article |