Proof systems for reasoning about computation errors

DOI10.1007/S11225-009-9175-4MaRDI QIDQ1015487zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• A four-valued logic for reasoning about finite and infinite computation errors in programs
• A calculus for four-valued sequential logic
• Propositional calculus for the sequential three-valued logic (McCarthy-like systems)
• scientific article; zbMATH DE number 13471
• scientific article; zbMATH DE number 3870581

Cites work

• scientific article; zbMATH DE number 13470 (Why is no real title available?)
• scientific article; zbMATH DE number 13471 (Why is no real title available?)
• scientific article; zbMATH DE number 1765698 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• A four-valued logic for reasoning about finite and infinite computation errors in programs
• A logic covering undefinedness in program proofs
• Cut-free ordinary sequent calculi for logics having generalized finite-valued semantics
• Multi-valued Calculi for Logics Based on Non-determinism
• Non-deterministic Multiple-valued Structures
• Note on Abstract Commutative Ideal Theory
• Partial-predicate logic in computer science
• Two over three: a two-valued logic for software specification and validation over a three-valued predicate calculus

Cited in

(12)

• Missing values and dragonfly operations in fuzzy relational compositions
• scientific article; zbMATH DE number 2102744 (Why is no real title available?)
• A dissimilarity-based framework for generating inconsistency-tolerant logics
• McCarthy-Kleene fuzzy automata and MSO logics
• An unexpected Boolean connective
• MK-fuzzy automata and MSO logics
• On solvability of systems of partial fuzzy relational equations
• Truth versus information in logic programming
• A four-valued logic for reasoning about finite and infinite computation errors in programs
• A computational interpretation of conceptivism
• Sequent-type rejection systems for finite-valued non-deterministic logics
• Preservation of properties of residuated algebraic structure by structures for the partial fuzzy set theory

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1015487)