hi
|
e8a5e2caa7
|
verify graph paths incl laws graph
|
2025-08-15 11:35:50 +00:00 |
|
hi
|
fa1a39d1da
|
verify graph path search
|
2025-08-15 10:10:20 +00:00 |
|
hi
|
687b5f1040
|
big tidy
|
2025-08-15 10:06:31 +00:00 |
|
hi
|
bd9b58c405
|
tidy: Logic.Parse
|
2025-08-12 13:36:06 +00:00 |
|
hi
|
88c140fed5
|
tidy: del unused Eq, add custom Show
|
2025-08-12 13:29:08 +00:00 |
|
hi
|
56a8dd2b30
|
bfs: use a Set for visited nodes
|
2025-08-12 13:28:23 +00:00 |
|
hi
|
7f0afa76a6
|
readme: relative markdown links in Logic/
|
2025-08-12 08:15:34 +00:00 |
|
hi
|
225d0ecbb6
|
readme: separate readmes
|
2025-08-12 08:13:03 +00:00 |
|
hi
|
113aab0fcb
|
really rename it MIU system
|
2025-08-12 07:54:03 +00:00 |
|
hi
|
e46bcf6ddc
|
nice readme, rename M to MIU system
|
2025-08-12 05:27:38 +00:00 |
|
hi
|
b28263fdc3
|
logical laws: breadth first search
|
2025-08-12 04:00:22 +00:00 |
|
hi
|
be7460ddf1
|
breadth first search
edges are dynamically generated
|
2025-08-12 04:00:22 +00:00 |
|
hi
|
0e7bca0baa
|
apply logical laws
|
2025-08-12 04:00:22 +00:00 |
|
hi
|
d0ba6ce9d4
|
minor: substatements function, comments
|
2025-08-12 03:57:13 +00:00 |
|
hi
|
0d13b807f0
|
another L derivation example
|
2025-08-12 03:56:04 +00:00 |
|
hi
|
aeb441e06d
|
language derivations: add hypotheses, L example
|
2025-08-10 16:09:10 +00:00 |
|
hi
|
8a85dcfc8f
|
formal language derivations
|
2025-08-10 15:56:13 +00:00 |
|
hi
|
e2aae59499
|
fix: language M rule 4 not removing late UUs
|
2025-08-10 15:29:57 +00:00 |
|
hi
|
9233edfb4b
|
formal language L
|
2025-08-10 13:42:07 +00:00 |
|
hi
|
ab8ed1c73c
|
generalize parser symbols; parser monad
|
2025-08-10 13:31:20 +00:00 |
|
hi
|
4d7fd8be7c
|
formal languages
|
2025-08-10 09:17:00 +00:00 |
|
hi
|
7eeb59c0e3
|
logical laws
|
2025-08-08 08:14:37 +00:00 |
|
hi
|
d781334419
|
split Logic.Statement into files, simpler serialization
|
2025-08-08 04:36:22 +00:00 |
|
hi
|
0fa510e31a
|
separate into files, parser error messages
|
2025-08-08 04:29:01 +00:00 |
|