{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,27]],"date-time":"2023-10-27T12:40:40Z","timestamp":1698410440293},"reference-count":6,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,11,13]],"date-time":"2006-11-13T00:00:00Z","timestamp":1163376000000},"content-version":"vor","delay-in-days":4334,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Logic Qtrly"],"published-print":{"date-parts":[[1995,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We suggest some new ways to effectivize the definitions of several classes of simple sets. On this basis, new completeness criterions for simple sets are obtained. In particular, we give descriptions of the class of complete maximal sets.<\/jats:p>","DOI":"10.1002\/malq.19950410303","type":"journal-article","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T17:47:15Z","timestamp":1180201635000},"page":"307-313","source":"Crossref","is-referenced-by-count":2,"title":["On Some Complexity Characteristics of Immune Sets"],"prefix":"10.1002","volume":"41","author":[{"given":"Valeriy K.","family":"Bulitko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,11,13]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"Arslanov M. M. The Local Theory of Degrees of Unsolvability and \u0394\u2010sets. Kazan State University Kazan1987(in Russian)."},{"key":"e_1_2_1_3_2","first-page":"3","article-title":"Sub\u2010Turing\u2010reducibilities with bounded complexity","volume":"1","author":"Bulitko V. K.","year":"1991","journal-title":"Izvestiya Vysshykh Uchebnykh Zavedenii, Mathem."},{"key":"e_1_2_1_4_2","unstructured":"Bulitko V. K. Complexity of resolving for sets and reducibility. In:Third Logical Biennial Summer School and Conference in Honor of S. C. Kleene1990 Bulgaria Abstracts p.13."},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.2307\/2036145"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(69)90538-5"},{"key":"e_1_2_1_7_2","first-page":"262","article-title":"On normal algorithms which compute Boolean functions","volume":"157","author":"Markov A. A.","year":"1964","journal-title":"Dokl. Akad. Nauk SSSR"}],"container-title":["Mathematical Logic Quarterly"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fmalq.19950410303","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/malq.19950410303","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T14:45:27Z","timestamp":1698331527000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/malq.19950410303"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["10.1002\/malq.19950410303"],"URL":"https:\/\/doi.org\/10.1002\/malq.19950410303","archive":["Portico"],"relation":{},"ISSN":["0942-5616","1521-3870"],"issn-type":[{"value":"0942-5616","type":"print"},{"value":"1521-3870","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,1]]}}}