{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,3]],"date-time":"2024-12-03T05:10:48Z","timestamp":1733202648495,"version":"3.30.0"},"reference-count":0,"publisher":"SAGE Publications","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.3233\/fi-1994-2044","type":"journal-article","created":{"date-parts":[[2019,12,3]],"date-time":"2019-12-03T01:26:38Z","timestamp":1575336398000},"page":"353-379","source":"Crossref","is-referenced-by-count":62,"title":["ON SKOLEMIZATION AND PROOF COMPLEXITY"],"prefix":"10.1177","volume":"20","author":[{"given":"Matthias","family":"Baaz","sequence":"first","affiliation":[{"name":"Institut f\u00fcr Algebra und Diskrete Mathematik, Technische Universit\u00e4t Wien, Wiedner Hauptstra\u03b2e 8-10, A-1040 Wien, Austria"}]},{"given":"Alexander","family":"Leitsch","sequence":"additional","affiliation":[{"name":"Institut f\u00fcr Computersprachen, Technische Universit\u00e4t Wien, Resselgasse 3, A-1040 Wien, Austria, email, leitsch@csdecl.twwien.ac.at"}]}],"member":"179","container-title":["Fundamenta Informaticae"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/FI-1994-2044","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T11:49:26Z","timestamp":1733140166000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/FI-1994-2044"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1994]]}},"URL":"https:\/\/doi.org\/10.3233\/fi-1994-2044","relation":{},"ISSN":["0169-2968"],"issn-type":[{"type":"print","value":"0169-2968"}],"subject":[],"published":{"date-parts":[[1994]]}}}