Left-sorted Bongard Problems have the keyword "dependence" on the OEBP.

Bongard Problems labelled "dependence" are usually (but not always) about transformations that can be undone by other transformations of the same class. (The technical term for this kind of transformation is an "isomorphism".)

Other fitting names for this keyword besides "dependence" would be "invariance" or "symmetry".

Bongard Problems labelled "dependence" may leave out (i.e., treat as ambiguous) the case where [transformation] can render an example unsortable but will never switch an example's sorting.

(As a consequence of this convention, a Bongard Problem sorted by the "dependence" Bongard Problem would be sorted the same way if we were only to consider transformations that leave examples sortable.)

Left-sorted Bongard Problems have the keyword "dependence" on the OEBP.

Bongard Problems labelled "dependence" are usually (but not always) about transformations that can be undone by other transformations of the same class. (The technical term for this kind of transformation is an "isomorphism".)

Other fitting names for this keyword besides "dependence" would be "invariance" or "symmetry".

Bongard Problems labelled "dependence" may leave out (i.e., treat as ambiguous) the case where [transformation] can render an example unsortable but will never switch an example's sorting.

(As a consequence of this convention, a Bongard Problem sorted by a "dependence" Bongard Problem would be sorted the same way if we were only to consider transformations that leave examples sortable.)

Left-sorted Bongard Problems have the keyword "dependence" on the OEBP.

Bongard Problems labelled "dependence" are usually (but not always) about transformations that can be undone by other transformations of the same class. (The technical term for this kind of transformation is an "isomorphism".)

Other fitting names for this keyword besides "dependence" would be "invariance" or "symmetry".

Bongard Problems labelled "dependence" may leave out (i.e., treat as ambiguous) the case where [transformation] can render an example unsortable but will never switch an example's sorting.

(As a consequence of this convention, any Bongard Problem sorted by a "dependence" Bongard Problem would be sorted the same way if we were only to consider transformations that leave examples sortable.)

Left-sorted Bongard Problems have the keyword "dependence" on the OEBP.

Bongard Problems labelled "dependence" are usually (but not always) about transformations that can be undone by other transformations of the same class. (The technical term for this kind of transformation is an "isomorphism".)

Other fitting names for this keyword besides "dependence" would be "invariance" or "symmetry".

Bongard Problems labelled "dependence" may leave out (i.e., treat as ambiguous) the case where [transformation] can render an example unsortable but will never switch an example's sorting.

Left-sorted Bongard Problems have the keyword "dependence" on the OEBP.

Bongard Problems labelled "dependence" are usually (but not always) about transformations that can be undone by other transformations of the same class. (The technical term for this kind of transformation is an "isomorphism".)

Other fitting names for this keyword besides "dependence" would be "invariance" or "symmetry".

Bongard Problems labelled "dependence" may leave out (i.e., treat as ambiguous) the case where [transformation] can render an example unsortable but will never switch an example's sorting.

(This convention has no effect on the independent-side of the "dependence" Bongard Problem.)

Left-sorted Bongard Problems have the keyword "dependence" on the OEBP.

Bongard Problems labelled "dependence" are usually (but not always) about transformations that can be undone by other transformations of the same class. (The technical term for this kind of transformation is an "isomorphism".)

Other fitting names for this keyword besides "dependence" would be "invariance" or "symmetry".

Bongard Problems labelled "dependence" may leave out (i.e., treat as ambiguous) the case where [transformation] can render an example unsortable but will never switch an example's sorting.

(This has no effect on the independent-side of the "dependence" Bongard Problem.)

Left-sorted Bongard Problems have the keyword "dependence" on the OEBP.

"Dependence" Bongard Problems are usually (but not always) about transformations that can be undone by other transformations of the same class. (The technical term for this kind of transformation is an "isomorphism".)

Other fitting names for this keyword besides "dependence" would be "invariance" or "symmetry".

Bongard Problems labelled "dependence" tend to leave out (i.e., treat as ambiguous) the case where [transformation] can render an example unsortable, but will never switch an example's sorting.

"Dependence" Bongard Problems are @notso Bongard Problems.

"Dependence" Bongard Problems are often keywords (keyword @keyword) on the OEBP.

See keyword @sortdependence, which is about transformations making some examples unsortable.

See keyword @problemkiller, which is about transformations making all sorted examples unsortable.

"Dependence" Bongard Problems are @notso Bongard Problems.

"Dependence" Bongard Problems are often keywords (keyword @keyword) on the OEBP.

See keyword @sortdependence, which is about transformations making some examples unsortable;

See keyword @problemkiller, which is about transformations making all sorted examples unsortable.

"Dependence" Bongard Problems are @notso Bongard Problems.

"Dependence" Bongard Problems are often keywords (keyword @keyword) on the OEBP.

Related keywords:

@sortdependence, which is about transformations making some examples unsortable;

@problemkiller, which is about transformations making all sorted examples unsortable.

Left-sorted Bongard Problems have the keyword "dependence" on the OEBP.

"Dependence" Bongard Problems are usually (but not always) about transformations that can be undone by other transformations of the same class. (The technical term for this kind of transformation is an "isomorphism".)

Other fitting names besides "dependence" would be "invariance" or "symmetry".

Bongard Problems labelled "dependence" tend to leave out (i.e., treat as ambiguous) the case where [transformation] can render an example unsortable, but will never switch an example's sorting.

Left-sorted Bongard Problems have the keyword "dependence" on the OEBP.

"Dependence" Bongard Problems are usually (but not always) about transformations that can be undone by other transformations of the same class. (The technical term for this kind of transformation is an "isomorphism".)

Other fitting names besides "dependence" would be "invariance" or "symmetry".

Bongard Problems labelled "dependence" tend to leave out (i.e., treat as ambiguous) the case where [transformation] can render an example unsortable, but will never switch an example's sorting. This is the purpose of the (less commonly used) keyword @dependenceincontext -- alternative versions of "dependence" Bongard Problems that explicitly handle this situation.

Left-sorted Bongard Problems have the keyword "dependence" on the OEBP.

"Dependence" Bongard Problems are usually (but not always) about transformations that can be undone by other transformations of the same class. (The technical term for this kind of transformation is an "isomorphism".)

Other good names besides "dependence" would be "invariance" or "symmetry".

Bongard Problems labelled "dependence" tend to leave out (i.e., treat as ambiguous) the case where [transformation] can render an example unsortable, but will never switch an example's sorting. This is the purpose of the (less commonly used) keyword @dependenceincontext -- alternative versions of "dependence" Bongard Problems that explicitly handle this situation.

Left-sorted Bongard Problems have the keyword "dependence" on the OEBP.

"Dependence" Bongard Problems are usually about transformations that can be undone by other transformations of the same class. (The technical term for this kind of transformation is an "isomorphism".)

Other good names besides "dependence" would be "invariance" or "symmetry".

Bongard Problems labelled "dependence" tend to leave out (i.e., treat as ambiguous) the case where [transformation] can render an example unsortable, but will never switch an example's sorting. This is the purpose of the (less commonly used) keyword @dependenceincontext -- alternative versions of "dependence" Bongard Problems that explicitly handle this situation.

Left-sorted Bongard Problems have the keyword "dependence" on the OEBP.

Other good names for this would be "invariance" or "symmetry".

The transformation is usually something that can be undone by another transformation of the same class.

Bongard Problems labelled "dependence" tend to leave out (i.e., treat as ambiguous) the case where [transformation] can render an example unsortable, but will never switch an example's sorting. This is the purpose of the (less commonly used) keyword @dependenceincontext -- alternative versions of "dependence" Bongard Problems that explicitly handle this situation.

Left-sorted Bongard Problems have the keyword "dependence" on the OEBP.

Other good names for this would be "invariance" or "symmetry".

Bongard Problems labelled "dependence" tend to leave out (i.e., treat as ambiguous) the case where [transformation] can render an example unsortable, but will never switch an example's sorting. This is the purpose of the (less commonly used) keyword @dependenceincontext -- alternative versions of "dependence" Bongard Problems that explicitly handle this situation.

Left-sorted Bongard Problems have the keyword "dependence" on the OEBP.

Other good names for this would be "invariance" or "symmetry".

Bongard Problems labelled "dependence" tend to leave out (i.e., treat as ambiguous) the case where [transformation] can render an example unsortable, but will never switch an example's sorting. This is the purpose of the (less commonly used) keyword @dependenceincontext -- versions of "dependence" Bongard Problems that explicitly handle this situation.

Left-sorted Bongard Problems have the keyword "dependence" on the OEBP.

Other good names for this would be "invariance" or "symmetry".

Bongard Problems labelled "dependence" tend to leave out (i.e., treat as ambiguous) the case where [transformation] can render an example unsortable, but will never switch an example's sorting. See @dependenceincontext for slightly different versions of "dependence" Bongard Problems that handle this differently.

Left-sorted Bongard Problems have the keyword "dependence" on the OEBP.

Other good names for this would be "invariance" or "symmetry".

Bongard Problems labelled "dependence" tend to leave out (i.e., treat as ambiguous) the case where [transformation] may render an example unsortable, but will never switch its sorting. See @dependenceincontext for slightly different versions of "dependence" Bongard Problems that handle this differently.

Left-sorted Bongard Problems have the keyword "dependence" on the OEBP.

Other good names for this would be "invariance" or "symmetry".

Bongard Problems labelled "dependence" tend to leave out (i.e., treat as ambiguous) the case where [transformation] may render an example unsortable, but will never switch its sorting.

Left-sorted Bongard Problems have the keyword "dependence" on the OEBP.

Other good names for this would be "invariance" or "symmetry".

The Bongard Problems labelled "dependence" tend to leave out (i.e., treat as ambiguous) the case where [transformation] may render an example unsortable, but will never switch its sorting.

Left-sorted Bongard Problems have the keyword "dependence" on the OEBP.

Other good names for this would be "invariance" or "symmetry".

The Bongard Problems labelled "dependence" tend to treat the case

"Dependence" Bongard Problems are @notso Bongard Problems.

"Dependence" Bongard Problems are often keywords (keyword @keyword) on the OEBP.

Related keywords:

@sortdependence, which is about transformations making some examples unsortable;

@left-sensitivity, which is about transformations making all left examples switch sides;

@right-sensitivity, which is about transformations making all right examples switch sides;

@sortsensitivity, which is about transformations making all sorted examples unsortable.

"Dependence" Bongard Problems are @notso Bongard Problems.

"Dependence" Bongard Problems are often keywords (keyword @keyword) on the OEBP.

Related keywords:@sortdependence, which is about transformations making all examples unsortable rather than transformations making some example switch sides.

See keyword @problemkiller, which is about transformations making all examples unsortable rather than transformations making some example switch sides.

See keyword @problemkiller, which is about transformations making all examples unsortable rather than transformations making some example switch sides.

"Dependence" Bongard Problems are @notso Bongard Problems.

"Dependence" Bongard Problems are often keywords (keyword @keyword) on the OEBP.

See keyword @problemkiller, which is about transformations making all examples unsortable rather than transformations making some example switch sides.

"Dependence" Bongard Problems are @notso Bongard Problems.

"Dependence" Bongard Problems are usually keywords (keyword @keyword) on the OEBP.

See keyword @problemkiller, which is about transformations making all examples unsortable rather than transformations making some example switch sides.