Your English writing platform
Discover LudwigSuggestions(5)
Exact(37)
Let Z be a binary relation which relates states of A to states of B. Then we call Z a bisimulation between A and B if Duplicator can use Z as a nondeterministic winning strategy in the back-and-forth game between A and B where the first pair of moves of the two players is to choose their starting states.
Let ⪯ be a binary relation on X.
Let '⪯' be a binary relation defined on X.
Let ( X, d ) be a metric space and ℛ be a binary relation over X.
Let (( X,d ) ) be a metric space and let be a binary relation on X.
Let ≼ be a binary relation on X and (T:Xrightarrow X) be a mapping.
Similar(23)
A selection function γ for a belief set K is relational if and only if there is a binary relation R such that for all sentences p, if K⊥p is non-empty, then γ(K⊥p) = {B ∈ K⊥p | CRB for all C ∈ K⊥p}.
P is a binary relation, asymmetric, and irreflexive.
I is a binary relation, symmetric, and reflexive.
Now, in Kripke's semantics for modal logic, the accessibility relation is a binary relation.
Here an 'I-predicable' is a binary relation symbol '=' satisfying (W).
More suggestions(15)
be a certain relation
be a binary value
be a binary choice
be a binary treatment
be a triadic relation
be a positive relation
be a binary Hamming
be a binary block-wise
be a causal relation
be a sexual relation
be a strong relation
be a possible relation
be a biological relation
be a real relation
be a binary star
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