User Jesus is Lord

4 votes

3 answers

202 views

Formalizing without loss of generality

asked Nov 18, 2022 at 15:45

2 votes

0 answers

225 views

Does every graph have a "double Eulerian walk"?

asked Jun 1, 2020 at 19:17

2 votes

1 answer

2k views

Does removing the "heaviest" edge of all cycles in an (unweighted) graph result in a minimum spanning tree?

asked Jun 4, 2020 at 19:49

2 votes

1 answer

535 views

Why is the Math-tea argument wrong?

asked Dec 18, 2020 at 16:14

2 votes

1 answer

269 views

Is there a "jagged" real-valued function that is "smooth" in cardinalities greater than the reals?

asked Apr 15, 2016 at 23:10

2 votes

1 answer

561 views

Can a 3-SAT Boolean Satisfiability clause be "directly" reduced to a 2-SAT problem?

asked Apr 27, 2020 at 4:29

2 votes

2 answers

112 views

Could Turing machines + random "do something" Turing machines cannot?

asked May 2, 2020 at 17:51

1 vote

1 answer

387 views

Is FOL equivalent to Turing Machines?

asked Apr 21, 2020 at 18:10

1 vote

1 answer

204 views

Given FOL=Turing machines, why is SOL different than FOL?

asked Apr 21, 2020 at 20:52

1 vote

1 answer

86 views

Is Hamiltonian path NL?

asked May 1, 2020 at 12:21

1 vote

3 answers

78 views

Are strings of length $n^2$ sparse?

asked May 1, 2020 at 21:15

1 vote

0 answers

36 views

Is there an undecidable question that doesn't ask something about Turing machines (or something Turing-complete)?

asked May 2, 2020 at 11:03

1 vote

1 answer

119 views

If I was trying to be as pedantic as possible, can I deduce this in one step?

asked Dec 30, 2017 at 20:57

1 vote

1 answer

154 views

2 heads 5 flips weighted coin - what is the probability?

asked Jan 20, 2020 at 21:01

1 vote

2 answers

203 views

Are there real numbers that have no finite description?

asked Dec 19, 2020 at 18:50

1 vote

2 answers

221 views

Is there a universal math proof verification program than can verify every finite purported math proof?

asked Dec 17, 2020 at 23:41

1 vote

0 answers

192 views

Does the exponential time hypothesis imply solving a boolean SAT problem of n variables is as hard as solving all boolean SAT problems of n variables?

asked May 6, 2020 at 5:00

0 votes

1 answer

60 views

What's this compression technique called?

asked May 8, 2020 at 1:19

0 votes

1 answer

27 views

Forming a set of positive integers with each subset summing uniquely

asked May 31, 2020 at 5:03

0 votes

0 answers

33 views

Is a sequence of positive integers that satisfy these 3 constraints necessarily precisely the integers 1 - N in some order?

asked Apr 14, 2021 at 17:15

0 votes

2 answers

41 views

Does this in complete detail prove $\forall x, y \in N, x + (y + 0) = (x + y) + 0$?

asked Nov 17, 2022 at 23:00

0 votes

2 answers

44 views

Does ((L=NP) and (PH=PSPACE)) imply (FO=SO)? Is (L=/=NP) or (PH=/=PSPACE)?

asked Apr 21, 2020 at 16:42

0 votes

1 answer

178 views

Are axioms in math equivalent to production rules in unrestricted grammars?

asked Apr 17, 2020 at 18:43

0 votes

1 answer

159 views

Can all math be done with axioms of length 3 or less?

asked Apr 18, 2020 at 16:37

0 votes

1 answer

272 views

What are the rules for combining/reducing quantifiers?

asked Jan 1, 2018 at 19:57

0 votes

1 answer

169 views

Is there an axiom we can introduce that disallows Gödel sentences from being formed?

asked Feb 10, 2018 at 14:17

0 votes

1 answer

32 views

Are statements allowed to assert something about their containing sets?

asked Feb 17, 2018 at 23:22

0 votes

1 answer

240 views

How is self-reference usually handled in math?

asked Apr 25, 2020 at 21:18

0 votes

1 answer

30 views

Is Hamiltonian path solvable in nondeterministic log space?

asked May 4, 2020 at 23:16

-1 votes

2 answers

82 views

Is every math statement exponential in worst-case to prove?

asked Apr 21, 2020 at 1:27

Stack Exchange Network

30 Questions

Formalizing without loss of generality

Does every graph have a "double Eulerian walk"?

Does removing the "heaviest" edge of all cycles in an (unweighted) graph result in a minimum spanning tree?

Why is the Math-tea argument wrong?

Is there a "jagged" real-valued function that is "smooth" in cardinalities greater than the reals?

Can a 3-SAT Boolean Satisfiability clause be "directly" reduced to a 2-SAT problem?

Could Turing machines + random "do something" Turing machines cannot?

Is FOL equivalent to Turing Machines?

Given FOL=Turing machines, why is SOL different than FOL?

Is Hamiltonian path NL?

Are strings of length $n^2$ sparse?

Is there an undecidable question that doesn't ask something about Turing machines (or something Turing-complete)?

If I was trying to be as pedantic as possible, can I deduce this in one step?

2 heads 5 flips weighted coin - what is the probability?

Are there real numbers that have no finite description?

Is there a universal math proof verification program than can verify every finite purported math proof?

Does the exponential time hypothesis imply solving a boolean SAT problem of n variables is as hard as solving all boolean SAT problems of n variables?

What's this compression technique called?

Forming a set of positive integers with each subset summing uniquely

Is a sequence of positive integers that satisfy these 3 constraints necessarily precisely the integers 1 - N in some order?

Does this in complete detail prove $\forall x, y \in N, x + (y + 0) = (x + y) + 0$?

Does ((L=NP) and (PH=PSPACE)) imply (FO=SO)? Is (L=/=NP) or (PH=/=PSPACE)?

Are axioms in math equivalent to production rules in unrestricted grammars?

Can all math be done with axioms of length 3 or less?

What are the rules for combining/reducing quantifiers?

Is there an axiom we can introduce that disallows Gödel sentences from being formed?

Are statements allowed to assert something about their containing sets?

How is self-reference usually handled in math?

Is Hamiltonian path solvable in nondeterministic log space?

Is every math statement exponential in worst-case to prove?