Weak logic theory

DOI10.1016/0304-3975(91)90334-XzbMath0724.03020OpenAlexW2006286500MaRDI QIDQ2276950

Marit Holden

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90334-x

zbMATH Keywords

interpolationcut eliminationsequent calculuspartial functionsresolution principleprogram verificationprogram correctnesssystem specificationextension of first-order logicpartial predicateweak logic

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Cut-elimination and normal-form theorems (03F05)

Related Items

A simple sequent calculus for partial functions, On partial and paraconsistent logics, Weak logic theory, Partial logics reconsidered: A conservative approach

Cites Work

• A logic covering undefinedness in program proofs
• Cut elimination and automatic proof procedures
• Fundamentals of artificial intelligence. An advanced course
• Weak logic theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item