Certified implementation in Coq of Stålmarck's algorithm for proving tautologies [maintainer=@palmskog]
-
Updated
Apr 23, 2024 - Coq
Certified implementation in Coq of Stålmarck's algorithm for proving tautologies [maintainer=@palmskog]
Haskell Tautology Checker and Parser
🧮 validation methods of propositional logic
Autonomous Theorem Prover for First Order Predicate Logic
Prove propositional logic tautologies via Smullyan's tableaux method
A parser of relational predicate logic & truth tree solver, written in Rust.
resolution refutation is method of finding whether the given antecedent implies the consequent or not, it could also be used to check validity of the expressions.
semantic tableau is method of finding whether the given logic (propositional logic here) is consistent or inconsistent, whether it is valid (tautology) or not.
Add a description, image, and links to the tautology topic page so that developers can more easily learn about it.
To associate your repository with the tautology topic, visit your repo's landing page and select "manage topics."