Implements proof tree search to prove the associativity of the meet operation of lattices.
Uses Coq for theorem proving and Python for reinforcement learning.
$ python3 main.py
-
Notifications
You must be signed in to change notification settings - Fork 0
anshula/meet-associativity-theorem-prover
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
lattice theory theorem proving using coq and python
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published