Classical logic with partial functions

DOI10.1007/s10817-011-9236-zzbMath1259.03047OpenAlexW1999732797MaRDI QIDQ438568

Hans de Nivelle

Publication date: 31 July 2012

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-011-9236-z

zbMATH Keywords

cut eliminationsequent calculitype systemslogic for partial functionsmultivalued semantics

Mathematics Subject Classification ID

Logic in computer science (03B70) Mechanization of proofs and logical operations (03B35) Cut-elimination and normal-form theorems (03F05)

Related Items (max. 100)

Subsumption Algorithms for Three-Valued Geometric Resolution

Uses Software

• Geo 2007F

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A set theory with support for partial functions
• Efficient Well-Definedness Checking
• Geometric Resolution: A Proof Procedure Based on Finite Model Search
• Lower Bounds on Herbrand's Theorem
• Many-Valued Logic, Partiality, and Abstraction in Formal Specification Languages
• Classical Logic with Partial Functions

This page was built for publication: Classical logic with partial functions