Evaluates the logic tree rooted at this node against a supplied model. Model is an assignment of truth values to atoms (dict of string -> boo

Starts parsing a logical expression (supplied as a string). Returns a tree of Nodes.

Generates truth table rows from a proposition string.

Returns the type of node this symbol represents.

Returns a list of atoms in a proposition string.

Yields all possible maps of variables to truth values.

Return a set of characters which are atoms in this expression.

Takes in a list of parse tree expressions [A, B, C, ... Z]. Outputs one parse tree ((A&B&C&...) -> Z). Last expression is the conclusion,

Converts a proposition string into a DNF string.

Takes in a list of parse tree expressions [A, B, C, ... Z]. Outputs one parse tree ((A&B&C&...) -> Z). Last expression is the conclusion,

Recursive-descent parsing algorithm for logic expressions. Returns a tree of Nodes.

Ensures the children nodes are valid. Raises LogicError if they're not.

Overridden by children nodes to implement custom child-checking logic. Should raise LogicError if children are invalid.

Carroll is a command line tool for analysing propositional logic (also known as boolean functions or expressions).

Produce a nice-formatted string of a truth assignment, e.g. " A ~B C".

Converts an expression to conjunctive normal form.

Converts an expression to disjunctive normal form.

Checks whether two expressions are logically equivalent.

Generates a truth table from a parse tree.

Outputs the truth table for an expression to stdout.

Checks a proof for validity.

Outputs a truth table for a logical expression.