A simple sequent calculus for partial functions

DOI10.1016/0304-3975(93)90077-7zbMATH Open0791.03008OpenAlexW2083819142MaRDI QIDQ2367544FDOQ2367544

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

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

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)

Cites Work

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

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)