On Theorem Proving in Annotated Logics
From MaRDI portal
Publication:4443407
Recommendations
Cites work
- scientific article; zbMATH DE number 4181307 (Why is no real title available?)
- scientific article; zbMATH DE number 559756 (Why is no real title available?)
- scientific article; zbMATH DE number 3415409 (Why is no real title available?)
- A new method for the Boolean ring based theorem proving
- A semantical framework for supporting subjective and conditional probabilities in deductive databases
- Completely non-clausal theorem proving
- On the theory of inconsistent formal systems
- Paraconsistent disjunctive deductive databases
- Paraconsistent logic programming
- Parallel polynomial operations on SMPs: An overview
- Refutational theorem proving using term-rewriting systems
- The Paraconsistent Logics PJ
Cited in
(8)- Annotated reasoning
- scientific article; zbMATH DE number 2089453 (Why is no real title available?)
- An annotated logic theorem prover for an extended possibilistic logic
- scientific article; zbMATH DE number 2019866 (Why is no real title available?)
- The Paraconsistent Logics PJ
- On the relation between vector annotated logic programs and defeasible theories
- Annotations in formal specifications and proofs
- scientific article; zbMATH DE number 727674 (Why is no real title available?)
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)