 # tcswiki

wiki-style
git clone https://a3nm.net/git/tcswiki/
Log | Files | Refs

commit 9da7c83bc2bae0d1b98d544f5c96b6054a424cfc
parent 9c02f5f266353da867ba2823fb791e26b907b86c
Author: a3nm <>
Date:   Sun, 17 Jun 2018 01:39:47 +0200

Diffstat:
Logic.page | 4++--

1 file changed, 2 insertions(+), 2 deletions(-)
diff --git a/Logic.page b/Logic.page
@@ -37,9 +37,9 @@ Satisfaction can also be defined using [Logical games]().

## Examples

-One example of a first-order logic formula is the Boolean formula $\phi: \forall x ~ R(x) \rightarrow \exists y ~ S(x, y)$, stating that for every $x$ in the unary relation $R$ there exists an $y$ to which it is connected by the binary relation $S$. This formula $\phi$ is also a [tuple-generating dependency](Constraints#tuple-generating-dependencies).
+One example of a first-order logic formula is the Boolean formula $\phi: \forall x ~ R(x) \rightarrow \exists y ~ S(x, y)$, stating that for every $x$ in the unary relation $R$ there exists an $y$ to which it is connected by the binary relation $S$. This formula $\phi$ is also a [tuple-generating dependency](Constraint languages#tuple-generating-dependencies).

-Another example is the formula $\psi: \forall x \, y \, y' ~ R(x, y) \land R(x, y') \rightarrow y = y'$. This formula $\psi$ is also a [functional dependency](Constraints#functional-dependencies).
+Another example is the formula $\psi: \forall x \, y \, y' ~ R(x, y) \land R(x, y') \rightarrow y = y'$. This formula $\psi$ is also a [functional dependency](Constraint languages#functional-dependencies).

## Inexpressivity results and useful properties