{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T07:26:34Z","timestamp":1781335594515,"version":"3.54.1"},"reference-count":12,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2020,10,21]],"date-time":"2020-10-21T00:00:00Z","timestamp":1603238400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["The Review of Symbolic Logic"],"published-print":{"date-parts":[[2021,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper explores relational syllogistic logics, a family of logical systems related to reasoning about relations in extensions of the classical syllogistic. These are all decidable logical systems. We prove completeness theorems and complexity results for a natural subfamily of relational syllogistic logics, parametrized by constructors for terms and for sentences.<\/jats:p>","DOI":"10.1017\/s1755020320000386","type":"journal-article","created":{"date-parts":[[2020,10,21]],"date-time":"2020-10-21T04:52:38Z","timestamp":1603255958000},"page":"728-765","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":3,"title":["EXPLORING THE LANDSCAPE OF RELATIONAL SYLLOGISTIC LOGICS"],"prefix":"10.1017","volume":"14","author":[{"given":"ALEX","family":"KRUCKMAN","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"LAWRENCE S.","family":"MOSS","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2020,10,21]]},"reference":[{"key":"S1755020320000386_r9","doi-asserted-by":"publisher","DOI":"10.33011\/lilt.v9i.1327"},{"key":"S1755020320000386_r1","doi-asserted-by":"publisher","DOI":"10.1145\/151261.151265"},{"key":"S1755020320000386_r8","volume-title":"Partiality and Underspecification in Natural Language Processing","author":"Moss","year":"2017"},{"key":"S1755020320000386_r3","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1515\/9783110211788.143","volume-title":"Logics for Linguistic Structures","author":"Moss","year":"2008"},{"key":"S1755020320000386_r12","unstructured":"[12] Spaan, E . (1993). Complexity of Modal Logics. Ph.D. Thesis, ILLC, University of Amsterdam."},{"key":"S1755020320000386_r11","first-page":"216","volume-title":"Proceedings of the Tenth Annual ACM Symposium on Theory of Computing","author":"Thomas","year":"1978"},{"key":"S1755020320000386_r7","volume-title":"Logic from Language","author":"Moss","year":"2020"},{"key":"S1755020320000386_r10","doi-asserted-by":"publisher","DOI":"10.1017\/S1755020309990086"},{"key":"S1755020320000386_r2","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(92)90063-4"},{"key":"S1755020320000386_r5","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exn086"},{"key":"S1755020320000386_r4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15025-8_27"},{"key":"S1755020320000386_r6","volume-title":"Handbook of Contemporary Semantic Theory","author":"Moss","year":"2015"}],"container-title":["The Review of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1755020320000386","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,10]],"date-time":"2023-10-10T06:59:20Z","timestamp":1696921160000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1755020320000386\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,21]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["S1755020320000386"],"URL":"https:\/\/doi.org\/10.1017\/s1755020320000386","relation":{},"ISSN":["1755-0203","1755-0211"],"issn-type":[{"value":"1755-0203","type":"print"},{"value":"1755-0211","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,21]]},"assertion":[{"value":"\u00a9 The Review of Symbolic Logic, 2020","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}}]}}