Re: Fwd: Re: [RFC] Acknowledgment theorem type

2023-02-03 Thread José Matos
On Fri, 2023-02-03 at 17:20 +0100, Pavel Sanda wrote: > Agreed, the disambiguation is apparently not needed. Pavel I agree as well. Although the texts I read are more applied I did not remember to have find any such theorem style before... so it seems that in this regard we are all sane. :-) --

Re: Fwd: Re: [RFC] Acknowledgment theorem type

2023-02-03 Thread Pavel Sanda
On Fri, Feb 03, 2023 at 04:10:21PM +0100, Jürgen Spitzmüller wrote: > Considering the clarification below, I think I will revert the > disambiguation and only keep the adaptation to US spelling. Agreed, the disambiguation is apparently not needed. Pavel -- lyx-devel mailing list lyx-devel@lists.l

Re: [LyX/master] Acknowledgement > Acknowledgment

2023-02-03 Thread Jürgen Spitzmüller
Am Donnerstag, dem 02.02.2023 um 16:32 -0500 schrieb Scott Kostyshak: > By "all", I was referring to the tests that had failed before. Not to > all tests. How could I have hoped for this? > I just reran the whole test suite and there are other failures: Shoot. This means we'll need a file format

Fwd: Re: [RFC] Acknowledgment theorem type

2023-02-03 Thread Jürgen Spitzmüller
Considering the clarification below, I think I will revert the disambiguation and only keep the adaptation to US spelling. This will also make it easier to implement the file format change which we need to cure the latest problems Scott revealed. Objections? Jürgen --- Weitergeleitete Nachri

Re: Modules excluded

2023-02-03 Thread Daniel
On 2023-02-03 01:18, Richard Kimberly Heck wrote: On 2/2/23 17:31, Jean-Marc Lasgouttes wrote: Le 02/02/2023 à 23:12, Daniel a écrit : The problem is when the depencies/exclusion graph contains furstrated loops. Something like - one has B, which provides feature "foo" - want to insert A, whic