Question

Proving Natural Predecessor existence using Well Order

score 58 · Answer 1 · 2026-03-26 10:57:57

58

Views

Proving Natural Predecessor existence using Well Order

Published on 26 Mar 2026 - 10:57

score 130 · Answer 2 · 2026-02-23 08:31:49

130

Views

Show that the decidability of a statement is undecidable.

Published on 23 Feb 2026 - 8:31

score 47 · Answer 3 · 2020-05-04 04:12:30

47

Views

Defining specific Exponentiation in PA

Published on 04 May 2020 - 4:12

score 324 · Answer 4 · 2020-05-11 16:37:19

324

Views

Exercise 2.2.1 in Analysis by Terence Tao Induction Proof of Addition Associative Law Natural Numbers

Published on 11 May 2020 - 16:37

score 614 · Answer 5 · 2020-05-13 04:03:52

614

Views

Are mathematical operations axioms?

Published on 13 May 2020 - 4:03

score 108 · Answer 6 · 2020-05-22 10:29:30

108

Views

When can a statement in Second Order Logic be converted into a statement in First Order Logic

Published on 22 May 2020 - 10:29

score 77 · Answer 7 · 2020-05-24 06:14:17

77

Views

Proving addition preserves order in natural numbers

Published on 24 May 2020 - 6:14

score 24 · Answer 8 · 2020-05-25 19:57:02

24

Views

What's the strength of weakening induction in PA by relativizing it to naturals?

Published on 25 May 2020 - 19:57

score 539 · Answer 9 · 2026-03-26 09:39:54

539

Views

While using the method of proof by contradiction, are we "assuming" consistency?

Published on 26 Mar 2026 - 9:39

score 100 · Answer 10 · 2020-06-02 19:48:51

100

Views

Characterization of provably recursive functions in PA

Published on 02 Jun 2020 - 19:48

score 101 · Answer 11 · 2020-06-03 21:24:17

101

Views

Every provably recursive function in PA is bounded by a Hardy function

Published on 03 Jun 2020 - 21:24

score 374 · Answer 12 · 2026-03-26 08:00:48

374

Views

Is the axiom of induction required for proving the first Gödel's incompleteness theorem?

Published on 26 Mar 2026 - 8:00

score 109 · Answer 13 · 2020-06-08 12:57:49

109

Views

How do I prove this? (Set Theory, Mathematical Logic)

Published on 08 Jun 2020 - 12:57

score 59 · Answer 14 · 2020-06-17 09:59:28

59

Views

Prove that $+:\mathbb{N} \times \mathbb{N} \to \mathbb{N}$ is a binary operation

Published on 17 Jun 2020 - 9:59

score 66 · Answer 15 · 2020-06-25 06:15:40

66

Views

Peano arithmetics formulae examples

Published on 25 Jun 2020 - 6:15

List Question

Proving Natural Predecessor existence using Well Order

Show that the decidability of a statement is undecidable.

Defining specific Exponentiation in PA

Exercise 2.2.1 in Analysis by Terence Tao Induction Proof of Addition Associative Law Natural Numbers

Are mathematical operations axioms?

When can a statement in Second Order Logic be converted into a statement in First Order Logic

Proving addition preserves order in natural numbers

What's the strength of weakening induction in PA by relativizing it to naturals?

While using the method of proof by contradiction, are we "assuming" consistency?

Characterization of provably recursive functions in PA

Every provably recursive function in PA is bounded by a Hardy function

Is the axiom of induction required for proving the first Gödel's incompleteness theorem?

How do I prove this? (Set Theory, Mathematical Logic)

Prove that $+:\mathbb{N} \times \mathbb{N} \to \mathbb{N}$ is a binary operation

Peano arithmetics formulae examples

Trending Questions

Popular # Hahtags

Popular Questions