The following pages link to Custom automations in Mizar (Q1945910):
Displaying 4 items.
- Automating Boolean set operations in Mizar proof checking with the aid of an external SAT solver (Q286803) (← links)
- Fermat's little theorem via divisibility of Newton's binomial (Q500025) (← links)
- Multiplication-related classes of complex numbers (Q2113836) (← links)
- SAT-Enhanced Mizar Proof Checking (Q5495946) (← links)
