The "Predimate" algorithm, created during the second semester at Ulbra by me, is a specialized tool designed to guide students through propositional logic problems step by step, enhancing their learning experience. It simplifies complex logic challenges into manageable steps, promoting a deeper understanding of the subject and improving logical reasoning skills. Predimate is a valuable educational resource for both students and educators, facilitating the acquisition of essential logical skills.
If you simply want to run Predimate without building it from source, follow the steps listed in installing docs.
For detailed information on how to contribute, please refer to our Contribution Guide. It covers everything you need to know about making contributions to Predimate. Happy contributing! 🚀
| Operator | Name |
|---|---|
| ^ | Conjunction |
| ∧ | Conjunction |
| v | Disjunction |
| ∨ | Disjunction |
| -> | Conditional |
| → | Conditional |
| <-> | Biconditional |
| ↔ | Biconditional |
| ¬ | Negation |
| ~ | Negation |
- (p ∧ q) ∧ (¬p ∨ ¬q)
- (p^q)^(
pvq)
