GF issueshttps://gl.kwarc.info/smglom/GF/-/issues2018-03-24T06:42:58Zhttps://gl.kwarc.info/smglom/GF/-/issues/4fully recursive NL/Formula grammar2018-03-24T06:42:58ZMichael Kohlhasemichael.kohlhase@fau.defully recursive NL/Formula grammarWe need to be able to handle cases like
```
Let $S = \{ n \in Z | \text{$n$ is even} \}$
```
where NL contains a formula that contains NL, which contains a formula again.
I guess we need have parallel categories in the NL and F subgr...We need to be able to handle cases like
```
Let $S = \{ n \in Z | \text{$n$ is even} \}$
```
where NL contains a formula that contains NL, which contains a formula again.
I guess we need have parallel categories in the NL and F subgrammars, and wherever category NX is allowed also a category FX is allowed.Frederik SchaeferFrederik Schaeferhttps://gl.kwarc.info/smglom/GF/-/issues/3Make a German concrete Grammar2018-03-24T06:43:33ZMichael Kohlhasemichael.kohlhase@fau.deMake a German concrete GrammarMost of the [SMGloM](https://mathhub.info/smglom) which is our intended first target is German and English. So we should have a German concrete Grammar. We should probably change to a functor style grammar for that.Most of the [SMGloM](https://mathhub.info/smglom) which is our intended first target is German and English. So we should have a German concrete Grammar. We should probably change to a functor style grammar for that.Frederik SchaeferFrederik Schaefer