From 929c71488a4bc413d693ac609fab6bcc1fc61951 Mon Sep 17 00:00:00 2001 From: Hassan Abedi Date: Wed, 4 Mar 2026 12:37:56 +0100 Subject: [PATCH] WIP --- hassan/001-similar-projects.md | 1 - hassan/002-geolog-glossary.md | 1 - 2 files changed, 2 deletions(-) diff --git a/hassan/001-similar-projects.md b/hassan/001-similar-projects.md index 16aa5a1..09312f5 100644 --- a/hassan/001-similar-projects.md +++ b/hassan/001-similar-projects.md @@ -43,7 +43,6 @@ Compared to the above projects, Geolog combines several features that no single * **Interactive REPL** — explore and mutate instances dynamically, unlike batch-mode model finders * **Constructive proof witnesses** — the Petri net showcase demonstrates solutions as typed diagrammatic objects, not just boolean answers - ## Changelog * **Feb 27, 2026** -- The first version was created. diff --git a/hassan/002-geolog-glossary.md b/hassan/002-geolog-glossary.md index 36b954c..a05f8b5 100644 --- a/hassan/002-geolog-glossary.md +++ b/hassan/002-geolog-glossary.md @@ -39,7 +39,6 @@ proof. If the types check and all axioms are satisfied, reachability is proven. This is the "propositions as types, proofs as programs" idea from type theory, applied to diagrammatic reasoning. - ## Changelog * **Feb 27, 2026** -- The first version was created.