Question

Antisymmetry by equivalence

score 38 · Answer 1 · 2026-04-02 22:41:15

Antisymmetry by equivalence

Published on 02 Apr 2026 - 22:41

score 71 · Answer 2 · 2026-04-02 05:24:32

Why can we use $\le$ and $\mid$ equivalently in the definition of $gcd$? Can we generalize it to set that have $2$ partial orders available?

score 162 · Answer 3 · 2026-04-02 03:36:31

162

Views

Maximal ideal theorem in Heyting Algebras implies choice

Published on 02 Apr 2026 - 3:36

score 28 · Answer 4 · 2023-09-15 04:11:47

28

Views

Equivalence of partial sums in strictly ordered sets

Published on 15 Sep 2023 - 4:11

score 196 · Answer 5 · 2026-04-02 18:38:43

196

Views

Regarding the "smallest" nontrivial, dense order type.

Published on 02 Apr 2026 - 18:38

score 30 · Answer 6 · 2023-09-18 15:35:01

30

Views

Question about convexity of ordered set

Published on 18 Sep 2023 - 15:35

score 344 · Answer 7 · 2026-03-26 22:50:42

344

Views

Difference between partially ordered, totally ordered, and well ordered sets.

Published on 26 Mar 2026 - 22:50

score 58 · Answer 8 · 2026-04-03 15:17:13

58

Views

Counting possible number of relations that have certain properties

Published on 03 Apr 2026 - 15:17

score 79 · Answer 9 · 2026-03-25 06:04:16

79

Views

Generalisation of "discrete" and "indiscrete" left/right adjoint to the forgetful functor for general "ordered" Categories with monotone. morphisms.

Published on 25 Mar 2026 - 6:04

score 47 · Answer 10 · 2026-03-26 22:58:26

47

Views

Limit Countable Ordinal - is it a limit of a intuitive sequence of ordinals?

Published on 26 Mar 2026 - 22:58

score 162 · Answer 11 · 2023-09-21 17:18:05

Which partially ordered sets admits an order preserving map that preserves maximal elements from a proper subset containing all max. elements?

score 70 · Answer 12 · 2026-03-30 11:24:53

70

Views

Why are nets defined with directed sets (which only requires upper bound to finite subset)

Published on 30 Mar 2026 - 11:24

score 58 · Answer 13 · 2023-09-26 16:34:18

58

Views

If $R$ is a partial order on $[n],$ prove that $|R| \le n(n+1) / 2$

Published on 26 Sep 2023 - 16:34

score 72 · Answer 14 · 2026-03-28 02:05:27

72

Views

Terminology for "transposition" of monomorphism to epimorphism in simplex category?

Published on 28 Mar 2026 - 2:05

score 53 · Answer 15 · 2023-09-29 16:18:43

53

Views

Does the definition of a partial order require the definition of an equivalence relation?

Published on 29 Sep 2023 - 16:18

List Question

Antisymmetry by equivalence

Why can we use $\le$ and $\mid$ equivalently in the definition of $gcd$? Can we generalize it to set that have $2$ partial orders available?

Maximal ideal theorem in Heyting Algebras implies choice

Equivalence of partial sums in strictly ordered sets

Regarding the "smallest" nontrivial, dense order type.

Question about convexity of ordered set

Difference between partially ordered, totally ordered, and well ordered sets.

Counting possible number of relations that have certain properties

Generalisation of "discrete" and "indiscrete" left/right adjoint to the forgetful functor for general "ordered" Categories with monotone. morphisms.

Limit Countable Ordinal - is it a limit of a intuitive sequence of ordinals?

Which partially ordered sets admits an order preserving map that preserves maximal elements from a proper subset containing all max. elements?

Why are nets defined with directed sets (which only requires upper bound to finite subset)

If $R$ is a partial order on $[n],$ prove that $|R| \le n(n+1) / 2$

Terminology for "transposition" of monomorphism to epimorphism in simplex category?

Does the definition of a partial order require the definition of an equivalence relation?

Trending Questions

Popular # Hahtags

Popular Questions