On Theorem Proving in Annotated Logics

DOI10.1080/11663081.2000.10510993zbMATH Open1033.03006OpenAlexW2169890476MaRDI QIDQ4443407FDOQ4443407

Mi Lu, Jinzhao Wu

Publication date: 11 January 2004

Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/11663081.2000.10510993

zbMATH Keywords

paraconsistent logicautomated theorem provingannotated logicannotated polymomials

Mathematics Subject Classification ID

Paraconsistent logics (03B53) Mechanization of proofs and logical operations (03B35)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Paraconsistent logic programming
• On the theory of inconsistent formal systems
• Refutational theorem proving using term-rewriting systems
• A semantical framework for supporting subjective and conditional probabilities in deductive databases
• Completely non-clausal theorem proving
• The Paraconsistent Logics PJ
• Paraconsistent disjunctive deductive databases
• A new method for the Boolean ring based theorem proving
• Parallel polynomial operations on SMPs: An overview

Cited In (4)

• Title not available (Why is that?)
• The Paraconsistent Logics PJ
• On the relation between vector annotated logic programs and defeasible theories
• Title not available (Why is that?)

This page was built for publication: On Theorem Proving in Annotated Logics

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