{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T19:07:12Z","timestamp":1770232032050,"version":"3.49.0"},"reference-count":26,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2023,9,29]],"date-time":"2023-09-29T00:00:00Z","timestamp":1695945600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["The Review of Symbolic Logic"],"published-print":{"date-parts":[[2024,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper extends the investigations into logical properties of the quantified argument calculus (Quarc) by suggesting a series of proper subsystems which, although retaining the entire vocabulary of Quarc, restrict quantification in such a way as to make the result decidable. The proof of decidability is via a procedure that prunes the infinite branches of a derivation tree in what is a syntactic counterpart of semantic filtration. We demonstrate an application of one of these systems by showing that Aristotle\u2019s assertoric syllogistic is embeddable within, thus also providing another method of showing its decidability.<\/jats:p>","DOI":"10.1017\/s175502032300031x","type":"journal-article","created":{"date-parts":[[2023,9,29]],"date-time":"2023-09-29T09:10:32Z","timestamp":1695978632000},"page":"736-761","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":3,"title":["DECIDABLE FRAGMENTS OF THE QUANTIFIED ARGUMENT CALCULUS"],"prefix":"10.1017","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6331-4256","authenticated-orcid":false,"given":"EDI","family":"PAVLOVI\u0106","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0660-6527","authenticated-orcid":false,"given":"NORBERT","family":"GRATZL","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2023,9,29]]},"reference":[{"key":"S175502032300031X_r12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-24312-2_9"},{"key":"S175502032300031X_r6","doi-asserted-by":"publisher","DOI":"10.2307\/2269326"},{"key":"S175502032300031X_r1","volume-title":"Logic and Natural Language: On Plural Reference and its Semantic and Logical Significance","author":"Ben-Yami","year":"2004"},{"key":"S175502032300031X_r25","doi-asserted-by":"publisher","DOI":"10.1515\/9781501502620-018"},{"key":"S175502032300031X_r26","doi-asserted-by":"publisher","DOI":"10.1007\/s11225-022-10022-5"},{"key":"S175502032300031X_r5","first-page":"53","volume-title":"Human Rationality: Festschrift for Nenad Smokrovi\u0107, Faculty of Humanities and Social Sciences","author":"Ben-Yami","year":"2022"},{"key":"S175502032300031X_r3","first-page":"35","article-title":"The quantified argument calculus and natural logic","volume":"74","author":"Ben-Yami","year":"2020","journal-title":"Dialectica"},{"key":"S175502032300031X_r14","doi-asserted-by":"publisher","DOI":"10.1017\/S1755020315000295"},{"key":"S175502032300031X_r10","doi-asserted-by":"publisher","DOI":"10.1017\/S1755020317000053"},{"key":"S175502032300031X_r4","doi-asserted-by":"publisher","DOI":"10.1007\/s11229-020-02771-4"},{"key":"S175502032300031X_r13","doi-asserted-by":"publisher","DOI":"10.1007\/s11225-020-09914-1"},{"key":"S175502032300031X_r15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511527340"},{"key":"S175502032300031X_r19","doi-asserted-by":"publisher","DOI":"10.1017\/S1755020318000114"},{"key":"S175502032300031X_r20","doi-asserted-by":"publisher","DOI":"10.1007\/s10992-020-09564-7"},{"key":"S175502032300031X_r9","doi-asserted-by":"publisher","DOI":"10.1017\/S1755020318000023"},{"key":"S175502032300031X_r16","first-page":"1","article-title":"An axiomatic approach to the quantified argument calculus","author":"Pascucci","year":"2022","journal-title":"Erkenntnis"},{"key":"S175502032300031X_r11","doi-asserted-by":"publisher","DOI":"10.1007\/s11787-014-0097-1"},{"key":"S175502032300031X_r17","author":"Pavlovi\u0107","year":"2017"},{"key":"S175502032300031X_r22","author":"Raab","year":"2016"},{"key":"S175502032300031X_r23","doi-asserted-by":"publisher","DOI":"10.1080\/01445340.2018.1467198"},{"key":"S175502032300031X_r24","first-page":"230","article-title":"On computable numbers, with an application to the Entscheidungsproblem","volume":"42","author":"Turing","year":"1936","journal-title":"Proceedings of the London Mathematical Society"},{"key":"S175502032300031X_r18","doi-asserted-by":"publisher","DOI":"10.1515\/9783110657883-007"},{"key":"S175502032300031X_r8","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2012.42"},{"key":"S175502032300031X_r21","doi-asserted-by":"publisher","DOI":"10.1017\/S175502032100006X"},{"key":"S175502032300031X_r2","doi-asserted-by":"publisher","DOI":"10.1017\/S1755020313000373"},{"key":"S175502032300031X_r7","doi-asserted-by":"publisher","DOI":"10.2307\/2371045"}],"container-title":["The Review of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S175502032300031X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,5]],"date-time":"2024-11-05T11:11:31Z","timestamp":1730805091000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S175502032300031X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,29]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["S175502032300031X"],"URL":"https:\/\/doi.org\/10.1017\/s175502032300031x","relation":{},"ISSN":["1755-0203","1755-0211"],"issn-type":[{"value":"1755-0203","type":"print"},{"value":"1755-0211","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,29]]},"assertion":[{"value":"\u00a9 The Author(s), 2023. Published by Cambridge University Press on behalf of The Association for Symbolic Logic","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https:\/\/creativecommons.org\/licenses\/by\/4.0\/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.","name":"license","label":"License","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}