A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf
.
Consistency and Decidability in Some Paraconsistent Arithmetics
2021
The Australasian Journal of Logic
The standard style of argument used to prove that a theory is unde- cidable relies on certain consistency assumptions, usually that some fragment or other is negation consistent. In a non-paraconsistent set- ting, this amounts to an assumption that the theory is non-trivial, but these diverge when theories are couched in paraconsistent logics. Furthermore, there are general methods for constructing inconsistent models of arithmetic from consistent models, and the theories of such inconsistent
doi:10.26686/ajl.v18i5.6921
fatcat:ylxgkhrmava2po7kybx53izclq