Question

Halmos on domain and range of relations

score 56 · Answer 1 · 2018-08-05 04:20:36

56

Views

Halmos on domain and range of relations

Published on 05 Aug 2018 - 4:20

score 41 · Answer 2 · 2018-08-10 05:10:13

41

Views

Is ($ m \le n $ iff $\frac{n}{m}$ is an even integer) reflexive?

Published on 10 Aug 2018 - 5:10

score 51 · Answer 3 · 2018-08-14 08:02:55

51

Views

Counterexample for relaxing condition on ordered set.

Published on 14 Aug 2018 - 8:02

score 76 · Answer 4 · 2018-08-14 17:40:10

76

Views

Binary relations and notation

Published on 14 Aug 2018 - 17:40

score 72 · Answer 5 · 2018-08-15 20:33:12

72

Views

How is this case a reflexive relation?

Published on 15 Aug 2018 - 20:33

score 36 · Answer 6 · 2018-08-17 15:40:48

36

Views

Does the interpretation of " $\forall$ " differ in these contexts?

Published on 17 Aug 2018 - 15:40

score 43 · Answer 7 · 2018-08-17 20:20:17

43

Views

Question at the end of the chapter on Functions in Halmos's naive set theory

Published on 17 Aug 2018 - 20:20

score 2.9k · Answer 8 · 2026-03-23 11:16:27

2.9k

Views

Define a relation $∼$ on $ R$ by $x ∼ y$ if and only if $x + y \in \mathbb Q$. Is this an equivalance relation?

Published on 23 Mar 2026 - 11:16

score 383 · Answer 9 · 2018-08-19 19:25:05

Define a relation $∼$ on $Z$ by $a ∼ b$ if and only if $a − b$ is even. Show that it is reflexive, symmetric and transitive.

score 129 · Answer 10 · 2018-08-20 09:04:22

129

Views

Does this principle have a name? $A\subset B\subset A \implies A=B$

Published on 20 Aug 2018 - 9:04

score 67 · Answer 11 · 2026-03-25 14:19:26

67

Views

Is it possible to construct order types using sets?

Published on 25 Mar 2026 - 14:19

score 56 · Answer 12 · 2018-08-24 06:46:42

56

Views

Relation and Function problems

Published on 24 Aug 2018 - 6:46

score 88 · Answer 13 · 2018-08-24 07:11:28

88

Views

Can this notation be used to describe relations that are not functions?

Published on 24 Aug 2018 - 7:11

score 311 · Answer 14 · 2018-08-24 23:44:51

311

Views

Proving $\leq$ is a total order on $\Bbb{N}$

Published on 24 Aug 2018 - 23:44

score 85 · Answer 15 · 2018-08-25 14:17:53

85

Views

Prove, that relation $R(G,\preccurlyeq_G) \; (G_1 \preccurlyeq_G G_2: G_1 \text{ is subgraph of } G_2)$ is a Poset

Published on 25 Aug 2018 - 14:17

List Question

Halmos on domain and range of relations

Is ($ m \le n $ iff $\frac{n}{m}$ is an even integer) reflexive?

Counterexample for relaxing condition on ordered set.

Binary relations and notation

How is this case a reflexive relation?

Does the interpretation of " $\forall$ " differ in these contexts?

Question at the end of the chapter on Functions in Halmos's naive set theory

Define a relation $∼$ on $ R$ by $x ∼ y$ if and only if $x + y \in \mathbb Q$. Is this an equivalance relation?

Define a relation $∼$ on $Z$ by $a ∼ b$ if and only if $a − b$ is even. Show that it is reflexive, symmetric and transitive.

Does this principle have a name? $A\subset B\subset A \implies A=B$

Is it possible to construct order types using sets?

Relation and Function problems

Can this notation be used to describe relations that are not functions?

Proving $\leq$ is a total order on $\Bbb{N}$

Prove, that relation $R(G,\preccurlyeq_G) \; (G_1 \preccurlyeq_G G_2: G_1 \text{ is subgraph of } G_2)$ is a Poset

Trending Questions

Popular # Hahtags

Popular Questions