Re: [isabelle] Code-equations for multisets

>>> 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 with undecidability!
>>  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.

Maybe, but I do not see the connection between the "code comparison of a phrase structure language" and my topic, the implementation of finite multisets.


This archive was generated by a fusion of Pipermail (Mailman edition) and MHonArc.