Proof systems for reasoning about computation errors

DOI10.1007/s11225-009-9175-4zbMath1169.03022MaRDI 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 computation; sequent calculi; nondeterministic matrices; three-valued logics; computation errors; four-valued logics; lazy sequential computation

Mathematics Subject Classification ID

03B70: Logic in computer science

68Q60: Specification and verification (program logics, model checking, etc.)

03B50: Many-valued logic

Related Items

A computational interpretation of conceptivism, McCarthy-Kleene fuzzy automata and MSO logics, A dissimilarity-based framework for generating inconsistency-tolerant logics, Missing values and dragonfly operations in fuzzy relational compositions, Truth versus information in logic programming, Unnamed Item

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