Question

Is there true randomness?

score 211 · Answer 1 · 2023-04-04 09:16:00

211

Views

Is there true randomness?

Published on 04 Apr 2023 - 9:16

score 296 · Answer 2 · 2023-04-12 23:11:55

296

Views

Finite Ramsey theorem via propositional compactness + infinite Ramsey theorem

Published on 12 Apr 2023 - 23:11

score 153 · Answer 3 · 2023-04-14 17:30:19

153

Views

Finite Ramsey theorem via first-order compactness + infinite Ramsey theorem

Published on 14 Apr 2023 - 17:30

score 75 · Answer 4 · 2023-04-16 14:38:19

75

Views

Finite Ramsey Theorem via many-sorted logic compactness + infinite Ramsey theorem

Published on 16 Apr 2023 - 14:38

score 139 · Answer 5 · 2026-03-26 01:26:39

139

Views

Coloring arithmetic progression

Published on 26 Mar 2026 - 1:26

score 213 · Answer 6 · 2023-05-16 21:56:07

213

Views

Modern exposition of Ramsey's famous paper "On a problem of formal logic"

Published on 16 May 2023 - 21:56

score 112 · Answer 7 · 2023-05-27 13:37:31

112

Views

Basic Ramsey arrow notation property

Published on 27 May 2023 - 13:37

score 225 · Answer 8 · 2023-05-27 21:55:50

225

Views

Ultrafilter proof of the infinite Ramsey Theorem

Published on 27 May 2023 - 21:55

score 95 · Answer 9 · 2023-05-29 07:54:38

95

Views

Every set of size $2^n-1$ has a subset of size $2^{n-1}$ that sums to a multiple of $n$

Published on 29 May 2023 - 7:54

score 68 · Answer 10 · 2026-02-23 09:32:39

68

Views

Does there exist a maximal subset of arithmetic progressions of length $k,$ such that any additional numbers will result in an A.P. of length $k+2?$

Published on 23 Feb 2026 - 9:32

score 42 · Answer 11 · 2023-06-08 16:08:11

42

Views

Upper bounds for $ES(n)$ from the first proof of Erdos and Székeres (1935)

Published on 08 Jun 2023 - 16:08

score 22 · Answer 12 · 2023-06-24 14:53:19

22

Views

Is there a number $n_0$ s.t. every graph with $n \geq n_0$ contains a $\lfloor n/2\rfloor $ clique or independent set.

Published on 24 Jun 2023 - 14:53

score 107 · Answer 13 · 2023-07-10 02:01:45

107

Views

$n$-in-arithmetic-progression: a maker-breaker game

Published on 10 Jul 2023 - 2:01

score 129 · Answer 14 · 2026-02-23 05:45:38

129

Views

For every large set $A\subset \mathbb{N},$ there is a concave subsequence of $A$ of length $k$ for every $k\in\mathbb{N}$.

Published on 23 Feb 2026 - 5:45

score 173 · Answer 15 · 2026-02-23 05:42:36

173

Views

Do large sets have this specific type of self-similarity?

Published on 23 Feb 2026 - 5:42

List Question

Is there true randomness?

Finite Ramsey theorem via propositional compactness + infinite Ramsey theorem

Finite Ramsey theorem via first-order compactness + infinite Ramsey theorem

Finite Ramsey Theorem via many-sorted logic compactness + infinite Ramsey theorem

Coloring arithmetic progression

Modern exposition of Ramsey's famous paper "On a problem of formal logic"

Basic Ramsey arrow notation property

Ultrafilter proof of the infinite Ramsey Theorem

Every set of size $2^n-1$ has a subset of size $2^{n-1}$ that sums to a multiple of $n$

Does there exist a maximal subset of arithmetic progressions of length $k,$ such that any additional numbers will result in an A.P. of length $k+2?$

Upper bounds for $ES(n)$ from the first proof of Erdos and Székeres (1935)

Is there a number $n_0$ s.t. every graph with $n \geq n_0$ contains a $\lfloor n/2\rfloor $ clique or independent set.

$n$-in-arithmetic-progression: a maker-breaker game

For every large set $A\subset \mathbb{N},$ there is a concave subsequence of $A$ of length $k$ for every $k\in\mathbb{N}$.

Do large sets have this specific type of self-similarity?

Trending Questions

Popular # Hahtags

Popular Questions