Discrete Math and Computer Science:

Using C++, write a program (preferrably in Eclipse that only using header files and libraries that automatically come with it) that accepts a compound propositional logic statement and gives the following as output:

a. A truth table for the expression starting from individual propositional logic statements and showing all intermediate steps.

b. A simplified version of the statement (ONLY if it is possible to simplify the expression using inference rules).

For example, if the following propositional logic statement were entered, the following output would be achieved;

input: [p (q-> r)]-> (q-r) Output: a. Truth table with all intermediate steps T T F T F F T T F TF F F T b. Simplified Expression: T (the given expression is a Tautology) input: [p (q-> r)]-> (q-r) Output: a. Truth table with all intermediate steps T T F T F F T T F TF F F T b. Simplified Expression: T (the given expression is a Tautology)