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

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 105,586

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

Rough Sets and 3-Valued Logics.A. Avron & B. Konikowska - 2008 - Studia Logica 90 (1):69-92.
Modeling the interaction of computer errors by four-valued contaminating logics.Roberto Ciuni, Thomas Macaulay Ferguson & Damian Szmuc - 2019 - In Rosalie Iemhoff, Michael Moortgat & Ruy de Queiroz, Logic, Language, Information, and Computation. Folli Publications on Logic, Language and Information. pp. 119-139.
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.
Two-valued weak Kleene logics.Bruno da Ré & Damian Szmuc - 2019 - Manuscrito 42 (1):1-43.
Non-deterministic Semantics for Logical Systems.Arnon Avron - 2005 - Handbook of Philosophical Logic 16 (14):227–304.

Analytics

Added to PP
2009-03-23

Downloads
51 (#473,207)

6 months
4 (#1,004,452)

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.
Modeling the interaction of computer errors by four-valued contaminating logics.Roberto Ciuni, Thomas Macaulay Ferguson & Damian Szmuc - 2019 - In Rosalie Iemhoff, Michael Moortgat & Ruy de Queiroz, Logic, Language, Information, and Computation. Folli Publications on Logic, Language and Information. pp. 119-139.
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

References found in this work

Canonical Propositional Gentzen-type Systems.Arnon Avron - 2005 - Proceedings of the 1St International Joint Conference on Automated Reasoning 13:365–387.

Add more references