[isabelle] Code-equations for multisets
Am .02.2014, 20:59 Uhr, schrieb René Thiemann <rene.thiemann at uibk.ac.at>:
Aren't there some undecidable areas? And which results do we have on
normal forms and reducability?
Can you be more precise? The above problems at least have nothing to do
If you consider code comparison of a phrase structure language or subsets
of it you will find intractables and undicidables; at least the current
theory says so.
This archive was generated by a fusion of
Pipermail (Mailman edition) and