A simple sequent calculus for partial functions

DOI10.1016/0304-3975(93)90077-7zbMath0791.03008OpenAlexW2083819142MaRDI QIDQ2367544

Morten Elvang-Gøransson, Olaf Owe

Publication date: 5 July 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(93)90077-7

zbMATH Keywords

expressive completenesscompletenesscut eliminationsequent calculusdeduction theoremthree-valued logicsoundnesslogic for partial functionsweak-strong-logic

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A logic covering undefinedness in program proofs
• A first order logic for partial functions
• Partial logics reconsidered: A conservative approach
• Weak logic theory
• On a Formalization of the Non-Definedness Notion
• A PARTIAL PREDICATE CALCULUS IN A TWO-VALUED LOGIC
• Natural 3-valued logics—characterization and proof theory
• A Complete Axiomatization of the Three valued Completion of Logic Programs