Proof Systems for Reasoning about Computation Errors

Studia Logica 91 (2):273-293 (2009)
  Copy   BIBTEX

Abstract

In the paper we examine the use of non-classical truth values for dealing with computation errors in program specification and validation. In that context, 3-valued McCarthy logic is suitable for handling lazy sequential computation, while 3-valued Kleene logic can be used for reasoning about parallel computation. If we want to be able to deal with both strategies without distinguishing between them, we combine Kleene and McCarthy logics into a logic based on a non-deterministic, 3-valued matrix, incorporating both options as a non-deterministic choice. If the two strategies are to be distinguished, Kleene and McCarthy logics are combined into a logic based on a 4-valued deterministic matrix featuring two kinds of computation errors which correspond to the two computation strategies described above. For the resulting logics, we provide sound and complete calculi of ordinary, two-valued sequents

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The middle ground-ancestral logic.Liron Cohen & Arnon Avron - 2019 - Synthese 196 (7):2671-2693.
Proof systems for probabilistic uncertain reasoning.J. Paris & A. Vencovská - 1998 - Journal of Symbolic Logic 63 (3):1007-1039.
Reasoning, logic and computation.Stewart Shapiro - 1995 - Philosophia Mathematica 3 (1):31-51.
Situational constraints on normative reasoning.Earl Hunt - 2000 - Behavioral and Brain Sciences 23 (5):680-680.
Relational proof systems for spatial reasoning.Joanna Golińska-Pilarek & Ewa Orlowska - 2006 - Journal of Applied Non-Classical Logics 16 (3-4):409-431.
Miscomputation.Nir Fresco & Giuseppe Primiero - 2013 - Philosophy and Technology 26 (3):253-272.
A Taxonomy of Errors for Information Systems.Giuseppe Primiero - 2014 - Minds and Machines 24 (3):249-273.
What might dynamical intentionality be, if not computation?Ronald L. Chrisley - 1998 - Behavioral and Brain Sciences 21 (5):634-635.

Analytics

Added to PP
2009-03-23

Downloads
40 (#378,975)

6 months
2 (#1,157,335)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Arnon Avron
Tel Aviv University

Citations of this work

A computational interpretation of conceptivism.Thomas Macaulay Ferguson - 2014 - Journal of Applied Non-Classical Logics 24 (4):333-367.
An Unexpected Boolean Connective.Sérgio Marcelino - 2022 - Logica Universalis 16 (1):85-103.
Sequent-type rejection systems for finite-valued non-deterministic logics.Martin Gius & Hans Tompits - 2023 - Journal of Applied Non-Classical Logics 33 (3):606-640.

Add more citations