Paraconsistency of Interactive Computation
| dc.creator | Goldin, Dina | |
| dc.creator | Wegner, Peter | |
| dc.date | 2002-07-21 | |
| dc.date.accessioned | 2026-07-07T03:18:42Z | |
| dc.date.available | 2026-07-07T03:18:42Z | |
| dc.description | The goal of computational logic is to allow us to model computation as well as to reason about it. We argue that a computational logic must be able to model interactive computation. We show that first-order logic cannot model interactive computation due to the incompleteness of interaction. We show that interactive computation is necessarily paraconsistent, able to model both a fact and its negation, due to the role of the world (environment) in determining the course of the computation. We conclude that paraconsistency is a necessary property for a logic that can model interactive computation. | |
| dc.description | 10 pages, no figures. Originally published in proc. PCL 2002, a FLoC workshop; eds. Hendrik Decker, Dina Goldin, Jorgen Villadsen, Toshiharu Waragai (http://floc02.diku.dk/PCL/) | |
| dc.identifier | https://arxiv.org/abs/cs/0207074 | |
| dc.identifier | http://arxiv.org/abs/cs/0207074 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31223 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | F.4.1; F.1.2; I.2.0; I.2.11 | |
| dc.title | Paraconsistency of Interactive Computation | |
| dc.type | text |