{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T03:49:54Z","timestamp":1649216994776},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,8,1]],"date-time":"2011-08-01T00:00:00Z","timestamp":1312156800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Stud Logica"],"published-print":{"date-parts":[[2011,8]]},"DOI":"10.1007\/s11225-011-9343-1","type":"journal-article","created":{"date-parts":[[2011,8,11]],"date-time":"2011-08-11T12:47:30Z","timestamp":1313066850000},"page":"445-482","source":"Crossref","is-referenced-by-count":1,"title":["A Framework for Riddles about Truth that do not involve Self-Reference"],"prefix":"10.1007","volume":"98","author":[{"given":"Stefan","family":"Wintein","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,8,12]]},"reference":[{"key":"9343_CR1","doi-asserted-by":"crossref","first-page":"62","DOI":"10.5840\/harvardreview1996615","volume":"6","author":"George Boolos","year":"1996","unstructured":"Boolos George: \u2018The hardest logic puzzle ever\u2019. The Harvard Review of Philosophy 6, 62\u201365 (1996)","journal-title":"The Harvard Review of Philosophy"},{"key":"9343_CR2","unstructured":"(director), Jim Henson, \u2018The labyrinth\u2019, 1986."},{"key":"9343_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00302338","volume":"11","author":"Anil Gupta","year":"1982","unstructured":"Gupta Anil: \u2018Truth and paradox\u2019. Journal of Philosophical Logic 11, 1\u201360 (1982)","journal-title":"Journal of Philosophical Logic"},{"key":"9343_CR4","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1093\/analys\/68.2.105","volume":"68","author":"Brain Rabern","year":"2008","unstructured":"Rabern Brain, Landoln Rabern: \u2018A simple solution to the hardest logic puzzle ever\u2019. Analysis 68, 105\u2013112 (2008)","journal-title":"Analysis"},{"key":"9343_CR5","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1023\/A:1013344220298","volume":"30","author":"Tim Roberts","year":"2001","unstructured":"Roberts Tim: \u2018Some thoughts about the hardest logic puzzle ever\u2019. Journal of Philosophical Logic 30, 609\u2013612 (2001)","journal-title":"Journal of Philosophical Logic"},{"key":"9343_CR6","volume-title":"What is the name of this book?","author":"Raymond Smullyan","year":"1978","unstructured":"Smullyan Raymond: What is the name of this book?. Englewood Cliffs, NJ, Prentice Hall (1978)"},{"key":"9343_CR7","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1093\/analys\/anp140","volume":"70","author":"Gabriel Uzquiano","year":"2010","unstructured":"Uzquiano Gabriel: \u2018How to solve the hardest logic puzzle ever in two questions\u2019. Analysis 70, 39\u201344 (2010)","journal-title":"Analysis"},{"key":"9343_CR8","unstructured":"Wintein, Stefan, \u2018On languages that contain their own ungroundedness predicate\u2019, To appear in: Logique et Analyse, 2011."}],"container-title":["Studia Logica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11225-011-9343-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11225-011-9343-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11225-011-9343-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:24:48Z","timestamp":1559384688000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11225-011-9343-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["9343"],"URL":"https:\/\/doi.org\/10.1007\/s11225-011-9343-1","relation":{},"ISSN":["0039-3215","1572-8730"],"issn-type":[{"value":"0039-3215","type":"print"},{"value":"1572-8730","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8]]}}}