Question

Unprovable sentence, but provably it is provable.

score 207 · Answer 1 · 2026-03-25 18:49:44

207

Views

Unprovable sentence, but provably it is provable.

Published on 25 Mar 2026 - 18:49

score 77 · Answer 2 · 2019-02-18 05:48:17

77

Views

How do Peano's arithmetical axioms guarantee that we can construct the natural number set?

Published on 18 Feb 2019 - 5:48

score 129 · Answer 3 · 2026-03-25 14:10:23

129

Views

Is there a computable and complete "probabilistic" theory of arithmetic?

Published on 25 Mar 2026 - 14:10

score 456 · Answer 4 · 2026-03-25 01:26:16

456

Views

How do we know PA is incomparable with PRA + $\epsilon_0$?

Published on 25 Mar 2026 - 1:26

score 56 · Answer 5 · 2019-03-07 23:40:06

56

Views

Basis of Mathematics

Published on 07 Mar 2019 - 23:40

score 345 · Answer 6 · 2019-03-11 02:22:18

345

Views

How can I prove transitivity of < in Peano Arithmetic

Published on 11 Mar 2019 - 2:22

score 108 · Answer 7 · 2019-03-11 13:59:09

108

Views

Must heredity be explicilty stated in addtion to Peano's axioms when defining natural numbers?

Published on 11 Mar 2019 - 13:59

score 71 · Answer 8 · 2019-03-13 12:14:28

71

Views

Why we care only about $\Pi_1$ parameters in axiom schemes?

Published on 13 Mar 2019 - 12:14

score 91 · Answer 9 · 2019-03-17 09:22:42

91

Views

Peano axiom of induction- why cannot it be replaced by something simpler?

Published on 17 Mar 2019 - 9:22

score 122 · Answer 10 · 2019-03-18 10:49:16

122

Views

Peano axioms and first-order logic with $\exists^{\infty}$

Published on 18 Mar 2019 - 10:49

score 35 · Answer 11 · 2026-03-25 06:05:17

35

Views

Are "lower bound" and "upper bound" unambigous? What if one's in the negative axis?

Published on 25 Mar 2026 - 6:05

score 146 · Answer 12 · 2026-03-12 11:28:01

146

Views

Is the 'copy' of the naturals in ZF a unique way to represent the second-order arithmetic in first-order logic?

Published on 12 Mar 2026 - 11:28

score 128 · Answer 13 · 2019-03-25 00:26:53

128

Views

Nonstandard proof codes for Con(PA)

Published on 25 Mar 2019 - 0:26

score 622 · Answer 14 · 2026-03-25 09:29:52

622

Views

How to prove that first-order PA proves the consistency of each of its finite sub-theories?

Published on 25 Mar 2026 - 9:29

score 136 · Answer 15 · 2019-03-30 05:19:50

136

Views

Peano axioms: prove that there is no natural number between n and sucessor of n

Published on 30 Mar 2019 - 5:19

List Question

Unprovable sentence, but provably it is provable.

How do Peano's arithmetical axioms guarantee that we can construct the natural number set?

Is there a computable and complete "probabilistic" theory of arithmetic?

How do we know PA is incomparable with PRA + $\epsilon_0$?

Basis of Mathematics

How can I prove transitivity of < in Peano Arithmetic

Must heredity be explicilty stated in addtion to Peano's axioms when defining natural numbers?

Why we care only about $\Pi_1$ parameters in axiom schemes?

Peano axiom of induction- why cannot it be replaced by something simpler?

Peano axioms and first-order logic with $\exists^{\infty}$

Are "lower bound" and "upper bound" unambigous? What if one's in the negative axis?

Is the 'copy' of the naturals in ZF a unique way to represent the second-order arithmetic in first-order logic?

Nonstandard proof codes for Con(PA)

How to prove that first-order PA proves the consistency of each of its finite sub-theories?

Peano axioms: prove that there is no natural number between n and sucessor of n

Trending Questions

Popular # Hahtags

Popular Questions