Paraconsistency of Interactive Computation Export

@misc{citeulike:1111604, abstract = {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.}, archivePrefix = {arXiv}, author = {Goldin, Dina and Wegner, Peter}, citeulike-article-id = {1111604}, citeulike-linkout-0 = {http://arxiv.org/abs/cs.LO/0207074}, citeulike-linkout-1 = {http://arxiv.org/pdf/cs.LO/0207074}, day = {21}, eprint = {cs.LO/0207074}, keywords = {abduction, all-computational-structures, all-logical-theories, all-physical-structures, computability-logic, concurrency, consistency, contradiction, countability, decoherence, domain-theory, dynamical-system, enumerability, equivalence-class, fol, game-theory, games, generalized-algorithmic-probability, generalized-kolmogorov-complexity, gtm, iff, incompleteness, inference, infinite, interactivity, lattice-of-theories, logics, long-range-correlation, many-body, metaevolution, metalogic-programming, minimum-sufficient-statistic, modeling, nonmonotonicity, observability, paraconsistency, problem-solving, proof-tree, quantum-field-computation, quantum-vacuum, relevant-logic, resources, scale-relativity, self-duality, semantics, symmetry-breaking, syntax, temporal-relevant-logic, time-horizon, universality, universality-class}, month = {Jul}, posted-at = {2007-02-18 15:19:53}, priority = {2}, title = {Paraconsistency of Interactive Computation}, url = {http://arxiv.org/abs/cs.LO/0207074}, year = {2002} }

TY - ELEC ID - citeulike:1111604 L3 - citeulike-article-id:1111604 N2 - 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. TI - Paraconsistency of Interactive Computation KW - abduction KW - all-computational-structures KW - all-logical-theories KW - all-physical-structures KW - computability-logic KW - concurrency KW - consistency KW - contradiction KW - countability KW - decoherence KW - domain-theory KW - dynamical-system KW - enumerability KW - equivalence-class KW - fol KW - game-theory KW - games KW - generalized-algorithmic-probability KW - generalized-kolmogorov-complexity KW - gtm KW - iff KW - incompleteness KW - inference KW - infinite KW - interactivity KW - lattice-of-theories KW - logics KW - long-range-correlation KW - many-body KW - metaevolution KW - metalogic-programming KW - minimum-sufficient-statistic KW - modeling KW - nonmonotonicity KW - observability KW - paraconsistency KW - problem-solving KW - proof-tree KW - quantum-field-computation KW - quantum-vacuum KW - relevant-logic KW - resources KW - scale-relativity KW - self-duality KW - semantics KW - symmetry-breaking KW - syntax KW - temporal-relevant-logic KW - time-horizon KW - universality KW - universality-class AU - Goldin, Dina AU - Wegner, Peter PY - 2002/Jul/21/ UR - http://arxiv.org/abs/cs.LO/0207074 ER -