{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T20:14:29Z","timestamp":1776888869919,"version":"3.51.2"},"reference-count":2,"publisher":"Cambridge University Press (CUP)","issue":"06","license":[{"start":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T00:00:00Z","timestamp":1552435200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2019,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We add Most<jats:italic>X<\/jats:italic>are<jats:italic>Y<\/jats:italic>to the syllogistic logic of All<jats:italic>X<\/jats:italic>are<jats:italic>Y<\/jats:italic>and Some<jats:italic>X<\/jats:italic>are<jats:italic>Y<\/jats:italic>. We prove soundness, completeness, and decidability in polynomial time. Our logic has infinitely many rules, and we prove that this is unavoidable.<\/jats:p>","DOI":"10.1017\/s0960129518000312","type":"journal-article","created":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T09:59:10Z","timestamp":1552471150000},"page":"763-782","source":"Crossref","is-referenced-by-count":5,"title":["Syllogistic logic with \u201cMost\u201d"],"prefix":"10.1017","volume":"29","author":[{"given":"J\u00f6rg","family":"Endrullis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lawrence S.","family":"Moss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2019,3,13]]},"reference":[{"key":"S0960129518000312_ref1","doi-asserted-by":"publisher","DOI":"10.1090\/proc\/13038"},{"key":"S0960129518000312_ref2","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1515\/9783110211788.143","volume-title":"Logics for Linguistic Structures","author":"Moss","year":"2008"}],"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129518000312","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T12:53:07Z","timestamp":1694695987000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129518000312\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,13]]},"references-count":2,"journal-issue":{"issue":"06","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["S0960129518000312"],"URL":"https:\/\/doi.org\/10.1017\/s0960129518000312","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3,13]]}}}