Obtaining infinitely many degrees of inconsistency by adding a strictly paraconsistent negation to classical logic
Crossref DOI link: https://doi.org/10.1007/s11229-020-02638-8
Published Online: 2020-04-06
Published Print: 2021-10
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Verdée, Peter
Text and Data Mining valid from 2020-04-06
Version of Record valid from 2020-04-06
Article History
Received: 2 August 2018
Accepted: 24 March 2020
First Online: 6 April 2020