Paraconsistent computation and dialetheic machines

Zach Weber

pp. 205-221

in: Holger Andreas, Peter Verdée (eds), Logical studies of paraconsistent reasoning in science and mathematics, Berlin, Springer, 2016

Abstract

Are there are any properly paraconsistent computations—effective procedures that are recognizable as such, but which are not recognized by non-paraconsistent logic? First we motivate a positive answer, from arguments by Sylvan and Copeland, Routley, and Priest. Then we look at some simple formulations of dialetheic machines and their basic properties, and discuss these in relation to the halting problem.