Name
Abstract | ||
|---|---|---|
The goal of computational logic is to allow us to model com- putation 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 incomplete- ness 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 compu- tation. We conclude that paraconsistency is a necessary property for a logic that can model interactive computation. |
Year | Venue | Keywords |
|---|---|---|
2002 | Paraconsistent Computational Logic | first order logic,computational logic |
Field | DocType | Citations |
Computation tree logic,Computational logic,Autoepistemic logic,Paraconsistent logic,Computer science,Algorithm,Multimodal logic,Probabilistic CTL,Theoretical computer science,Model of computation,Interactive computation | Conference | 1 |
PageRank | References | Authors |
0.37 | 5 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dina Q. Goldin | 1 | 409 | 80.99 |
| Peter Wegner | 2 | 2049 | 473.19 |