Proof systems for reasoning about computation errors
DOI10.1007/S11225-009-9175-4zbMATH Open1169.03022OpenAlexW2037668023MaRDI QIDQ1015487FDOQ1015487
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
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
parallel computationsequent calculinondeterministic matricesthree-valued logicscomputation errorsfour-valued logicslazy sequential computation
Many-valued logic (03B50) Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)
Cites Work
- Title not available (Why is that?)
- Non-deterministic Multiple-valued Structures
- Title not available (Why is that?)
- A logic covering undefinedness in program proofs
- Multi-valued Calculi for Logics Based on Non-determinism
- Title not available (Why is that?)
- Cut-free ordinary sequent calculi for logics having generalized finite-valued semantics
- Note on Abstract Commutative Ideal Theory
- Title not available (Why is that?)
- Partial-predicate logic in computer science
- Two over three: a two-valued logic for software specification and validation over a three-valued predicate calculus
- A four-valued logic for reasoning about finite and infinite computation errors in programs
Cited In (12)
- MK-fuzzy automata and MSO logics
- On solvability of systems of partial fuzzy relational equations
- McCarthy-Kleene fuzzy automata and MSO logics
- A computational interpretation of conceptivism
- Truth versus information in logic programming
- Sequent-type rejection systems for finite-valued non-deterministic logics
- A four-valued logic for reasoning about finite and infinite computation errors in programs
- Preservation of properties of residuated algebraic structure by structures for the partial fuzzy set theory
- Title not available (Why is that?)
- Missing values and dragonfly operations in fuzzy relational compositions
- A dissimilarity-based framework for generating inconsistency-tolerant logics
- An unexpected Boolean connective
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)
