From d3005dd52ee0ee0522f5668e4123bb93c5d210b9 Mon Sep 17 00:00:00 2001
From: Michael Leuschel <leuschel@uni-duesseldorf.de>
Date: Mon, 17 Oct 2022 11:18:57 +0200
Subject: [PATCH] fix typo and add comments
---
mathematical/TransitiveClosure.ipynb | 5 ++++-
1 file changed, 4 insertions(+), 1 deletion(-)
diff --git a/mathematical/TransitiveClosure.ipynb b/mathematical/TransitiveClosure.ipynb
index 9ef3b03..e97f94c 100644
--- a/mathematical/TransitiveClosure.ipynb
+++ b/mathematical/TransitiveClosure.ipynb
@@ -512,7 +512,9 @@
"\n",
"Transitive closure can actually not be axiomatised in first-order logic.\n",
"As B is based on first-order logic, can we do this without resorting to the built-in operator ```closure1```?\n",
- "The answer is yes, becase B has higher-order values and we can arbitrarily quantify over sets and relation values."
+ "The answer is yes, because B has higher-order values and we can arbitrarily quantify over sets and relation values.\n",
+ "We have to specify that all other relations contained in cls1 are not a solution.\n",
+ "With this we get a single solution, encoding our expected transitive closure of the next relation:"
]
},
{
@@ -655,6 +657,7 @@
"id": "6142e45d",
"metadata": {},
"source": [
+ "## Digression: Encoding transitive closure in Prolog\n",
"In Prolog we can encode transitive closure as this:\n",
"```\n",
"cls1(A,B) :- next(A,B).\n",
--
GitLab