{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T21:10:22Z","timestamp":1706649022804},"reference-count":0,"publisher":"Duke University Press","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[1969,7,1]]},"DOI":"10.1305\/ndjfl\/1093893720","type":"journal-article","created":{"date-parts":[[2005,12,13]],"date-time":"2005-12-13T17:09:01Z","timestamp":1134493741000},"source":"Crossref","is-referenced-by-count":1,"title":["A semi-completeness theorem."],"prefix":"10.1215","volume":"10","author":[{"given":"Stephen L.","family":"Bloom","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"73","container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1305\/ndjfl\/1093893720","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T20:58:41Z","timestamp":1706648321000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-10\/issue-3\/A-semi-completeness-theorem\/10.1305\/ndjfl\/1093893720.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1969,7,1]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[1969,7,1]]}},"URL":"https:\/\/doi.org\/10.1305\/ndjfl\/1093893720","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[1969,7,1]]}}}