{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:14:52Z","timestamp":1774368892476,"version":"3.50.1"},"reference-count":22,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1978,5]]},"DOI":"10.1137\/0207018","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T11:01:52Z","timestamp":1109242912000},"page":"194-209","source":"Crossref","is-referenced-by-count":71,"title":["Rudimentary Predicates and Relative Computation"],"prefix":"10.1137","volume":"7","author":[{"given":"Celia","family":"Wrathall","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"351","reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1137\/0204037"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01705890"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(70)80031-9"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(70)80032-0"},{"key":"R8","first-page":"1","volume":"87","author":"Ginsburg S.","year":"1969","journal-title":"Mem. Amer. Math. Soc."},{"key":"R9","first-page":"41","volume":"87","author":"Ginsburg S.","year":"1969","journal-title":"Mem. Amer. Math. Soc."},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1137\/0202025"},{"key":"R11","first-page":"46","volume":"4","author":"Grzegorczyk Andrzej","year":"1953","journal-title":"Rozprawy Mat."},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(70)80018-6"},{"key":"R13","volume-title":"Formal languages and their relation to automata","author":"Hopcroft John E.","year":"1969"},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(73)80048-0"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01746515"},{"key":"R16","volume-title":"Relativization of the theory of computational complexity","author":"Lynch N.","year":"1972"},{"key":"R18","first-page":"29","volume":"6","author":"Nepomnja\u0161\u010di V. A.","year":"1970","journal-title":"Kibernetika (Kiev)"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1963-0158822-2"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(72)90205-7"},{"key":"R21","volume-title":"Theory of recursive functions and effective computability","author":"Rogers, Jr. Hartley","year":"1967"},{"key":"R22","volume-title":"Nondeterministic time and space complexity classes","author":"Seiferas J.","year":"1974"},{"key":"R23","doi-asserted-by":"crossref","DOI":"10.1515\/9781400882007","volume-title":"Theory of formal systems","author":"Smullyan Raymond M.","year":"1961"},{"key":"R24","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90061-X"},{"key":"R25","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(69)80032-2"},{"key":"R27","volume":"11","author":"Wrathall Celia","year":"1977","journal-title":"RAIRO Informat. Th\u00e9or."}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0207018","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T16:14:07Z","timestamp":1497629647000},"score":1,"resource":{"primary":{"URL":"http:\/\/epubs.siam.org\/doi\/10.1137\/0207018"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,5]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1978,5]]}},"alternative-id":["10.1137\/0207018"],"URL":"https:\/\/doi.org\/10.1137\/0207018","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1978,5]]}}}