Python package that provides an interface to work with classical propositional and first-order logic, based on my solutions to the textbook Mathematical Logic Through Python by Nisan and Gonczarowski

In this bachelor thesis, I developed a toolkit for automated reasoning and interpolation with ordered resolution.

Provides implementations of some satisfiability algorithms for Propositional formulas.

A utility for proofs in the propositional calculus. Currently finished - a way of parsing (most) valid strings in the PC as Sentences which can be added to proofs. Working on a mechanism for machine proof.

semantic tableau is method of finding whether the given logic (propositional logic here) is consistent or inconsistent, whether it is valid (tautology) or not.

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.

Propositional Logic Proof Validation and Tree Traversal.