Paraconsistency of Interactive Computation

Details Paraconsistency of Interactive Computation Paraconsistency of Interactive Computation

2002-07-21

arxiv.org/abs/cs/0207074v1

Computer Science

Logic in Computer Science

10 pages, no figures. Originally published in proc. PCL 2002, a FLoC workshop; eds. Hendrik Decker, Dina Goldin, Jorgen Villad

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Paraconsistency of Interactive Computation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Paraconsistency of Interactive Computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Paraconsistency of Interactive Computation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-551472