A simple sequent calculus for partial functions

DOI10.1016/0304-3975(93)90077-7MaRDI QIDQ2367544zbMATH OpenOpenAlexFDO

Authors 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

completenesscut eliminationsequent calculussoundnessthree-valued logicdeduction theoremlogic for partial functionsexpressive completenessweak-strong-logic

Mathematics Subject Classification ID

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

Recommendations

• A first order logic for partial functions (extended abstract)
• Partial and paraconsistent three-valued logics
• Sequent calculi for three-valued logics
• Partial logics reconsidered: A conservative approach

Cites work

• scientific article; zbMATH DE number 42059 (Why is no real title available?)
• scientific article; zbMATH DE number 54048 (Why is no real title available?)
• scientific article; zbMATH DE number 1028816 (Why is no real title available?)
• scientific article; zbMATH DE number 3275554 (Why is no real title available?)
• A Complete Axiomatization of the Three valued Completion of Logic Programs
• A PARTIAL PREDICATE CALCULUS IN A TWO-VALUED LOGIC
• A first order logic for partial functions
• A logic covering undefinedness in program proofs
• Natural 3-valued logics—characterization and proof theory
• On a Formalization of the Non-Definedness Notion
• Partial logics reconsidered: A conservative approach
• Weak logic theory

This page was built for publication: A simple sequent calculus for partial functions

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