PL-Decider

Use the input form for your formula of propositional logic:

Traditional Form	Input Form
¬ p	not[p]
p ⋀ q	and[p,q]
p ⋁ q	or[p,q]
p → q	implies[p,q]
p ≡ q	iff[p,q]

Enter a logical formula:

or[or[or[and[P, not[Q]], and[not[P], Q]], and[P, R]], and[Q, R]]

The result in pole-group-notation is:

Enter "1" for getting the proof in terms of the applyied primitive rules:
Enter a number between "1" and "5" to structure the proof:

The print output is:

Datenschutzerklaerung

© Timm Lampert / 2014-11-08