Your English writing platform
Discover LudwigSuggestions(5)
Exact(9)
A nonempty subset A of X is said to be well ordered if every two elements of A are comparable.
A subset K of X is said to be well ordered if every two elements of K are comparable.
Remark 1 A subset W of a partially ordered set X is said to be well ordered if every two elements of W are comparable [43].
A subset W of a partially ordered set X is said to be well ordered if every two elements of W be comparable [8].
A subset (mathcal K ) of (mathcal X ) is said to be well ordered if every two elements of (mathcal K ) are comparable.
A nonempty subset W of a partially ordered set X is said to be well ordered if every two elements of W are comparable.
Similar(51)
We say that is well ordered if nonempty subsets of have least elements.
Moreover, the set of fixed points of T is well ordered if and only if it is a singleton.
(b) C ( f, g ) is well ordered if and only if C ( f, g ) is a singleton.
Then, we say the upper solutions are well ordered if for each, there exist and small enough such that (2.8).
Then, we say the lower solutions are well ordered if for each, there exist and small enough such that (2.9).
More suggestions(15)
Write better and faster with AI suggestions while staying true to your unique style.
Since I tried Ludwig back in 2017, I have been constantly using it in both editing and translation. Ever since, I suggest it to my translators at ProSciEditing.

Justyna Jupowicz-Kozak
CEO of Professional Science Editing for Scientists @ prosciediting.com