{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T20:55:52Z","timestamp":1648673752426},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,5,15]],"date-time":"2011-05-15T00:00:00Z","timestamp":1305417600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Philos Logic"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s10992-011-9181-7","type":"journal-article","created":{"date-parts":[[2011,5,13]],"date-time":"2011-05-13T22:44:39Z","timestamp":1305326679000},"page":"493-503","source":"Crossref","is-referenced-by-count":3,"title":["Why the Hardest Logic Puzzle Ever Cannot Be Solved in Less than Three Questions"],"prefix":"10.1007","volume":"41","author":[{"given":"Gregory","family":"Wheeler","sequence":"first","affiliation":[]},{"given":"Pedro","family":"Barahona","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,5,15]]},"reference":[{"key":"9181_CR1","doi-asserted-by":"crossref","first-page":"62","DOI":"10.5840\/harvardreview1996615","volume":"6","author":"G Boolos","year":"1996","unstructured":"Boolos, G. (1996). The hardest logic puzzle ever. The Harvard Review of Philosophy, 6, 62\u201365.","journal-title":"The Harvard Review of Philosophy"},{"key":"9181_CR2","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1093\/analys\/68.2.105","volume":"68","author":"B Rabern","year":"2008","unstructured":"Rabern, B., & Rabern, L. (2008). A simple solution to the hardest logic puzzle ever. Analysis, 68, 105\u2013112.","journal-title":"Analysis"},{"issue":"4","key":"9181_CR3","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1023\/A:1013344220298","volume":"30","author":"TS Roberts","year":"2001","unstructured":"Roberts, T. S. (2001). Some thoughts about the hardest logic puzzle ever. Journal of Philosophical Logic, 30(4), 609\u2013612.","journal-title":"Journal of Philosophical Logic"},{"key":"9181_CR4","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1093\/analys\/anp140","volume":"70","author":"G Uzquiano","year":"2010","unstructured":"Uzquiano, G. (2010). How to solve the hardest logic puzzle ever in two questions. Analysis, 70, 39\u201344.","journal-title":"Analysis"}],"container-title":["Journal of Philosophical Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10992-011-9181-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10992-011-9181-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10992-011-9181-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T21:29:50Z","timestamp":1559338190000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10992-011-9181-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,15]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["9181"],"URL":"https:\/\/doi.org\/10.1007\/s10992-011-9181-7","relation":{},"ISSN":["0022-3611","1573-0433"],"issn-type":[{"value":"0022-3611","type":"print"},{"value":"1573-0433","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,15]]}}}