{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,26]],"date-time":"2025-05-26T10:04:10Z","timestamp":1748253850063,"version":"3.40.5"},"reference-count":16,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T00:00:00Z","timestamp":1645574400000},"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":[[2023,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Minimally inconsistent LP (MiLP) is a nonmonotonic paraconsistent logic based on Graham Priest\u2019s logic of paradox (LP). Unlike LP, MiLP purports to recover, in consistent situations, all of classical reasoning. The present paper conducts a proof-theoretic analysis of MiLP. I highlight certain properties of this logic, introduce a simple sequent system for it, and establish soundness and completeness results. In addition, I show how to use my proof system in response to a criticism of this logic put forward by J. C. Beall.<\/jats:p>","DOI":"10.1017\/s1755020322000090","type":"journal-article","created":{"date-parts":[[2022,2,23]],"date-time":"2022-02-23T08:51:17Z","timestamp":1645606277000},"page":"1296-1311","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":4,"title":["A SIMPLE SEQUENT SYSTEM FOR MINIMALLY INCONSISTENT LP"],"prefix":"10.1017","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4923-9998","authenticated-orcid":false,"given":"REA","family":"GOLAN","sequence":"first","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2022,2,23]]},"reference":[{"key":"S1755020322000090_r6","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.325.23"},{"key":"S1755020322000090_r5","doi-asserted-by":"publisher","DOI":"10.1093\/mind\/fzv214"},{"key":"S1755020322000090_r14","doi-asserted-by":"publisher","DOI":"10.1093\/analys\/ans120"},{"key":"S1755020322000090_r1","doi-asserted-by":"publisher","DOI":"10.1017\/S1755020311000074"},{"key":"S1755020322000090_r10","doi-asserted-by":"publisher","DOI":"10.1007\/BF00258428"},{"key":"S1755020322000090_r13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511801174"},{"key":"S1755020322000090_r7","doi-asserted-by":"publisher","DOI":"10.1007\/s11229-018-1687-x"},{"key":"S1755020322000090_r11","doi-asserted-by":"publisher","DOI":"10.1007\/BF00370190"},{"key":"S1755020322000090_r12","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199263301.001.0001"},{"key":"S1755020322000090_r8","first-page":"296","volume-title":"Annual Conference on Artificial Intelligence","author":"Lin","year":"1994"},{"key":"S1755020322000090_r2","doi-asserted-by":"publisher","DOI":"10.1093\/analys\/ans069"},{"key":"S1755020322000090_r4","doi-asserted-by":"publisher","DOI":"10.1093\/mind\/fzt110"},{"key":"S1755020322000090_r15","doi-asserted-by":"publisher","DOI":"10.1002\/tht3.201"},{"key":"S1755020322000090_r9","doi-asserted-by":"publisher","DOI":"10.1080\/00048402.2019.1640323"},{"key":"S1755020322000090_r3","doi-asserted-by":"publisher","DOI":"10.1093\/analys\/ant057"},{"key":"S1755020322000090_r16","doi-asserted-by":"publisher","DOI":"10.2307\/2274279"}],"container-title":["The Review of Symbolic Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1755020322000090","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,19]],"date-time":"2023-12-19T23:59:55Z","timestamp":1703030395000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1755020322000090\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,23]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["S1755020322000090"],"URL":"https:\/\/doi.org\/10.1017\/s1755020322000090","relation":{},"ISSN":["1755-0203","1755-0211"],"issn-type":[{"type":"print","value":"1755-0203"},{"type":"electronic","value":"1755-0211"}],"subject":[],"published":{"date-parts":[[2022,2,23]]},"assertion":[{"value":"\u00a9 The Author(s), 2022. 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"}]}}