{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T01:43:35Z","timestamp":1760147015732},"reference-count":8,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2014,3,12]],"date-time":"2014-03-12T00:00:00Z","timestamp":1394582400000},"content-version":"unspecified","delay-in-days":557,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. symb. log."],"published-print":{"date-parts":[[2012,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>As proved recently, the satisfaction problem for all prenex formulae in the set-theoretic Bernays-Sh\u00f6nfinkel-Ramsey class is semi-decidable over von Neumann's cumulative hierarchy. Here that semi-decidability result is strengthened into a decidability result for the same collection of formulae.<\/jats:p>","DOI":"10.2178\/jsl\/1344862166","type":"journal-article","created":{"date-parts":[[2012,11,5]],"date-time":"2012-11-05T10:02:32Z","timestamp":1352109752000},"page":"896-918","source":"Crossref","is-referenced-by-count":16,"title":["The Bernays-Sch\u00f6nfinkel-Ramsey class for set theory: decidability"],"prefix":"10.1017","volume":"77","author":[{"given":"Alberto","family":"Policriti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eugenio","family":"Omodeo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2014,3,12]]},"reference":[{"key":"S0022481200000542_ref002","volume-title":"Set theory for computing. From decision procedures to declarative programming with sets","author":"Cantone","year":"2001"},{"key":"S0022481200000542_ref007","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1988-0938682-2"},{"key":"S0022481200000542_ref001","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59207-2"},{"key":"S0022481200000542_ref003","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(95)00147-6"},{"key":"S0022481200000542_ref005","first-page":"459","volume":"75","author":"Omodeo","year":"2010","journal-title":"The Bernays-Sch\u00f6nfinkel-Ramsey class for set theory: Semidecidability"},{"key":"S0022481200000542_ref008","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s2-30.1.264"},{"key":"S0022481200000542_ref004","volume-title":"Set theory: an introduction to independence proofs","author":"Kunen","year":"1983"},{"key":"S0022481200000542_ref006","article-title":"Infinity, in short","author":"Omodeo","journal-title":"Journal of Logic and Computation"}],"container-title":["The Journal of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0022481200000542","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T19:29:14Z","timestamp":1556134154000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0022481200000542\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["S0022481200000542"],"URL":"https:\/\/doi.org\/10.2178\/jsl\/1344862166","relation":{},"ISSN":["0022-4812","1943-5886"],"issn-type":[{"value":"0022-4812","type":"print"},{"value":"1943-5886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9]]}}}