{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T05:20:57Z","timestamp":1737091257550,"version":"3.33.0"},"reference-count":10,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,11,13]],"date-time":"2006-11-13T00:00:00Z","timestamp":1163376000000},"content-version":"vor","delay-in-days":6891,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Logic Qtrly"],"published-print":{"date-parts":[[1988,1]]},"DOI":"10.1002\/malq.19880340107","type":"journal-article","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T16:19:49Z","timestamp":1180196389000},"page":"53-64","source":"Crossref","is-referenced-by-count":0,"title":["First\u2010Order Formulas in Conjunctive Quantificational Form"],"prefix":"10.1002","volume":"34","author":[{"given":"Hans","family":"Kleine B\u00fcning","sequence":"first","affiliation":[]},{"given":"Theodor","family":"Lettmann","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,11,13]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02025119"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(84)90138-5"},{"volume-title":"The Decision Problem: Solvable Classes of Quantificational Formulas","year":"1979","author":"Dreben B.","key":"e_1_2_1_4_2"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0062837"},{"volume-title":"Computers and Intractibility: A Guide to the Theory of NP\u2010completeness","year":"1979","author":"Garey M.","key":"e_1_2_1_6_2"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(80)90027-6"},{"volume-title":"Unsolvable classes of quantificational formulas","year":"1979","author":"Lewis H.","key":"e_1_2_1_8_2"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90010-2"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s2-30.1.264"},{"key":"e_1_2_1_11_2","doi-asserted-by":"crossref","unstructured":"Schaefer T. J. The complexity of satisfiability problems. In: Proc. 10thAnn. ACM Symp. on Theory of Computing. pp.216\u2013226.","DOI":"10.1145\/800133.804350"}],"container-title":["Mathematical Logic Quarterly"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fmalq.19880340107","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/malq.19880340107","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T18:20:44Z","timestamp":1737051644000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/malq.19880340107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,1]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,1]]}},"alternative-id":["10.1002\/malq.19880340107"],"URL":"https:\/\/doi.org\/10.1002\/malq.19880340107","archive":["Portico"],"relation":{},"ISSN":["0942-5616","1521-3870"],"issn-type":[{"type":"print","value":"0942-5616"},{"type":"electronic","value":"1521-3870"}],"subject":[],"published":{"date-parts":[[1988,1]]}}}