Weak logic theory
From MaRDI portal
Publication:2276950
Weak logic is an extension of first-order logic to handle partial functions and predicates. In this paper a sequent calculus for weak logic is introduced and its consistency and completeness are proved. Furthermore, a cut elimination theorem and some interpolation theorems are stated and a resolution principle for this logic is elaborated.
Recommendations
Cites work
- A logic covering undefinedness in program proofs
- Cut elimination and automatic proof procedures
- Fundamentals of artificial intelligence. An advanced course
- scientific article; zbMATH DE number 3645093 (Why is no real title available?)
- scientific article; zbMATH DE number 3726339 (Why is no real title available?)
- scientific article; zbMATH DE number 3351180 (Why is no real title available?)
- scientific article; zbMATH DE number 3415409 (Why is no real title available?)
- Weak logic theory
Cited in
(12)- Partial logics reconsidered: A conservative approach
- Weak logic theory
- A simple sequent calculus for partial functions
- Weak conjunctions of identities
- scientific article; zbMATH DE number 3859085 (Why is no real title available?)
- Extensionality in CL_w
- scientific article; zbMATH DE number 3898884 (Why is no real title available?)
- scientific article; zbMATH DE number 1292304 (Why is no real title available?)
- scientific article; zbMATH DE number 1989647 (Why is no real title available?)
- scientific article; zbMATH DE number 6851056 (Why is no real title available?)
- scientific article; zbMATH DE number 2196617 (Why is no real title available?)
- On partial and paraconsistent logics
This page was built for publication: Weak logic theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2276950)