{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T21:40:15Z","timestamp":1706650815269},"reference-count":0,"publisher":"Duke University Press","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Notre Dame J. Formal Logic"],"published-print":{"date-parts":[[1981,1,1]]},"DOI":"10.1305\/ndjfl\/1093883340","type":"journal-article","created":{"date-parts":[[2005,12,13]],"date-time":"2005-12-13T13:17:18Z","timestamp":1134479838000},"source":"Crossref","is-referenced-by-count":1,"title":["A highly efficient ``transfinite recursive definitions'' axiom for set theory."],"prefix":"10.1215","volume":"22","author":[{"given":"Robert S.","family":"Wolf","sequence":"first","affiliation":[]}],"member":"73","container-title":["Notre Dame Journal of Formal Logic"],"original-title":[],"link":[{"URL":"https:\/\/projecteuclid.org\/journalArticle\/Download?urlid=10.1305\/ndjfl\/1093883340","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,30]],"date-time":"2024-01-30T21:06:51Z","timestamp":1706648811000},"score":1,"resource":{"primary":{"URL":"https:\/\/projecteuclid.org\/journals\/notre-dame-journal-of-formal-logic\/volume-22\/issue-1\/A-highly-efficient-transfinite-recursive-definitions-axiom-for-set-theory\/10.1305\/ndjfl\/1093883340.full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,1,1]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[1981,1,1]]}},"URL":"https:\/\/doi.org\/10.1305\/ndjfl\/1093883340","relation":{},"ISSN":["0029-4527"],"issn-type":[{"value":"0029-4527","type":"print"}],"subject":[],"published":{"date-parts":[[1981,1,1]]}}}