Switch to: References

Add citations

You must login to add citations.
  1. Proof Systems for Reasoning about Computation Errors.Arnon Avron & Beata Konikowska - 2009 - Studia Logica 91 (2):273-293.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Rough Sets and 3-Valued Logics.A. Avron & B. Konikowska - 2008 - Studia Logica 90 (1):69-92.
    In the paper we explore the idea of describing Pawlak’s rough sets using three-valued logic, whereby the value t corresponds to the positive region of a set, the value f — to the negative region, and the undefined value u — to the border of the set. Due to the properties of the above regions in rough set theory, the semantics of the logic is described using a non-deterministic matrix (Nmatrix). With the strong semantics, where only the value t is (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations