Deutsche Gesellschaft
für phänomenologische Forschung

Series | Buch | Kapitel

179179

Paraconsistent computation and dialetheic machines

Zach Weber

pp. 205-221

Abstrakt

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.

Publication details

Published in:

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

Seiten: 205-221

DOI: 10.1007/978-3-319-40220-8_13

Referenz:

Weber Zach (2016) „Paraconsistent computation and dialetheic machines“, In: H. Andreas & P. Verdée (eds.), Logical studies of paraconsistent reasoning in science and mathematics, Dordrecht, Springer, 205–221.