A uniform proof-theoretic foundation for abstract paraconsistent logic programming

MaRDI QIDQ3558858zbMATH OpenFDO

Authors Norihiro Kamide

Publication date 10 May 2010

Full work available at URL http://danae.uni-muenster.de/lehre/kuchen/JFLP/articles/2007/A2007-01/JFLP-A2007-01.pdf

Mathematics Subject Classification ID

Paraconsistent logics (03B53) Logic programming (68N17)

Recommendations

• Proof theory of Nelson's paraconsistent logic: a uniform perspective
• scientific article; zbMATH DE number 4128792
• scientific article; zbMATH DE number 6407640
• scientific article; zbMATH DE number 4213424
• Uniform proofs as a foundation for logic programming

Cited in

(7)

• Uniform closures: Order-theoretically reconstructing logic program semantics and abstract domain refinements
• Paraconsistent computation tree logic
• Unifying logics via context-sensitiveness
• scientific article; zbMATH DE number 4128792 (Why is no real title available?)
• Refutation-aware Gentzen-style calculi for propositional until-free linear-time temporal logic
• Twist sequent calculi for S4 and its neighbors
• Proof theory of Nelson's paraconsistent logic: a uniform perspective

This page was built for publication: A uniform proof-theoretic foundation for abstract paraconsistent logic programming

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