Proof systems for reasoning about computation errors

DOI10.1007/s11225-009-9175-4zbMath1169.03022OpenAlexW2037668023MaRDI QIDQ1015487

Arnon Avron, Beata Konikowska

Publication date: 8 May 2009

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-009-9175-4

zbMATH Keywords

parallel computationsequent calculinondeterministic matricesthree-valued logicscomputation errorsfour-valued logicslazy sequential computation

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Many-valued logic (03B50)

Related Items (10)

An unexpected Boolean connective ⋮ Truth versus information in logic programming ⋮ A computational interpretation of conceptivism ⋮ McCarthy-Kleene fuzzy automata and MSO logics ⋮ Sequent-type rejection systems for finite-valued non-deterministic logics ⋮ On solvability of systems of partial fuzzy relational equations ⋮ Preservation of properties of residuated algebraic structure by structures for the partial fuzzy set theory ⋮ Unnamed Item ⋮ A dissimilarity-based framework for generating inconsistency-tolerant logics ⋮ Missing values and dragonfly operations in fuzzy relational compositions

Cites Work

• A logic covering undefinedness in program proofs
• Cut-free ordinary sequent calculi for logics having generalized finite-valued semantics
• Partial-predicate logic in computer science
• Non-deterministic Multiple-valued Structures
• Two over three: a two-valued logic for software specification and validation over a three-valued predicate calculus
• Note on Abstract Commutative Ideal Theory
• Multi-valued Calculi for Logics Based on Non-determinism
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Proof systems for reasoning about computation errors